/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench/geo3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 23:41:40,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 23:41:40,503 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 23:41:40,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 23:41:40,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 23:41:40,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 23:41:40,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 23:41:40,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 23:41:40,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 23:41:40,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 23:41:40,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 23:41:40,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 23:41:40,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 23:41:40,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 23:41:40,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 23:41:40,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 23:41:40,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 23:41:40,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 23:41:40,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 23:41:40,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 23:41:40,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 23:41:40,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 23:41:40,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 23:41:40,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 23:41:40,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 23:41:40,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 23:41:40,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 23:41:40,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 23:41:40,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 23:41:40,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 23:41:40,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 23:41:40,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 23:41:40,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 23:41:40,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 23:41:40,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 23:41:40,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 23:41:40,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 23:41:40,551 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 23:41:40,551 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 23:41:40,552 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 23:41:40,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 23:41:40,554 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 [2020-07-21 23:41:40,569 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 23:41:40,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 23:41:40,570 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 23:41:40,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 23:41:40,571 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 23:41:40,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 23:41:40,571 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 23:41:40,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 23:41:40,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 23:41:40,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 23:41:40,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 23:41:40,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 23:41:40,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 23:41:40,573 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 23:41:40,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 23:41:40,573 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 23:41:40,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 23:41:40,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 23:41:40,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 23:41:40,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 23:41:40,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 23:41:40,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 23:41:40,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 23:41:40,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 23:41:40,575 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 23:41:40,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 23:41:40,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:41:40,576 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 23:41:40,576 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 23:41:40,576 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 [2020-07-21 23:41:40,868 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 23:41:40,889 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 23:41:40,893 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 23:41:40,894 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 23:41:40,897 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 23:41:40,898 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/geo3.c [2020-07-21 23:41:40,972 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/249bb87cd/50e7ecc9d2b9410a9fccaeaaea1ad3f9/FLAGc90ea97b2 [2020-07-21 23:41:41,504 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 23:41:41,505 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/geo3.c [2020-07-21 23:41:41,512 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/249bb87cd/50e7ecc9d2b9410a9fccaeaaea1ad3f9/FLAGc90ea97b2 [2020-07-21 23:41:41,916 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/249bb87cd/50e7ecc9d2b9410a9fccaeaaea1ad3f9 [2020-07-21 23:41:41,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 23:41:41,931 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 23:41:41,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 23:41:41,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 23:41:41,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 23:41:41,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:41:41" (1/1) ... [2020-07-21 23:41:41,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8c1581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:41:41, skipping insertion in model container [2020-07-21 23:41:41,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:41:41" (1/1) ... [2020-07-21 23:41:41,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 23:41:41,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 23:41:42,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 23:41:42,142 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 23:41:42,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 23:41:42,172 INFO L208 MainTranslator]: Completed translation [2020-07-21 23:41:42,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:41:42 WrapperNode [2020-07-21 23:41:42,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 23:41:42,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 23:41:42,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 23:41:42,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 23:41:42,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:41:42" (1/1) ... [2020-07-21 23:41:42,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:41:42" (1/1) ... [2020-07-21 23:41:42,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:41:42" (1/1) ... [2020-07-21 23:41:42,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:41:42" (1/1) ... [2020-07-21 23:41:42,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:41:42" (1/1) ... [2020-07-21 23:41:42,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:41:42" (1/1) ... [2020-07-21 23:41:42,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:41:42" (1/1) ... [2020-07-21 23:41:42,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 23:41:42,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 23:41:42,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 23:41:42,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 23:41:42,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:41:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 23:41:42,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 23:41:42,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 23:41:42,358 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-21 23:41:42,358 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-21 23:41:42,358 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 23:41:42,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 23:41:42,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 23:41:42,358 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-21 23:41:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-21 23:41:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-21 23:41:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 23:41:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 23:41:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 23:41:42,569 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 23:41:42,570 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-21 23:41:42,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:41:42 BoogieIcfgContainer [2020-07-21 23:41:42,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 23:41:42,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 23:41:42,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 23:41:42,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 23:41:42,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 11:41:41" (1/3) ... [2020-07-21 23:41:42,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ee88ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:41:42, skipping insertion in model container [2020-07-21 23:41:42,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:41:42" (2/3) ... [2020-07-21 23:41:42,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ee88ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:41:42, skipping insertion in model container [2020-07-21 23:41:42,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:41:42" (3/3) ... [2020-07-21 23:41:42,582 INFO L109 eAbstractionObserver]: Analyzing ICFG geo3.c [2020-07-21 23:41:42,593 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 23:41:42,601 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 23:41:42,616 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 23:41:42,640 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 23:41:42,640 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 23:41:42,640 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 23:41:42,640 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 23:41:42,640 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 23:41:42,640 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 23:41:42,640 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 23:41:42,641 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 23:41:42,658 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-21 23:41:42,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-21 23:41:42,664 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:41:42,665 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:41:42,665 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:41:42,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:41:42,671 INFO L82 PathProgramCache]: Analyzing trace with hash -64610451, now seen corresponding path program 1 times [2020-07-21 23:41:42,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:41:42,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [176612477] [2020-07-21 23:41:42,678 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:41:42,752 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 23:41:42,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:41:42,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-21 23:41:42,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:41:42,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 23:41:42,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:41:42,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [176612477] [2020-07-21 23:41:42,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:41:42,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-21 23:41:42,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456952981] [2020-07-21 23:41:42,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-21 23:41:42,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:41:42,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-21 23:41:42,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-21 23:41:42,829 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-21 23:41:42,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:41:42,856 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2020-07-21 23:41:42,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-21 23:41:42,858 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-21 23:41:42,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:41:42,869 INFO L225 Difference]: With dead ends: 35 [2020-07-21 23:41:42,869 INFO L226 Difference]: Without dead ends: 15 [2020-07-21 23:41:42,873 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-21 23:41:42,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-21 23:41:42,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-21 23:41:42,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-21 23:41:42,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-21 23:41:42,931 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2020-07-21 23:41:42,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:41:42,932 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-21 23:41:42,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-21 23:41:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-21 23:41:42,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-21 23:41:42,933 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:41:42,933 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:41:43,147 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:41:43,147 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:41:43,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:41:43,148 INFO L82 PathProgramCache]: Analyzing trace with hash -62822991, now seen corresponding path program 1 times [2020-07-21 23:41:43,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:41:43,148 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1493427919] [2020-07-21 23:41:43,149 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:41:43,185 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 23:41:43,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:41:43,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-21 23:41:43,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:41:43,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 23:41:43,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:41:43,306 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1493427919] [2020-07-21 23:41:43,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:41:43,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 23:41:43,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273426865] [2020-07-21 23:41:43,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 23:41:43,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:41:43,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 23:41:43,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 23:41:43,313 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2020-07-21 23:41:43,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:41:43,403 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-21 23:41:43,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 23:41:43,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-21 23:41:43,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:41:43,405 INFO L225 Difference]: With dead ends: 25 [2020-07-21 23:41:43,405 INFO L226 Difference]: Without dead ends: 22 [2020-07-21 23:41:43,407 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 23:41:43,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-21 23:41:43,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-21 23:41:43,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-21 23:41:43,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-21 23:41:43,415 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 10 [2020-07-21 23:41:43,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:41:43,415 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-21 23:41:43,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 23:41:43,416 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-21 23:41:43,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-21 23:41:43,417 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:41:43,417 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:41:43,630 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:41:43,631 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:41:43,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:41:43,632 INFO L82 PathProgramCache]: Analyzing trace with hash 50868238, now seen corresponding path program 1 times [2020-07-21 23:41:43,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:41:43,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1352892905] [2020-07-21 23:41:43,634 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:41:43,676 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 23:41:43,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:41:43,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-21 23:41:43,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:41:43,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 23:41:43,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 23:41:43,824 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 23:41:48,074 WARN L860 $PredicateComparison]: unable to prove that (= (+ (* c_main_~x~0 c_main_~z~0) (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~a~0)) (+ (* c_main_~z~0 c_main_~a~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0))) is different from true [2020-07-21 23:41:48,151 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 23:41:48,152 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 23:41:50,227 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~x~0 c_main_~z~0))) (or (= (+ .cse0 (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~a~0)) (+ (* c_main_~z~0 c_main_~a~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0))) (not (= (+ .cse0 c_main_~a~0) (+ c_main_~x~0 (* c_main_~y~0 c_main_~z~0 c_main_~a~0)))))) is different from true [2020-07-21 23:41:50,239 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 23:41:50,254 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 23:41:50,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-07-21 23:41:50,390 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1352892905] [2020-07-21 23:41:50,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 23:41:50,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2020-07-21 23:41:50,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172922221] [2020-07-21 23:41:50,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-21 23:41:50,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:41:50,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-21 23:41:50,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=69, Unknown=3, NotChecked=34, Total=132 [2020-07-21 23:41:50,393 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 12 states. [2020-07-21 23:41:52,840 WARN L193 SmtUtils]: Spent 2.32 s on a formula simplification that was a NOOP. DAG size: 14 [2020-07-21 23:41:55,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:41:55,213 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-21 23:41:55,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-21 23:41:55,214 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-07-21 23:41:55,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:41:55,215 INFO L225 Difference]: With dead ends: 32 [2020-07-21 23:41:55,216 INFO L226 Difference]: Without dead ends: 28 [2020-07-21 23:41:55,217 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=43, Invalid=118, Unknown=3, NotChecked=46, Total=210 [2020-07-21 23:41:55,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-21 23:41:55,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-21 23:41:55,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-21 23:41:55,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-07-21 23:41:55,230 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 17 [2020-07-21 23:41:55,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:41:55,231 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-07-21 23:41:55,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-21 23:41:55,231 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-21 23:41:55,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-21 23:41:55,233 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:41:55,233 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:41:55,446 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:41:55,447 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:41:55,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:41:55,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1538749201, now seen corresponding path program 2 times [2020-07-21 23:41:55,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:41:55,449 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [202163200] [2020-07-21 23:41:55,450 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:41:55,499 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 23:41:55,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:41:55,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-21 23:41:55,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:41:55,624 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:42:10,919 WARN L193 SmtUtils]: Spent 8.23 s on a formula simplification that was a NOOP. DAG size: 24 [2020-07-21 23:42:10,922 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:42:32,958 WARN L193 SmtUtils]: Spent 12.63 s on a formula simplification that was a NOOP. DAG size: 24 [2020-07-21 23:42:35,015 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:42:43,208 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0_BEFORE_CALL_5 Int) (v_main_~z~0_BEFORE_CALL_5 Int) (v_main_~x~0_15 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_5 v_main_~x~0_15))) (and (not (= (+ (* v_main_~a~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5) .cse0) (+ (* v_main_~a~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5) (* v_main_~z~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5 v_main_~x~0_15)))) (= (+ .cse0 v_main_~a~0_BEFORE_CALL_5) (+ (* v_main_~a~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5) v_main_~x~0_15))))) is different from false [2020-07-21 23:42:45,234 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0_BEFORE_CALL_5 Int) (v_main_~z~0_BEFORE_CALL_5 Int) (v_main_~x~0_15 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_5 v_main_~x~0_15))) (and (not (= (+ (* v_main_~a~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5) .cse0) (+ (* v_main_~a~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5) (* v_main_~z~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5 v_main_~x~0_15)))) (= (+ .cse0 v_main_~a~0_BEFORE_CALL_5) (+ (* v_main_~a~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5) v_main_~x~0_15))))) is different from true [2020-07-21 23:42:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-21 23:42:45,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 23:42:51,655 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 23:42:57,317 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-07-21 23:43:06,020 WARN L193 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-07-21 23:43:06,462 WARN L193 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2020-07-21 23:43:06,471 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 23:43:06,471 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 23:43:08,540 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~x~0 Int)) (let ((.cse0 (* main_~x~0 c_main_~z~0))) (or (= (+ (* c_main_~z~0 c_main_~a~0) (* main_~x~0 c_main_~z~0 c_main_~z~0)) (+ .cse0 (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~a~0))) (not (= (+ .cse0 c_main_~a~0) (+ main_~x~0 (* c_main_~y~0 c_main_~z~0 c_main_~a~0))))))) is different from true [2020-07-21 23:43:08,541 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [202163200] [2020-07-21 23:43:08,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-21 23:43:08,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-21 23:43:08,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806722820] [2020-07-21 23:43:08,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-21 23:43:08,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:43:08,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-21 23:43:08,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=146, Unknown=10, NotChecked=50, Total=240 [2020-07-21 23:43:08,544 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2020-07-21 23:43:24,027 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_main_~a~0_BEFORE_CALL_5 Int) (v_main_~z~0_BEFORE_CALL_5 Int) (v_main_~x~0_15 Int)) (let ((.cse1 (* v_main_~z~0_BEFORE_CALL_5 v_main_~x~0_15))) (and (not (= (+ (* v_main_~a~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5) .cse1) (+ (* v_main_~a~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5) (* v_main_~z~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5 v_main_~x~0_15)))) (= (+ .cse1 v_main_~a~0_BEFORE_CALL_5) (+ (* v_main_~a~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5) v_main_~x~0_15))))))) (and (or (and .cse0 (<= 0 |c___VERIFIER_assert_#in~cond|)) (<= 1 |c___VERIFIER_assert_#in~cond|)) (or (and .cse0 (<= 0 c___VERIFIER_assert_~cond)) (<= 1 c___VERIFIER_assert_~cond)) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond))) is different from false [2020-07-21 23:43:29,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:43:29,212 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2020-07-21 23:43:29,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-21 23:43:29,216 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-07-21 23:43:29,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:43:29,218 INFO L225 Difference]: With dead ends: 37 [2020-07-21 23:43:29,218 INFO L226 Difference]: Without dead ends: 35 [2020-07-21 23:43:29,219 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 56.3s TimeCoverageRelationStatistics Valid=40, Invalid=171, Unknown=11, NotChecked=84, Total=306 [2020-07-21 23:43:29,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-21 23:43:29,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-07-21 23:43:29,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-21 23:43:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2020-07-21 23:43:29,227 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2020-07-21 23:43:29,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:43:29,228 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2020-07-21 23:43:29,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-21 23:43:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-21 23:43:29,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-21 23:43:29,229 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:43:29,229 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:43:29,430 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:43:29,431 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:43:29,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:43:29,431 INFO L82 PathProgramCache]: Analyzing trace with hash -695576914, now seen corresponding path program 3 times [2020-07-21 23:43:29,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:43:29,432 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [394500796] [2020-07-21 23:43:29,433 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:43:29,476 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 23:43:29,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:43:29,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-21 23:43:29,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:43:35,863 WARN L193 SmtUtils]: Spent 4.25 s on a formula simplification that was a NOOP. DAG size: 14 [2020-07-21 23:43:44,440 WARN L193 SmtUtils]: Spent 4.64 s on a formula simplification that was a NOOP. DAG size: 16 [2020-07-21 23:43:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-21 23:43:45,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 23:43:45,059 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 23:44:09,306 WARN L193 SmtUtils]: Spent 2.38 s on a formula simplification that was a NOOP. DAG size: 11 [2020-07-21 23:44:09,436 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2020-07-21 23:44:09,449 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 23:44:09,449 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 23:44:11,741 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~x~0 c_main_~z~0))) (or (= (+ (* c_main_~z~0 c_main_~a~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0)) (+ .cse0 (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~a~0))) (not (= (+ .cse0 c_main_~a~0) (+ c_main_~x~0 (* c_main_~y~0 c_main_~z~0 c_main_~a~0)))))) is different from true [2020-07-21 23:44:11,745 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 23:44:11,753 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 23:44:15,568 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~x~0 c_main_~z~0 c_main_~z~0))) (or (not (= (+ (* c_main_~x~0 c_main_~z~0) (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~a~0)) (+ (* c_main_~z~0 c_main_~a~0) .cse0))) (= (+ (* c_main_~z~0 c_main_~z~0 c_main_~a~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) (+ (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~a~0) .cse0)))) is different from true [2020-07-21 23:44:16,452 WARN L193 SmtUtils]: Spent 873.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2020-07-21 23:44:16,539 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 23:44:16,540 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 23:44:18,809 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_main_~x~0 c_main_~z~0 c_main_~z~0)) (.cse0 (* c_main_~x~0 c_main_~z~0))) (or (not (= (+ .cse0 (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~a~0)) (+ (* c_main_~z~0 c_main_~a~0) .cse1))) (= (+ (* c_main_~z~0 c_main_~z~0 c_main_~a~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) (+ (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~a~0) .cse1)) (not (= (+ .cse0 c_main_~a~0) (+ c_main_~x~0 (* c_main_~y~0 c_main_~z~0 c_main_~a~0)))))) is different from true [2020-07-21 23:44:18,816 INFO L501 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-07-21 23:44:18,821 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-07-21 23:44:24,981 WARN L860 $PredicateComparison]: unable to prove that (or (not (= 0 |c___VERIFIER_assert_#in~cond|)) (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_10 Int) (v_main_~y~0_BEFORE_CALL_13 Int) (v_main_~a~0_BEFORE_CALL_11 Int)) (let ((.cse0 (* v_main_~x~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10)) (.cse1 (* v_main_~x~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_10))) (or (= (+ (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~y~0_BEFORE_CALL_13 v_main_~a~0_BEFORE_CALL_11) .cse0) (+ (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~a~0_BEFORE_CALL_11) (* v_main_~x~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10))) (not (= (+ .cse0 (* v_main_~z~0_BEFORE_CALL_10 v_main_~a~0_BEFORE_CALL_11)) (+ .cse1 (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~y~0_BEFORE_CALL_13 v_main_~a~0_BEFORE_CALL_11)))) (= (+ v_main_~x~0_BEFORE_CALL_11 (* v_main_~z~0_BEFORE_CALL_10 v_main_~y~0_BEFORE_CALL_13 v_main_~a~0_BEFORE_CALL_11)) (+ .cse1 v_main_~a~0_BEFORE_CALL_11)))))) is different from true [2020-07-21 23:44:35,322 WARN L860 $PredicateComparison]: unable to prove that (or (not (= 0 |c___VERIFIER_assert_#in~cond|)) (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_10 Int) (v_main_~y~0_BEFORE_CALL_13 Int) (v_main_~a~0_BEFORE_CALL_11 Int)) (let ((.cse0 (* v_main_~x~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10)) (.cse1 (* v_main_~x~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_10))) (or (= (+ (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~y~0_BEFORE_CALL_13 v_main_~a~0_BEFORE_CALL_11) .cse0) (+ (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~a~0_BEFORE_CALL_11) (* v_main_~x~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10))) (not (= (+ .cse0 (* v_main_~z~0_BEFORE_CALL_10 v_main_~a~0_BEFORE_CALL_11)) (+ .cse1 (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~y~0_BEFORE_CALL_13 v_main_~a~0_BEFORE_CALL_11)))) (= (+ v_main_~x~0_BEFORE_CALL_11 (* v_main_~z~0_BEFORE_CALL_10 v_main_~y~0_BEFORE_CALL_13 v_main_~a~0_BEFORE_CALL_11)) (+ .cse1 v_main_~a~0_BEFORE_CALL_11))))) (= 0 c___VERIFIER_assert_~cond)) is different from true [2020-07-21 23:44:38,643 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~x~0 c_main_~z~0 c_main_~z~0)) (.cse1 (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0))) (or (not (= (+ (* c_main_~x~0 c_main_~z~0) (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~a~0)) (+ (* c_main_~z~0 c_main_~a~0) .cse0))) (= (+ (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~a~0) .cse1) (+ (* c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~a~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~z~0))) (not (= (+ (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~a~0) .cse0) (+ (* c_main_~z~0 c_main_~z~0 c_main_~a~0) .cse1))))) is different from true [2020-07-21 23:44:38,669 INFO L501 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-07-21 23:44:38,684 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 19 not checked. [2020-07-21 23:44:38,684 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [394500796] [2020-07-21 23:44:38,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 23:44:38,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 21 [2020-07-21 23:44:38,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121038496] [2020-07-21 23:44:38,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-21 23:44:38,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:44:38,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-21 23:44:38,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=168, Unknown=17, NotChecked=186, Total=420 [2020-07-21 23:44:38,687 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 21 states. [2020-07-21 23:44:46,321 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_main_~x~0 c_main_~z~0))) (let ((.cse1 (* c_main_~z~0 c_main_~a~0)) (.cse0 (= (+ .cse2 c_main_~a~0) (+ c_main_~x~0 (* c_main_~y~0 c_main_~z~0 c_main_~a~0))))) (and .cse0 (= (+ .cse1 c_main_~a~0) c_main_~x~0) (let ((.cse3 (* c_main_~x~0 c_main_~z~0 c_main_~z~0))) (or (not (= (+ .cse2 (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~a~0)) (+ .cse1 .cse3))) (= (+ (* c_main_~z~0 c_main_~z~0 c_main_~a~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) (+ (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~a~0) .cse3)) (not .cse0))) (= c_main_~z~0 c_main_~y~0)))) is different from false [2020-07-21 23:45:35,636 WARN L193 SmtUtils]: Spent 25.79 s on a formula simplification that was a NOOP. DAG size: 27 [2020-07-21 23:45:39,768 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~z~0 c_main_~a~0))) (and (= c_main_~x~0 (+ (* c_main_~z~0 c_main_~z~0 c_main_~a~0) .cse0 c_main_~a~0)) (let ((.cse1 (* c_main_~x~0 c_main_~z~0))) (or (= (+ .cse0 (* c_main_~x~0 c_main_~z~0 c_main_~z~0)) (+ .cse1 (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~a~0))) (not (= (+ .cse1 c_main_~a~0) (+ c_main_~x~0 (* c_main_~y~0 c_main_~z~0 c_main_~a~0)))))) (= c_main_~y~0 (* c_main_~z~0 c_main_~z~0)))) is different from false [2020-07-21 23:45:42,197 WARN L193 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 32 DAG size of output: 7 [2020-07-21 23:45:52,448 WARN L193 SmtUtils]: Spent 6.82 s on a formula simplification that was a NOOP. DAG size: 21 [2020-07-21 23:46:05,514 WARN L193 SmtUtils]: Spent 6.35 s on a formula simplification that was a NOOP. DAG size: 17 [2020-07-21 23:46:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:46:23,526 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2020-07-21 23:46:23,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 23:46:23,606 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2020-07-21 23:46:23,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:46:23,607 INFO L225 Difference]: With dead ends: 44 [2020-07-21 23:46:23,607 INFO L226 Difference]: Without dead ends: 42 [2020-07-21 23:46:23,608 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 131.3s TimeCoverageRelationStatistics Valid=81, Invalid=302, Unknown=29, NotChecked=344, Total=756 [2020-07-21 23:46:23,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-21 23:46:23,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-07-21 23:46:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-21 23:46:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2020-07-21 23:46:23,617 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 31 [2020-07-21 23:46:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:46:23,617 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2020-07-21 23:46:23,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-21 23:46:23,618 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2020-07-21 23:46:23,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-21 23:46:23,619 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:46:23,619 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:46:23,833 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:46:23,834 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:46:23,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:46:23,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1264228465, now seen corresponding path program 4 times [2020-07-21 23:46:23,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:46:23,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1820140544] [2020-07-21 23:46:23,836 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:46:23,899 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 23:46:23,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:46:23,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-21 23:46:23,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:46:26,076 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~x~0_27 Int)) (= (+ (* c_main_~z~0 c_main_~z~0 c_main_~a~0) v_main_~x~0_27) (+ c_main_~a~0 (* c_main_~z~0 v_main_~x~0_27)))) is different from true [2020-07-21 23:46:32,093 WARN L193 SmtUtils]: Spent 2.34 s on a formula simplification that was a NOOP. DAG size: 17 [2020-07-21 23:46:47,380 WARN L193 SmtUtils]: Spent 3.81 s on a formula simplification that was a NOOP. DAG size: 24 [2020-07-21 23:46:47,390 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:47:17,961 WARN L193 SmtUtils]: Spent 14.29 s on a formula simplification that was a NOOP. DAG size: 33 [2020-07-21 23:47:17,964 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:47:26,146 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((v_main_~z~0_BEFORE_CALL_15 Int) (v_main_~y~0_28 Int) (v_main_~x~0_28 Int) (v_main_~x~0_BEFORE_CALL_13 Int) (v_main_~x~0_27 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28))) (and (= (+ v_main_~x~0_28 (* v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_BEFORE_CALL_13)) (+ v_main_~x~0_BEFORE_CALL_13 (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_28))) (not (= (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_BEFORE_CALL_13) (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28 v_main_~y~0_28)) (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_BEFORE_CALL_13) .cse0))) (= (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28) v_main_~x~0_BEFORE_CALL_13 (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_27)) (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_BEFORE_CALL_13) v_main_~x~0_27 .cse0))))) (<= 0 c___VERIFIER_assert_~cond)) (<= 1 c___VERIFIER_assert_~cond)) is different from false [2020-07-21 23:47:28,237 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:47:36,372 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_main_~z~0_BEFORE_CALL_15 Int) (v_main_~y~0_28 Int) (v_main_~x~0_28 Int) (v_main_~x~0_BEFORE_CALL_13 Int) (v_main_~x~0_27 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28))) (and (= (+ v_main_~x~0_28 (* v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_BEFORE_CALL_13)) (+ v_main_~x~0_BEFORE_CALL_13 (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_28))) (not (= (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_BEFORE_CALL_13) (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28 v_main_~y~0_28)) (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_BEFORE_CALL_13) .cse0))) (= (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28) v_main_~x~0_BEFORE_CALL_13 (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_27)) (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_BEFORE_CALL_13) v_main_~x~0_27 .cse0))))) is different from false [2020-07-21 23:47:38,395 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~z~0_BEFORE_CALL_15 Int) (v_main_~y~0_28 Int) (v_main_~x~0_28 Int) (v_main_~x~0_BEFORE_CALL_13 Int) (v_main_~x~0_27 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28))) (and (= (+ v_main_~x~0_28 (* v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_BEFORE_CALL_13)) (+ v_main_~x~0_BEFORE_CALL_13 (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_28))) (not (= (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_BEFORE_CALL_13) (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28 v_main_~y~0_28)) (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_BEFORE_CALL_13) .cse0))) (= (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28) v_main_~x~0_BEFORE_CALL_13 (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_27)) (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_BEFORE_CALL_13) v_main_~x~0_27 .cse0))))) is different from true [2020-07-21 23:47:38,400 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 15 proven. 11 refuted. 1 times theorem prover too weak. 14 trivial. 17 not checked. [2020-07-21 23:47:38,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 23:47:43,872 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 23:47:57,009 WARN L860 $PredicateComparison]: unable to prove that (= (+ (* c_main_~x~0 c_main_~z~0) (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~a~0)) (+ (* c_main_~z~0 c_main_~a~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0))) is different from true [2020-07-21 23:47:59,549 WARN L193 SmtUtils]: Spent 2.53 s on a formula simplification that was a NOOP. DAG size: 22 [2020-07-21 23:47:59,565 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 23:47:59,566 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 23:48:01,598 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~x~0 Int) (main_~y~0 Int)) (let ((.cse0 (* main_~x~0 c_main_~z~0))) (or (= (+ .cse0 (* main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~a~0)) (+ (* c_main_~z~0 c_main_~a~0) (* main_~x~0 c_main_~z~0 c_main_~z~0))) (not (= (+ .cse0 c_main_~a~0) (+ main_~x~0 (* main_~y~0 c_main_~z~0 c_main_~a~0))))))) is different from true [2020-07-21 23:48:01,599 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1820140544] [2020-07-21 23:48:01,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-21 23:48:01,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-21 23:48:01,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132546758] [2020-07-21 23:48:01,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-21 23:48:01,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:48:01,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-21 23:48:01,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=118, Unknown=22, NotChecked=130, Total=306 [2020-07-21 23:48:01,601 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 13 states. [2020-07-21 23:48:36,188 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_main_~z~0_BEFORE_CALL_15 Int) (v_main_~y~0_28 Int) (v_main_~x~0_28 Int) (v_main_~x~0_BEFORE_CALL_13 Int) (v_main_~x~0_27 Int)) (let ((.cse1 (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28))) (and (= (+ v_main_~x~0_28 (* v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_BEFORE_CALL_13)) (+ v_main_~x~0_BEFORE_CALL_13 (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_28))) (not (= (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_BEFORE_CALL_13) (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28 v_main_~y~0_28)) (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_BEFORE_CALL_13) .cse1))) (= (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28) v_main_~x~0_BEFORE_CALL_13 (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_27)) (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_BEFORE_CALL_13) v_main_~x~0_27 .cse1))))))) (and (or (<= 1 |c___VERIFIER_assert_#in~cond|) (and (<= 0 |c___VERIFIER_assert_#in~cond|) .cse0)) (or (and .cse0 (<= 0 c___VERIFIER_assert_~cond)) (<= 1 c___VERIFIER_assert_~cond)) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond))) is different from false [2020-07-21 23:48:54,455 WARN L193 SmtUtils]: Spent 7.38 s on a formula simplification that was a NOOP. DAG size: 29 [2020-07-21 23:48:57,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:48:57,172 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2020-07-21 23:48:57,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 23:48:57,182 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2020-07-21 23:48:57,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:48:57,182 INFO L225 Difference]: With dead ends: 41 [2020-07-21 23:48:57,182 INFO L226 Difference]: Without dead ends: 0 [2020-07-21 23:48:57,183 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 102.5s TimeCoverageRelationStatistics Valid=53, Invalid=183, Unknown=28, NotChecked=198, Total=462 [2020-07-21 23:48:57,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-21 23:48:57,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-21 23:48:57,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-21 23:48:57,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-21 23:48:57,184 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2020-07-21 23:48:57,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:48:57,184 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-21 23:48:57,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-21 23:48:57,184 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-21 23:48:57,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-21 23:48:57,385 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:48:57,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-21 23:48:57,740 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2020-07-21 23:49:48,180 WARN L193 SmtUtils]: Spent 50.44 s on a formula simplification that was a NOOP. DAG size: 51 [2020-07-21 23:50:04,488 WARN L193 SmtUtils]: Spent 16.30 s on a formula simplification. DAG size of input: 84 DAG size of output: 1 [2020-07-21 23:51:18,722 WARN L193 SmtUtils]: Spent 1.24 m on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2020-07-21 23:51:18,727 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-21 23:51:18,727 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-21 23:51:18,727 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-21 23:51:18,727 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-21 23:51:18,727 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-21 23:51:18,727 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-21 23:51:18,727 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 9 11) no Hoare annotation was computed. [2020-07-21 23:51:18,728 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-21 23:51:18,728 INFO L268 CegarLoopResult]: For program point L10-2(lines 9 11) no Hoare annotation was computed. [2020-07-21 23:51:18,728 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 9 11) no Hoare annotation was computed. [2020-07-21 23:51:18,728 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (or (let ((.cse0 (* main_~x~0 main_~z~0)) (.cse1 (* main_~z~0 main_~a~0))) (and (= (+ main_~a~0 .cse0) (+ main_~x~0 (* main_~y~0 main_~z~0 main_~a~0))) (not (= (+ (* main_~y~0 main_~z~0 main_~z~0 main_~a~0) .cse0) (+ (* main_~x~0 main_~z~0 main_~z~0) .cse1))) (= (+ .cse1 main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))) (and (exists ((v_main_~y~0_28 Int) (v_main_~x~0_28 Int)) (let ((.cse2 (+ (* main_~z~0 v_main_~x~0_28) main_~a~0))) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_28)) (= (+ (* main_~z~0 v_main_~y~0_28 main_~a~0) v_main_~x~0_28) .cse2) (= main_~x~0 .cse2)))) (exists ((v_main_~x~0_27 Int)) (= (+ (* main_~z~0 main_~z~0 main_~a~0) v_main_~x~0_27) (+ (* main_~z~0 v_main_~x~0_27) main_~a~0)))) (and (= 1 main_~y~0) (= main_~a~0 main_~x~0))) [2020-07-21 23:51:18,728 INFO L268 CegarLoopResult]: For program point L31-1(lines 30 39) no Hoare annotation was computed. [2020-07-21 23:51:18,728 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 19 42) the Hoare annotation is: true [2020-07-21 23:51:18,729 INFO L264 CegarLoopResult]: At program point L30-2(lines 30 39) the Hoare annotation is: (or (let ((.cse0 (* main_~x~0 main_~z~0)) (.cse1 (* main_~z~0 main_~a~0))) (and (= (+ main_~a~0 .cse0) (+ main_~x~0 (* main_~y~0 main_~z~0 main_~a~0))) (= (+ .cse1 main_~a~0) main_~x~0) (let ((.cse2 (* main_~x~0 main_~z~0 main_~z~0))) (or (not (= (+ (* main_~y~0 main_~z~0 main_~z~0 main_~a~0) .cse0) (+ .cse2 .cse1))) (= (+ .cse2 (* main_~y~0 main_~z~0 main_~z~0 main_~z~0 main_~a~0)) (+ (* main_~z~0 main_~z~0 main_~a~0) (* main_~x~0 main_~z~0 main_~z~0 main_~z~0))))) (= main_~z~0 main_~y~0))) (and (exists ((v_main_~y~0_28 Int) (v_main_~x~0_28 Int)) (let ((.cse3 (+ (* main_~z~0 v_main_~x~0_28) main_~a~0))) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_28)) (= (+ (* main_~z~0 v_main_~y~0_28 main_~a~0) v_main_~x~0_28) .cse3) (= main_~x~0 .cse3)))) (exists ((v_main_~x~0_27 Int)) (= (+ (* main_~z~0 main_~z~0 main_~a~0) v_main_~x~0_27) (+ (* main_~z~0 v_main_~x~0_27) main_~a~0)))) (and (= 1 main_~y~0) (= main_~a~0 main_~x~0))) [2020-07-21 23:51:18,729 INFO L264 CegarLoopResult]: At program point L30-3(lines 30 39) the Hoare annotation is: (= (+ main_~a~0 (* main_~x~0 main_~z~0)) (+ main_~x~0 (* main_~y~0 main_~z~0 main_~a~0))) [2020-07-21 23:51:18,729 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 19 42) no Hoare annotation was computed. [2020-07-21 23:51:18,729 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 19 42) no Hoare annotation was computed. [2020-07-21 23:51:18,729 INFO L268 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2020-07-21 23:51:18,729 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 12 18) the Hoare annotation is: true [2020-07-21 23:51:18,730 INFO L268 CegarLoopResult]: For program point L14(lines 14 15) no Hoare annotation was computed. [2020-07-21 23:51:18,730 INFO L268 CegarLoopResult]: For program point L13(lines 13 16) no Hoare annotation was computed. [2020-07-21 23:51:18,730 INFO L268 CegarLoopResult]: For program point L13-2(lines 12 18) no Hoare annotation was computed. [2020-07-21 23:51:18,730 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 12 18) no Hoare annotation was computed. [2020-07-21 23:51:18,730 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2020-07-21 23:51:18,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_28,QUANTIFIED] [2020-07-21 23:51:18,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_28,QUANTIFIED] [2020-07-21 23:51:18,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_28,QUANTIFIED] [2020-07-21 23:51:18,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_28,QUANTIFIED] [2020-07-21 23:51:18,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_28,QUANTIFIED] [2020-07-21 23:51:18,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_27,QUANTIFIED] [2020-07-21 23:51:18,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_27,QUANTIFIED] [2020-07-21 23:51:18,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_28,QUANTIFIED] [2020-07-21 23:51:18,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_28,QUANTIFIED] [2020-07-21 23:51:18,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_28,QUANTIFIED] [2020-07-21 23:51:18,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_28,QUANTIFIED] [2020-07-21 23:51:18,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_28,QUANTIFIED] [2020-07-21 23:51:18,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_27,QUANTIFIED] [2020-07-21 23:51:18,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_27,QUANTIFIED] [2020-07-21 23:51:18,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 11:51:18 BoogieIcfgContainer [2020-07-21 23:51:18,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 23:51:18,760 INFO L168 Benchmark]: Toolchain (without parser) took 576831.63 ms. Allocated memory was 143.7 MB in the beginning and 249.6 MB in the end (delta: 105.9 MB). Free memory was 100.8 MB in the beginning and 191.8 MB in the end (delta: -91.1 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2020-07-21 23:51:18,761 INFO L168 Benchmark]: CDTParser took 0.62 ms. Allocated memory is still 143.7 MB. Free memory is still 119.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-21 23:51:18,761 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.00 ms. Allocated memory is still 143.7 MB. Free memory was 100.3 MB in the beginning and 90.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-21 23:51:18,762 INFO L168 Benchmark]: Boogie Preprocessor took 124.40 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 90.9 MB in the beginning and 180.4 MB in the end (delta: -89.5 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-21 23:51:18,763 INFO L168 Benchmark]: RCFGBuilder took 275.59 ms. Allocated memory is still 200.8 MB. Free memory was 180.4 MB in the beginning and 166.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-21 23:51:18,764 INFO L168 Benchmark]: TraceAbstraction took 576184.34 ms. Allocated memory was 200.8 MB in the beginning and 249.6 MB in the end (delta: 48.8 MB). Free memory was 166.4 MB in the beginning and 191.8 MB in the end (delta: -25.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2020-07-21 23:51:18,768 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.62 ms. Allocated memory is still 143.7 MB. Free memory is still 119.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 241.00 ms. Allocated memory is still 143.7 MB. Free memory was 100.3 MB in the beginning and 90.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.40 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 90.9 MB in the beginning and 180.4 MB in the end (delta: -89.5 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 275.59 ms. Allocated memory is still 200.8 MB. Free memory was 180.4 MB in the beginning and 166.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 576184.34 ms. Allocated memory was 200.8 MB in the beginning and 249.6 MB in the end (delta: 48.8 MB). Free memory was 166.4 MB in the beginning and 191.8 MB in the end (delta: -25.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_27,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant [2020-07-21 23:51:18,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_28,QUANTIFIED] [2020-07-21 23:51:18,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_28,QUANTIFIED] [2020-07-21 23:51:18,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_28,QUANTIFIED] [2020-07-21 23:51:18,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_28,QUANTIFIED] [2020-07-21 23:51:18,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_28,QUANTIFIED] [2020-07-21 23:51:18,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_27,QUANTIFIED] [2020-07-21 23:51:18,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_27,QUANTIFIED] [2020-07-21 23:51:18,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_28,QUANTIFIED] [2020-07-21 23:51:18,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_28,QUANTIFIED] [2020-07-21 23:51:18,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_28,QUANTIFIED] [2020-07-21 23:51:18,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_28,QUANTIFIED] [2020-07-21 23:51:18,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_28,QUANTIFIED] [2020-07-21 23:51:18,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_27,QUANTIFIED] [2020-07-21 23:51:18,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_27,QUANTIFIED] Derived loop invariant: ((((a + x * z == x + y * z * a && z * a + a == x) && (!(y * z * z * a + x * z == x * z * z + z * a) || x * z * z + y * z * z * z * a == z * z * a + x * z * z * z)) && z == y) || ((\exists v_main_~y~0_28 : int, v_main_~x~0_28 : int :: (y == z * v_main_~y~0_28 && z * v_main_~y~0_28 * a + v_main_~x~0_28 == z * v_main_~x~0_28 + a) && x == z * v_main_~x~0_28 + a) && (\exists v_main_~x~0_27 : int :: z * z * a + v_main_~x~0_27 == z * v_main_~x~0_27 + a))) || (1 == y && a == x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 434.7s, OverallIterations: 6, TraceHistogramMax: 5, AutomataDifference: 186.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 141.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 85 SDtfs, 49 SDslu, 359 SDs, 0 SdLazy, 297 SolverSat, 24 SolverUnsat, 29 SolverUnknown, 0 SolverNotchecked, 78.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 120 SyntacticMatches, 10 SemanticMatches, 79 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 299.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 17 PreInvPairs, 30 NumberOfFragments, 220 HoareAnnotationTreeSize, 17 FomulaSimplifications, 485 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 379 FormulaSimplificationTreeSizeReductionInter, 141.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 246.8s InterpolantComputationTime, 130 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 170 ConstructedInterpolants, 19 QuantifiedInterpolants, 50993 SizeOfPredicates, 23 NumberOfNonLiveVariables, 388 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 67/147 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 correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...