/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:48:00,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:48:00,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:48:01,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:48:01,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:48:01,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:48:01,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:48:01,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:48:01,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:48:01,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:48:01,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:48:01,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:48:01,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:48:01,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:48:01,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:48:01,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:48:01,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:48:01,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:48:01,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:48:01,059 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:48:01,061 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:48:01,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:48:01,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:48:01,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:48:01,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:48:01,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:48:01,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:48:01,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:48:01,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:48:01,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:48:01,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:48:01,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:48:01,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:48:01,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:48:01,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:48:01,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:48:01,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:48:01,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:48:01,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:48:01,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:48:01,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:48:01,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:48:01,082 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:48:01,113 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:48:01,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:48:01,113 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:48:01,114 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:48:01,114 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:48:01,114 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:48:01,115 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:48:01,115 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:48:01,116 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:48:01,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:48:01,117 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:48:01,117 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:48:01,117 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:48:01,117 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:48:01,117 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:48:01,117 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:48:01,117 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:48:01,118 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:48:01,118 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:48:01,119 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:48:01,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:48:01,119 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:48:01,119 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:48:01,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:48:01,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:48:01,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:48:01,119 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:48:01,120 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:48:01,120 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:48:01,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:48:01,120 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:48:01,120 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:48:01,120 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:48:01,120 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:48:01,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:48:01,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:48:01,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:48:01,362 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:48:01,362 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:48:01,363 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound1.c [2022-04-27 12:48:01,421 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c0ae03c0/31dda03512e84e12960a598e28316a1a/FLAGf3f98209c [2022-04-27 12:48:01,762 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:48:01,762 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound1.c [2022-04-27 12:48:01,768 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c0ae03c0/31dda03512e84e12960a598e28316a1a/FLAGf3f98209c [2022-04-27 12:48:02,211 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c0ae03c0/31dda03512e84e12960a598e28316a1a [2022-04-27 12:48:02,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:48:02,215 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:48:02,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:48:02,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:48:02,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:48:02,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:48:02" (1/1) ... [2022-04-27 12:48:02,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b56ba5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:48:02, skipping insertion in model container [2022-04-27 12:48:02,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:48:02" (1/1) ... [2022-04-27 12:48:02,226 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:48:02,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:48:02,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound1.c[489,502] [2022-04-27 12:48:02,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:48:02,401 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:48:02,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound1.c[489,502] [2022-04-27 12:48:02,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:48:02,431 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:48:02,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:48:02 WrapperNode [2022-04-27 12:48:02,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:48:02,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:48:02,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:48:02,433 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:48:02,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:48:02" (1/1) ... [2022-04-27 12:48:02,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:48:02" (1/1) ... [2022-04-27 12:48:02,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:48:02" (1/1) ... [2022-04-27 12:48:02,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:48:02" (1/1) ... [2022-04-27 12:48:02,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:48:02" (1/1) ... [2022-04-27 12:48:02,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:48:02" (1/1) ... [2022-04-27 12:48:02,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:48:02" (1/1) ... [2022-04-27 12:48:02,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:48:02,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:48:02,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:48:02,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:48:02,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:48:02" (1/1) ... [2022-04-27 12:48:02,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:48:02,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:48:02,496 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 12:48:02,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 12:48:02,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:48:02,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:48:02,530 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:48:02,530 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:48:02,530 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:48:02,531 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:48:02,531 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:48:02,531 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:48:02,531 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:48:02,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:48:02,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 12:48:02,531 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:48:02,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:48:02,532 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:48:02,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:48:02,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:48:02,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:48:02,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:48:02,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:48:02,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:48:02,580 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:48:02,581 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:48:02,734 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:48:02,740 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:48:02,741 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 12:48:02,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:48:02 BoogieIcfgContainer [2022-04-27 12:48:02,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:48:02,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:48:02,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:48:02,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:48:02,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:48:02" (1/3) ... [2022-04-27 12:48:02,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709ea615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:48:02, skipping insertion in model container [2022-04-27 12:48:02,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:48:02" (2/3) ... [2022-04-27 12:48:02,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709ea615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:48:02, skipping insertion in model container [2022-04-27 12:48:02,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:48:02" (3/3) ... [2022-04-27 12:48:02,750 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound1.c [2022-04-27 12:48:02,775 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:48:02,776 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:48:02,834 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:48:02,846 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1141ce94, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@167e55fc [2022-04-27 12:48:02,846 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:48:02,854 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:48:02,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 12:48:02,861 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:48:02,862 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:48:02,862 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:48:02,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:48:02,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1226702723, now seen corresponding path program 1 times [2022-04-27 12:48:02,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:48:02,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202100989] [2022-04-27 12:48:02,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:48:02,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:48:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:03,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:48:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:03,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {38#true} is VALID [2022-04-27 12:48:03,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-27 12:48:03,074 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #82#return; {38#true} is VALID [2022-04-27 12:48:03,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:48:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:03,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-27 12:48:03,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-27 12:48:03,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-27 12:48:03,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #64#return; {39#false} is VALID [2022-04-27 12:48:03,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:48:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:03,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-27 12:48:03,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-27 12:48:03,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-27 12:48:03,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {39#false} #66#return; {39#false} is VALID [2022-04-27 12:48:03,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:48:03,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {38#true} is VALID [2022-04-27 12:48:03,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-27 12:48:03,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #82#return; {38#true} is VALID [2022-04-27 12:48:03,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret7 := main(); {38#true} is VALID [2022-04-27 12:48:03,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {38#true} is VALID [2022-04-27 12:48:03,098 INFO L272 TraceCheckUtils]: 6: Hoare triple {38#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {38#true} is VALID [2022-04-27 12:48:03,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-27 12:48:03,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-27 12:48:03,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-27 12:48:03,099 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {39#false} {38#true} #64#return; {39#false} is VALID [2022-04-27 12:48:03,100 INFO L272 TraceCheckUtils]: 11: Hoare triple {39#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {38#true} is VALID [2022-04-27 12:48:03,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-27 12:48:03,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-27 12:48:03,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-27 12:48:03,101 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {39#false} {39#false} #66#return; {39#false} is VALID [2022-04-27 12:48:03,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {39#false} is VALID [2022-04-27 12:48:03,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-27 12:48:03,102 INFO L272 TraceCheckUtils]: 18: Hoare triple {39#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {39#false} is VALID [2022-04-27 12:48:03,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-04-27 12:48:03,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-04-27 12:48:03,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-27 12:48:03,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:48:03,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:48:03,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202100989] [2022-04-27 12:48:03,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202100989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:48:03,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:48:03,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:48:03,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106340777] [2022-04-27 12:48:03,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:48:03,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 12:48:03,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:48:03,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:48:03,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:48:03,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:48:03,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:48:03,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:48:03,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:48:03,160 INFO L87 Difference]: Start difference. First operand has 35 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:48:03,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:03,326 INFO L93 Difference]: Finished difference Result 64 states and 97 transitions. [2022-04-27 12:48:03,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:48:03,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 12:48:03,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:48:03,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:48:03,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2022-04-27 12:48:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:48:03,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2022-04-27 12:48:03,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 97 transitions. [2022-04-27 12:48:03,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:48:03,458 INFO L225 Difference]: With dead ends: 64 [2022-04-27 12:48:03,459 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 12:48:03,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:48:03,465 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:48:03,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 45 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:48:03,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 12:48:03,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-04-27 12:48:03,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:48:03,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:48:03,496 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:48:03,496 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:48:03,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:03,501 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-04-27 12:48:03,501 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-04-27 12:48:03,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:48:03,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:48:03,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 31 states. [2022-04-27 12:48:03,503 INFO L87 Difference]: Start difference. First operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 31 states. [2022-04-27 12:48:03,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:03,507 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-04-27 12:48:03,508 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-04-27 12:48:03,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:48:03,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:48:03,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:48:03,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:48:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:48:03,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-27 12:48:03,514 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 22 [2022-04-27 12:48:03,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:48:03,515 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-27 12:48:03,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:48:03,515 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-27 12:48:03,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:48:03,516 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:48:03,516 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:48:03,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:48:03,517 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:48:03,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:48:03,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1346542817, now seen corresponding path program 1 times [2022-04-27 12:48:03,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:48:03,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684801433] [2022-04-27 12:48:03,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:48:03,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:48:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:03,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:48:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:03,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:03,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {259#(= ~counter~0 0)} assume true; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:03,669 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {259#(= ~counter~0 0)} {254#true} #82#return; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:03,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:48:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:03,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {254#true} ~cond := #in~cond; {254#true} is VALID [2022-04-27 12:48:03,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} assume !(0 == ~cond); {254#true} is VALID [2022-04-27 12:48:03,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#true} assume true; {254#true} is VALID [2022-04-27 12:48:03,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {254#true} {259#(= ~counter~0 0)} #64#return; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:03,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:48:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:03,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {254#true} ~cond := #in~cond; {254#true} is VALID [2022-04-27 12:48:03,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} assume !(0 == ~cond); {254#true} is VALID [2022-04-27 12:48:03,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#true} assume true; {254#true} is VALID [2022-04-27 12:48:03,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {254#true} {259#(= ~counter~0 0)} #66#return; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:03,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {254#true} call ULTIMATE.init(); {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:48:03,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:03,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {259#(= ~counter~0 0)} assume true; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:03,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {259#(= ~counter~0 0)} {254#true} #82#return; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:03,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {259#(= ~counter~0 0)} call #t~ret7 := main(); {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:03,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {259#(= ~counter~0 0)} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:03,708 INFO L272 TraceCheckUtils]: 6: Hoare triple {259#(= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {254#true} is VALID [2022-04-27 12:48:03,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {254#true} ~cond := #in~cond; {254#true} is VALID [2022-04-27 12:48:03,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {254#true} assume !(0 == ~cond); {254#true} is VALID [2022-04-27 12:48:03,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {254#true} assume true; {254#true} is VALID [2022-04-27 12:48:03,712 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {254#true} {259#(= ~counter~0 0)} #64#return; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:03,712 INFO L272 TraceCheckUtils]: 11: Hoare triple {259#(= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {254#true} is VALID [2022-04-27 12:48:03,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {254#true} ~cond := #in~cond; {254#true} is VALID [2022-04-27 12:48:03,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {254#true} assume !(0 == ~cond); {254#true} is VALID [2022-04-27 12:48:03,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {254#true} assume true; {254#true} is VALID [2022-04-27 12:48:03,714 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {254#true} {259#(= ~counter~0 0)} #66#return; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:03,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {259#(= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:03,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {259#(= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {268#(= |main_#t~post6| 0)} is VALID [2022-04-27 12:48:03,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {268#(= |main_#t~post6| 0)} assume !(#t~post6 < 1);havoc #t~post6; {255#false} is VALID [2022-04-27 12:48:03,717 INFO L272 TraceCheckUtils]: 19: Hoare triple {255#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {255#false} is VALID [2022-04-27 12:48:03,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {255#false} ~cond := #in~cond; {255#false} is VALID [2022-04-27 12:48:03,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {255#false} assume 0 == ~cond; {255#false} is VALID [2022-04-27 12:48:03,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {255#false} assume !false; {255#false} is VALID [2022-04-27 12:48:03,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:48:03,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:48:03,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684801433] [2022-04-27 12:48:03,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684801433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:48:03,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:48:03,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:48:03,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527159063] [2022-04-27 12:48:03,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:48:03,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 12:48:03,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:48:03,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:48:03,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:48:03,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:48:03,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:48:03,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:48:03,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:48:03,757 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:48:04,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:04,023 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2022-04-27 12:48:04,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:48:04,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 12:48:04,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:48:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:48:04,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-04-27 12:48:04,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:48:04,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-04-27 12:48:04,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2022-04-27 12:48:04,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:48:04,105 INFO L225 Difference]: With dead ends: 42 [2022-04-27 12:48:04,105 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 12:48:04,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:48:04,112 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:48:04,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 65 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:48:04,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 12:48:04,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 12:48:04,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:48:04,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:48:04,125 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:48:04,126 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:48:04,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:04,132 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 12:48:04,132 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 12:48:04,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:48:04,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:48:04,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 32 states. [2022-04-27 12:48:04,143 INFO L87 Difference]: Start difference. First operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 32 states. [2022-04-27 12:48:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:04,147 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 12:48:04,147 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 12:48:04,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:48:04,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:48:04,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:48:04,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:48:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:48:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-27 12:48:04,151 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2022-04-27 12:48:04,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:48:04,151 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-27 12:48:04,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:48:04,152 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 12:48:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:48:04,164 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:48:04,164 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:48:04,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 12:48:04,164 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:48:04,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:48:04,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1348211113, now seen corresponding path program 1 times [2022-04-27 12:48:04,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:48:04,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583112550] [2022-04-27 12:48:04,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:48:04,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:48:04,186 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:48:04,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1753929083] [2022-04-27 12:48:04,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:48:04,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:48:04,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:48:04,189 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:48:04,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 12:48:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:04,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:48:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:04,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:48:06,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {452#true} call ULTIMATE.init(); {452#true} is VALID [2022-04-27 12:48:06,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {452#true} is VALID [2022-04-27 12:48:06,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {452#true} assume true; {452#true} is VALID [2022-04-27 12:48:06,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {452#true} {452#true} #82#return; {452#true} is VALID [2022-04-27 12:48:06,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {452#true} call #t~ret7 := main(); {452#true} is VALID [2022-04-27 12:48:06,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {452#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {452#true} is VALID [2022-04-27 12:48:06,772 INFO L272 TraceCheckUtils]: 6: Hoare triple {452#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {452#true} is VALID [2022-04-27 12:48:06,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {452#true} ~cond := #in~cond; {452#true} is VALID [2022-04-27 12:48:06,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {452#true} assume !(0 == ~cond); {452#true} is VALID [2022-04-27 12:48:06,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {452#true} assume true; {452#true} is VALID [2022-04-27 12:48:06,773 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {452#true} {452#true} #64#return; {452#true} is VALID [2022-04-27 12:48:06,773 INFO L272 TraceCheckUtils]: 11: Hoare triple {452#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {452#true} is VALID [2022-04-27 12:48:06,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {452#true} ~cond := #in~cond; {452#true} is VALID [2022-04-27 12:48:06,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {452#true} assume !(0 == ~cond); {452#true} is VALID [2022-04-27 12:48:06,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {452#true} assume true; {452#true} is VALID [2022-04-27 12:48:06,774 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {452#true} {452#true} #66#return; {452#true} is VALID [2022-04-27 12:48:06,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {452#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-27 12:48:06,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-27 12:48:06,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} assume !!(#t~post6 < 1);havoc #t~post6; {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-27 12:48:06,794 INFO L272 TraceCheckUtils]: 19: Hoare triple {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {515#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:48:06,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {515#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {519#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:48:06,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {519#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {453#false} is VALID [2022-04-27 12:48:06,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {453#false} assume !false; {453#false} is VALID [2022-04-27 12:48:06,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:48:06,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:48:06,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:48:06,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583112550] [2022-04-27 12:48:06,796 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:48:06,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753929083] [2022-04-27 12:48:06,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753929083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:48:06,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:48:06,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:48:06,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953758352] [2022-04-27 12:48:06,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:48:06,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 12:48:06,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:48:06,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:48:06,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:48:06,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:48:06,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:48:06,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:48:06,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:48:06,835 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:48:07,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:07,142 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-04-27 12:48:07,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:48:07,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 12:48:07,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:48:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:48:07,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 12:48:07,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:48:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 12:48:07,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-27 12:48:07,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:48:07,246 INFO L225 Difference]: With dead ends: 49 [2022-04-27 12:48:07,247 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 12:48:07,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:48:07,248 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:48:07,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 134 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:48:07,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 12:48:07,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-04-27 12:48:07,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:48:07,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:48:07,257 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:48:07,257 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:48:07,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:07,260 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-27 12:48:07,260 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-27 12:48:07,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:48:07,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:48:07,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 47 states. [2022-04-27 12:48:07,262 INFO L87 Difference]: Start difference. First operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 47 states. [2022-04-27 12:48:07,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:07,265 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-27 12:48:07,265 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-27 12:48:07,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:48:07,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:48:07,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:48:07,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:48:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:48:07,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2022-04-27 12:48:07,268 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 23 [2022-04-27 12:48:07,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:48:07,269 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2022-04-27 12:48:07,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:48:07,269 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-27 12:48:07,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 12:48:07,270 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:48:07,270 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:48:07,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 12:48:07,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:48:07,490 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:48:07,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:48:07,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1060153012, now seen corresponding path program 1 times [2022-04-27 12:48:07,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:48:07,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087056945] [2022-04-27 12:48:07,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:48:07,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:48:07,514 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:48:07,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1015424940] [2022-04-27 12:48:07,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:48:07,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:48:07,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:48:07,518 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:48:07,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 12:48:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:07,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:48:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:07,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:48:10,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {767#true} call ULTIMATE.init(); {767#true} is VALID [2022-04-27 12:48:10,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {767#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {767#true} is VALID [2022-04-27 12:48:10,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {767#true} assume true; {767#true} is VALID [2022-04-27 12:48:10,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {767#true} {767#true} #82#return; {767#true} is VALID [2022-04-27 12:48:10,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {767#true} call #t~ret7 := main(); {767#true} is VALID [2022-04-27 12:48:10,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {767#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {767#true} is VALID [2022-04-27 12:48:10,865 INFO L272 TraceCheckUtils]: 6: Hoare triple {767#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {767#true} is VALID [2022-04-27 12:48:10,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {767#true} ~cond := #in~cond; {793#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:48:10,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {793#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {797#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:48:10,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {797#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {797#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:48:10,867 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {797#(not (= |assume_abort_if_not_#in~cond| 0))} {767#true} #64#return; {804#(<= 1 main_~x~0)} is VALID [2022-04-27 12:48:10,867 INFO L272 TraceCheckUtils]: 11: Hoare triple {804#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {767#true} is VALID [2022-04-27 12:48:10,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {767#true} ~cond := #in~cond; {767#true} is VALID [2022-04-27 12:48:10,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {767#true} assume !(0 == ~cond); {767#true} is VALID [2022-04-27 12:48:10,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {767#true} assume true; {767#true} is VALID [2022-04-27 12:48:10,870 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {767#true} {804#(<= 1 main_~x~0)} #66#return; {804#(<= 1 main_~x~0)} is VALID [2022-04-27 12:48:10,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {804#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:48:10,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:48:10,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 1);havoc #t~post6; {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:48:10,872 INFO L272 TraceCheckUtils]: 19: Hoare triple {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {767#true} is VALID [2022-04-27 12:48:10,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {767#true} ~cond := #in~cond; {767#true} is VALID [2022-04-27 12:48:10,872 INFO L290 TraceCheckUtils]: 21: Hoare triple {767#true} assume !(0 == ~cond); {767#true} is VALID [2022-04-27 12:48:10,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {767#true} assume true; {767#true} is VALID [2022-04-27 12:48:10,874 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {767#true} {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #68#return; {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:48:10,875 INFO L272 TraceCheckUtils]: 24: Hoare triple {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {848#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:48:10,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {848#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {852#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:48:10,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {852#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {768#false} is VALID [2022-04-27 12:48:10,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {768#false} assume !false; {768#false} is VALID [2022-04-27 12:48:10,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 12:48:10,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:48:43,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:48:43,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087056945] [2022-04-27 12:48:43,759 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:48:43,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015424940] [2022-04-27 12:48:43,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015424940] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:48:43,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:48:43,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 12:48:43,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829713464] [2022-04-27 12:48:43,760 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:48:43,761 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-27 12:48:43,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:48:43,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:48:43,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:48:43,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:48:43,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:48:43,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:48:43,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:48:43,788 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:48:44,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:44,226 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2022-04-27 12:48:44,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:48:44,227 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-27 12:48:44,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:48:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:48:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-04-27 12:48:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:48:44,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-04-27 12:48:44,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 64 transitions. [2022-04-27 12:48:44,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:48:44,291 INFO L225 Difference]: With dead ends: 53 [2022-04-27 12:48:44,292 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 12:48:44,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:48:44,293 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 21 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:48:44,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 185 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:48:44,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 12:48:44,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-27 12:48:44,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:48:44,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:48:44,310 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:48:44,310 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:48:44,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:44,313 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-04-27 12:48:44,313 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2022-04-27 12:48:44,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:48:44,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:48:44,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 51 states. [2022-04-27 12:48:44,315 INFO L87 Difference]: Start difference. First operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 51 states. [2022-04-27 12:48:44,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:44,317 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-04-27 12:48:44,317 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2022-04-27 12:48:44,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:48:44,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:48:44,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:48:44,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:48:44,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:48:44,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2022-04-27 12:48:44,321 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 28 [2022-04-27 12:48:44,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:48:44,321 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2022-04-27 12:48:44,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:48:44,321 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-27 12:48:44,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 12:48:44,322 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:48:44,322 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:48:44,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 12:48:44,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 12:48:44,535 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:48:44,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:48:44,536 INFO L85 PathProgramCache]: Analyzing trace with hash -560761015, now seen corresponding path program 1 times [2022-04-27 12:48:44,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:48:44,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966156419] [2022-04-27 12:48:44,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:48:44,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:48:44,555 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:48:44,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [535258477] [2022-04-27 12:48:44,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:48:44,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:48:44,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:48:44,565 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:48:44,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 12:48:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:44,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:48:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:44,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:48:44,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {1136#true} call ULTIMATE.init(); {1136#true} is VALID [2022-04-27 12:48:44,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {1136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1136#true} is VALID [2022-04-27 12:48:44,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:48:44,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1136#true} {1136#true} #82#return; {1136#true} is VALID [2022-04-27 12:48:44,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {1136#true} call #t~ret7 := main(); {1136#true} is VALID [2022-04-27 12:48:44,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {1136#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1136#true} is VALID [2022-04-27 12:48:44,834 INFO L272 TraceCheckUtils]: 6: Hoare triple {1136#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:48:44,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {1136#true} ~cond := #in~cond; {1162#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:48:44,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {1162#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1166#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:48:44,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {1166#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1166#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:48:44,841 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1166#(not (= |assume_abort_if_not_#in~cond| 0))} {1136#true} #64#return; {1173#(<= 1 main_~x~0)} is VALID [2022-04-27 12:48:44,841 INFO L272 TraceCheckUtils]: 11: Hoare triple {1173#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:48:44,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {1136#true} ~cond := #in~cond; {1136#true} is VALID [2022-04-27 12:48:44,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {1136#true} assume !(0 == ~cond); {1136#true} is VALID [2022-04-27 12:48:44,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:48:44,842 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1136#true} {1173#(<= 1 main_~x~0)} #66#return; {1173#(<= 1 main_~x~0)} is VALID [2022-04-27 12:48:44,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {1173#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:48:44,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:48:44,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post6 < 1);havoc #t~post6; {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:48:44,843 INFO L272 TraceCheckUtils]: 19: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:48:44,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {1136#true} ~cond := #in~cond; {1136#true} is VALID [2022-04-27 12:48:44,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {1136#true} assume !(0 == ~cond); {1136#true} is VALID [2022-04-27 12:48:44,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:48:44,845 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1136#true} {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #68#return; {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:48:44,845 INFO L272 TraceCheckUtils]: 24: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:48:44,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {1136#true} ~cond := #in~cond; {1136#true} is VALID [2022-04-27 12:48:44,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {1136#true} assume !(0 == ~cond); {1136#true} is VALID [2022-04-27 12:48:44,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:48:44,846 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1136#true} {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #70#return; {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:48:44,847 INFO L272 TraceCheckUtils]: 29: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1232#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:48:44,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {1232#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1236#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:48:44,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {1236#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1137#false} is VALID [2022-04-27 12:48:44,848 INFO L290 TraceCheckUtils]: 32: Hoare triple {1137#false} assume !false; {1137#false} is VALID [2022-04-27 12:48:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 12:48:44,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:48:45,041 INFO L290 TraceCheckUtils]: 32: Hoare triple {1137#false} assume !false; {1137#false} is VALID [2022-04-27 12:48:45,041 INFO L290 TraceCheckUtils]: 31: Hoare triple {1236#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1137#false} is VALID [2022-04-27 12:48:45,042 INFO L290 TraceCheckUtils]: 30: Hoare triple {1232#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1236#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:48:45,043 INFO L272 TraceCheckUtils]: 29: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1232#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:48:45,044 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1136#true} {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #70#return; {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:48:45,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:48:45,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {1136#true} assume !(0 == ~cond); {1136#true} is VALID [2022-04-27 12:48:45,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {1136#true} ~cond := #in~cond; {1136#true} is VALID [2022-04-27 12:48:45,044 INFO L272 TraceCheckUtils]: 24: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:48:45,045 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1136#true} {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #68#return; {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:48:45,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:48:45,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {1136#true} assume !(0 == ~cond); {1136#true} is VALID [2022-04-27 12:48:45,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {1136#true} ~cond := #in~cond; {1136#true} is VALID [2022-04-27 12:48:45,046 INFO L272 TraceCheckUtils]: 19: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:48:45,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 1);havoc #t~post6; {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:48:45,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:48:45,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {1136#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:48:45,047 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1136#true} {1136#true} #66#return; {1136#true} is VALID [2022-04-27 12:48:45,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:48:45,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {1136#true} assume !(0 == ~cond); {1136#true} is VALID [2022-04-27 12:48:45,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {1136#true} ~cond := #in~cond; {1136#true} is VALID [2022-04-27 12:48:45,048 INFO L272 TraceCheckUtils]: 11: Hoare triple {1136#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:48:45,048 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1136#true} {1136#true} #64#return; {1136#true} is VALID [2022-04-27 12:48:45,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:48:45,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {1136#true} assume !(0 == ~cond); {1136#true} is VALID [2022-04-27 12:48:45,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {1136#true} ~cond := #in~cond; {1136#true} is VALID [2022-04-27 12:48:45,049 INFO L272 TraceCheckUtils]: 6: Hoare triple {1136#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:48:45,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {1136#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1136#true} is VALID [2022-04-27 12:48:45,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {1136#true} call #t~ret7 := main(); {1136#true} is VALID [2022-04-27 12:48:45,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1136#true} {1136#true} #82#return; {1136#true} is VALID [2022-04-27 12:48:45,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:48:45,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {1136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1136#true} is VALID [2022-04-27 12:48:45,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {1136#true} call ULTIMATE.init(); {1136#true} is VALID [2022-04-27 12:48:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 12:48:45,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:48:45,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966156419] [2022-04-27 12:48:45,050 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:48:45,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535258477] [2022-04-27 12:48:45,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535258477] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:48:45,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:48:45,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-27 12:48:45,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477979110] [2022-04-27 12:48:45,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:48:45,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 12:48:45,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:48:45,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:48:45,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:48:45,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:48:45,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:48:45,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:48:45,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:48:45,079 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:48:45,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:45,415 INFO L93 Difference]: Finished difference Result 75 states and 107 transitions. [2022-04-27 12:48:45,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:48:45,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 12:48:45,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:48:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:48:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 12:48:45,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:48:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 12:48:45,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-27 12:48:45,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:48:45,471 INFO L225 Difference]: With dead ends: 75 [2022-04-27 12:48:45,471 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 12:48:45,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:48:45,472 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:48:45,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 128 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:48:45,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 12:48:45,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-27 12:48:45,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:48:45,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:48:45,504 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:48:45,505 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:48:45,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:45,509 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2022-04-27 12:48:45,509 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2022-04-27 12:48:45,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:48:45,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:48:45,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-27 12:48:45,511 INFO L87 Difference]: Start difference. First operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-27 12:48:45,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:45,514 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2022-04-27 12:48:45,514 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2022-04-27 12:48:45,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:48:45,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:48:45,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:48:45,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:48:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:48:45,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2022-04-27 12:48:45,518 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 33 [2022-04-27 12:48:45,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:48:45,519 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2022-04-27 12:48:45,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:48:45,519 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2022-04-27 12:48:45,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 12:48:45,520 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:48:45,520 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:48:45,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:48:45,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:48:45,736 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:48:45,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:48:45,736 INFO L85 PathProgramCache]: Analyzing trace with hash 201438379, now seen corresponding path program 1 times [2022-04-27 12:48:45,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:48:45,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364826869] [2022-04-27 12:48:45,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:48:45,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:48:45,749 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:48:45,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [961740119] [2022-04-27 12:48:45,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:48:45,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:48:45,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:48:45,751 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:48:45,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 12:48:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:45,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:48:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:45,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:48:45,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {1712#true} call ULTIMATE.init(); {1712#true} is VALID [2022-04-27 12:48:45,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {1712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1712#true} is VALID [2022-04-27 12:48:45,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {1712#true} assume true; {1712#true} is VALID [2022-04-27 12:48:45,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1712#true} {1712#true} #82#return; {1712#true} is VALID [2022-04-27 12:48:45,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {1712#true} call #t~ret7 := main(); {1712#true} is VALID [2022-04-27 12:48:45,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {1712#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1712#true} is VALID [2022-04-27 12:48:45,916 INFO L272 TraceCheckUtils]: 6: Hoare triple {1712#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1712#true} is VALID [2022-04-27 12:48:45,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {1712#true} ~cond := #in~cond; {1712#true} is VALID [2022-04-27 12:48:45,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {1712#true} assume !(0 == ~cond); {1712#true} is VALID [2022-04-27 12:48:45,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {1712#true} assume true; {1712#true} is VALID [2022-04-27 12:48:45,916 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1712#true} {1712#true} #64#return; {1712#true} is VALID [2022-04-27 12:48:45,916 INFO L272 TraceCheckUtils]: 11: Hoare triple {1712#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1712#true} is VALID [2022-04-27 12:48:45,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {1712#true} ~cond := #in~cond; {1712#true} is VALID [2022-04-27 12:48:45,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {1712#true} assume !(0 == ~cond); {1712#true} is VALID [2022-04-27 12:48:45,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {1712#true} assume true; {1712#true} is VALID [2022-04-27 12:48:45,917 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1712#true} {1712#true} #66#return; {1712#true} is VALID [2022-04-27 12:48:45,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {1712#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1712#true} is VALID [2022-04-27 12:48:45,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {1712#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1712#true} is VALID [2022-04-27 12:48:45,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {1712#true} assume !!(#t~post6 < 1);havoc #t~post6; {1712#true} is VALID [2022-04-27 12:48:45,917 INFO L272 TraceCheckUtils]: 19: Hoare triple {1712#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1712#true} is VALID [2022-04-27 12:48:45,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {1712#true} ~cond := #in~cond; {1712#true} is VALID [2022-04-27 12:48:45,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {1712#true} assume !(0 == ~cond); {1712#true} is VALID [2022-04-27 12:48:45,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {1712#true} assume true; {1712#true} is VALID [2022-04-27 12:48:45,918 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1712#true} {1712#true} #68#return; {1712#true} is VALID [2022-04-27 12:48:45,918 INFO L272 TraceCheckUtils]: 24: Hoare triple {1712#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1712#true} is VALID [2022-04-27 12:48:45,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {1712#true} ~cond := #in~cond; {1712#true} is VALID [2022-04-27 12:48:45,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {1712#true} assume !(0 == ~cond); {1712#true} is VALID [2022-04-27 12:48:45,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {1712#true} assume true; {1712#true} is VALID [2022-04-27 12:48:45,918 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1712#true} {1712#true} #70#return; {1712#true} is VALID [2022-04-27 12:48:45,918 INFO L272 TraceCheckUtils]: 29: Hoare triple {1712#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1712#true} is VALID [2022-04-27 12:48:45,919 INFO L290 TraceCheckUtils]: 30: Hoare triple {1712#true} ~cond := #in~cond; {1712#true} is VALID [2022-04-27 12:48:45,919 INFO L290 TraceCheckUtils]: 31: Hoare triple {1712#true} assume !(0 == ~cond); {1712#true} is VALID [2022-04-27 12:48:45,919 INFO L290 TraceCheckUtils]: 32: Hoare triple {1712#true} assume true; {1712#true} is VALID [2022-04-27 12:48:45,919 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1712#true} {1712#true} #72#return; {1712#true} is VALID [2022-04-27 12:48:45,921 INFO L290 TraceCheckUtils]: 34: Hoare triple {1712#true} assume !(~a~0 != ~b~0); {1819#(= main_~b~0 main_~a~0)} is VALID [2022-04-27 12:48:45,922 INFO L272 TraceCheckUtils]: 35: Hoare triple {1819#(= main_~b~0 main_~a~0)} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {1823#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:48:45,922 INFO L290 TraceCheckUtils]: 36: Hoare triple {1823#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1827#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:48:45,923 INFO L290 TraceCheckUtils]: 37: Hoare triple {1827#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1713#false} is VALID [2022-04-27 12:48:45,923 INFO L290 TraceCheckUtils]: 38: Hoare triple {1713#false} assume !false; {1713#false} is VALID [2022-04-27 12:48:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 12:48:45,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:48:45,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:48:45,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364826869] [2022-04-27 12:48:45,923 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:48:45,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961740119] [2022-04-27 12:48:45,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961740119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:48:45,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:48:45,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:48:45,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696783893] [2022-04-27 12:48:45,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:48:45,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2022-04-27 12:48:45,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:48:45,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:48:45,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:48:45,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:48:45,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:48:45,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:48:45,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:48:45,948 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:48:46,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:46,133 INFO L93 Difference]: Finished difference Result 87 states and 123 transitions. [2022-04-27 12:48:46,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:48:46,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2022-04-27 12:48:46,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:48:46,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:48:46,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-27 12:48:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:48:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-27 12:48:46,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-27 12:48:46,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:48:46,185 INFO L225 Difference]: With dead ends: 87 [2022-04-27 12:48:46,185 INFO L226 Difference]: Without dead ends: 85 [2022-04-27 12:48:46,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:48:46,189 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 5 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:48:46,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 144 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:48:46,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-27 12:48:46,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2022-04-27 12:48:46,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:48:46,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:48:46,231 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:48:46,231 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:48:46,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:46,237 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2022-04-27 12:48:46,237 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2022-04-27 12:48:46,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:48:46,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:48:46,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) Second operand 85 states. [2022-04-27 12:48:46,238 INFO L87 Difference]: Start difference. First operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) Second operand 85 states. [2022-04-27 12:48:46,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:46,243 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2022-04-27 12:48:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2022-04-27 12:48:46,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:48:46,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:48:46,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:48:46,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:48:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:48:46,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2022-04-27 12:48:46,247 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 39 [2022-04-27 12:48:46,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:48:46,249 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2022-04-27 12:48:46,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:48:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2022-04-27 12:48:46,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 12:48:46,251 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:48:46,251 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:48:46,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 12:48:46,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:48:46,474 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:48:46,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:48:46,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1085077998, now seen corresponding path program 1 times [2022-04-27 12:48:46,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:48:46,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886070248] [2022-04-27 12:48:46,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:48:46,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:48:46,488 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:48:46,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1161394783] [2022-04-27 12:48:46,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:48:46,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:48:46,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:48:46,504 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:48:46,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 12:48:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 12:48:46,542 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 12:48:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 12:48:46,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 12:48:46,576 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 12:48:46,577 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 12:48:46,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 12:48:46,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:48:46,804 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:48:46,807 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 12:48:46,831 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 12:48:46,831 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 12:48:46,832 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 12:48:46,832 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 12:48:46,832 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 12:48:46,832 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 12:48:46,832 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 12:48:46,832 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 12:48:46,832 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:48:46,832 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 12:48:46,832 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 12:48:46,832 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 12:48:46,832 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 12:48:46,832 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 12:48:46,832 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 12:48:46,832 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 12:48:46,832 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 12:48:46,832 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 12:48:46,832 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:48:46,833 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-27 12:48:46,833 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 12:48:46,833 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 12:48:46,833 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:48:46,833 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:48:46,833 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-27 12:48:46,833 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:48:46,833 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:48:46,833 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 12:48:46,833 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:48:46,833 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:48:46,833 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:48:46,833 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:48:46,833 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:48:46,833 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:48:46,833 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:48:46,833 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2022-04-27 12:48:46,834 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2022-04-27 12:48:46,834 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 12:48:46,834 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 12:48:46,834 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 12:48:46,834 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 12:48:46,834 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 12:48:46,834 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 12:48:46,834 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 12:48:46,834 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 12:48:46,834 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-04-27 12:48:46,834 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-04-27 12:48:46,834 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-27 12:48:46,834 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-27 12:48:46,834 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-27 12:48:46,834 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 12:48:46,834 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 12:48:46,834 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 12:48:46,834 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 12:48:46,834 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 12:48:46,835 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 12:48:46,835 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 12:48:46,835 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 12:48:46,835 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 12:48:46,835 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 12:48:46,835 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 12:48:46,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 12:48:46 BoogieIcfgContainer [2022-04-27 12:48:46,835 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 12:48:46,836 INFO L158 Benchmark]: Toolchain (without parser) took 44621.91ms. Allocated memory was 182.5MB in the beginning and 272.6MB in the end (delta: 90.2MB). Free memory was 154.7MB in the beginning and 230.6MB in the end (delta: -76.0MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. [2022-04-27 12:48:46,837 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 12:48:46,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.68ms. Allocated memory was 182.5MB in the beginning and 272.6MB in the end (delta: 90.2MB). Free memory was 154.5MB in the beginning and 242.7MB in the end (delta: -88.2MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. [2022-04-27 12:48:46,837 INFO L158 Benchmark]: Boogie Preprocessor took 33.15ms. Allocated memory is still 272.6MB. Free memory was 242.7MB in the beginning and 241.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 12:48:46,837 INFO L158 Benchmark]: RCFGBuilder took 275.89ms. Allocated memory is still 272.6MB. Free memory was 241.1MB in the beginning and 229.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 12:48:46,838 INFO L158 Benchmark]: TraceAbstraction took 44091.17ms. Allocated memory is still 272.6MB. Free memory was 229.1MB in the beginning and 230.6MB in the end (delta: -1.5MB). Peak memory consumption was 33.2kB. Max. memory is 8.0GB. [2022-04-27 12:48:46,839 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.68ms. Allocated memory was 182.5MB in the beginning and 272.6MB in the end (delta: 90.2MB). Free memory was 154.5MB in the beginning and 242.7MB in the end (delta: -88.2MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.15ms. Allocated memory is still 272.6MB. Free memory was 242.7MB in the beginning and 241.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 275.89ms. Allocated memory is still 272.6MB. Free memory was 241.1MB in the beginning and 229.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 44091.17ms. Allocated memory is still 272.6MB. Free memory was 229.1MB in the beginning and 230.6MB in the end (delta: -1.5MB). Peak memory consumption was 33.2kB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [\old(counter)=6, counter=0] [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [\old(counter)=0, counter=0, x=3, y=1] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [\old(counter)=0, counter=0, x=3, y=1] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [\old(counter)=0, a=3, b=1, counter=0, p=1, q=0, r=0, s=1, x=3, y=1] [L34] EXPR counter++ VAL [\old(counter)=0, a=3, b=1, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=3, y=1] [L34] COND TRUE counter++<1 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=3, b=1, counter=1, p=1, q=0, r=0, s=1, x=3, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=3, b=1, counter=1, p=1, q=0, r=0, s=1, x=3, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=3, b=1, counter=1, p=1, q=0, r=0, s=1, x=3, y=1] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=3, b=1, counter=1, p=1, q=0, r=0, s=1, x=3, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=2, b=1, counter=1, p=1, q=0, r=-1, s=1, x=3, y=1] [L34] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, counter=2, counter++=1, p=1, q=0, r=-1, s=1, x=3, y=1] [L34] COND FALSE !(counter++<1) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, \old(counter)=0, counter=2] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=2] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.0s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66 mSDsluCounter, 701 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 460 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 332 IncrementalHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 241 mSDtfsCounter, 332 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 152 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=6, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 39.6s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 451 SizeOfPredicates, 6 NumberOfNonLiveVariables, 452 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 58/64 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 12:48:46,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...