/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 DAGSIZE --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 2 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench/geo2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 20:51:34,752 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 20:51:34,755 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 20:51:34,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 20:51:34,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 20:51:34,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 20:51:34,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 20:51:34,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 20:51:34,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 20:51:34,775 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 20:51:34,776 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 20:51:34,777 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 20:51:34,777 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 20:51:34,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 20:51:34,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 20:51:34,781 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 20:51:34,782 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 20:51:34,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 20:51:34,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 20:51:34,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 20:51:34,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 20:51:34,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 20:51:34,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 20:51:34,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 20:51:34,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 20:51:34,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 20:51:34,794 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 20:51:34,795 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 20:51:34,795 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 20:51:34,796 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 20:51:34,796 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 20:51:34,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 20:51:34,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 20:51:34,799 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 20:51:34,800 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 20:51:34,800 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 20:51:34,801 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 20:51:34,801 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 20:51:34,801 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 20:51:34,802 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 20:51:34,803 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 20:51:34,804 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 20:51:34,819 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 20:51:34,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 20:51:34,820 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 20:51:34,820 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 20:51:34,821 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 20:51:34,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 20:51:34,821 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 20:51:34,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 20:51:34,821 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 20:51:34,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 20:51:34,822 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 20:51:34,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 20:51:34,822 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 20:51:34,822 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 20:51:34,822 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 20:51:34,823 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 20:51:34,823 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 20:51:34,823 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 20:51:34,823 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 20:51:34,823 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 20:51:34,824 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 20:51:34,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 20:51:34,824 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 20:51:34,824 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 20:51:34,824 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 20:51:34,825 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 20:51:34,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:51:34,825 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 20:51:34,825 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 20:51:34,825 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 -> DAGSIZE 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 -> 2 [2020-07-21 20:51:35,127 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 20:51:35,141 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 20:51:35,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 20:51:35,147 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 20:51:35,147 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 20:51:35,148 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/geo2.c [2020-07-21 20:51:35,232 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa9c8e978/2f905bd76ab94fe3ad5df4a89cd13569/FLAGe83151076 [2020-07-21 20:51:35,691 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 20:51:35,691 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/geo2.c [2020-07-21 20:51:35,698 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa9c8e978/2f905bd76ab94fe3ad5df4a89cd13569/FLAGe83151076 [2020-07-21 20:51:36,069 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa9c8e978/2f905bd76ab94fe3ad5df4a89cd13569 [2020-07-21 20:51:36,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 20:51:36,083 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 20:51:36,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 20:51:36,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 20:51:36,088 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 20:51:36,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:51:36" (1/1) ... [2020-07-21 20:51:36,092 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59dc4417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:51:36, skipping insertion in model container [2020-07-21 20:51:36,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:51:36" (1/1) ... [2020-07-21 20:51:36,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 20:51:36,118 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 20:51:36,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 20:51:36,291 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 20:51:36,310 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 20:51:36,326 INFO L208 MainTranslator]: Completed translation [2020-07-21 20:51:36,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:51:36 WrapperNode [2020-07-21 20:51:36,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 20:51:36,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 20:51:36,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 20:51:36,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 20:51:36,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:51:36" (1/1) ... [2020-07-21 20:51:36,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:51:36" (1/1) ... [2020-07-21 20:51:36,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:51:36" (1/1) ... [2020-07-21 20:51:36,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:51:36" (1/1) ... [2020-07-21 20:51:36,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:51:36" (1/1) ... [2020-07-21 20:51:36,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:51:36" (1/1) ... [2020-07-21 20:51:36,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:51:36" (1/1) ... [2020-07-21 20:51:36,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 20:51:36,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 20:51:36,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 20:51:36,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 20:51:36,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:51:36" (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 20:51:36,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 20:51:36,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 20:51:36,500 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-21 20:51:36,500 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-21 20:51:36,500 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 20:51:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 20:51:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 20:51:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-21 20:51:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-21 20:51:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-21 20:51:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 20:51:36,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 20:51:36,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 20:51:36,693 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 20:51:36,694 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-21 20:51:36,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:51:36 BoogieIcfgContainer [2020-07-21 20:51:36,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 20:51:36,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 20:51:36,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 20:51:36,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 20:51:36,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 08:51:36" (1/3) ... [2020-07-21 20:51:36,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2fde9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:51:36, skipping insertion in model container [2020-07-21 20:51:36,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:51:36" (2/3) ... [2020-07-21 20:51:36,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2fde9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:51:36, skipping insertion in model container [2020-07-21 20:51:36,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:51:36" (3/3) ... [2020-07-21 20:51:36,707 INFO L109 eAbstractionObserver]: Analyzing ICFG geo2.c [2020-07-21 20:51:36,719 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 20:51:36,728 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 20:51:36,751 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 20:51:36,783 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 20:51:36,783 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 20:51:36,784 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 20:51:36,784 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 20:51:36,784 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 20:51:36,784 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 20:51:36,784 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 20:51:36,784 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 20:51:36,809 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-21 20:51:36,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-21 20:51:36,820 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:51:36,821 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 20:51:36,821 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:51:36,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:51:36,835 INFO L82 PathProgramCache]: Analyzing trace with hash -64610451, now seen corresponding path program 1 times [2020-07-21 20:51:36,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:51:36,848 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [632919082] [2020-07-21 20:51:36,848 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 20:51:36,924 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 20:51:36,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:51:36,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-21 20:51:36,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:51:37,029 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 20:51:37,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:51:37,031 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [632919082] [2020-07-21 20:51:37,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:51:37,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 20:51:37,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036120420] [2020-07-21 20:51:37,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 20:51:37,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:51:37,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 20:51:37,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 20:51:37,056 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-07-21 20:51:37,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:51:37,152 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2020-07-21 20:51:37,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 20:51:37,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-21 20:51:37,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:51:37,166 INFO L225 Difference]: With dead ends: 46 [2020-07-21 20:51:37,166 INFO L226 Difference]: Without dead ends: 22 [2020-07-21 20:51:37,170 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 20:51:37,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-21 20:51:37,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-21 20:51:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-21 20:51:37,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-21 20:51:37,222 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 10 [2020-07-21 20:51:37,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:51:37,222 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-21 20:51:37,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 20:51:37,223 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-21 20:51:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-21 20:51:37,224 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:51:37,224 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 20:51:37,439 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:51:37,440 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:51:37,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:51:37,441 INFO L82 PathProgramCache]: Analyzing trace with hash 50868238, now seen corresponding path program 1 times [2020-07-21 20:51:37,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:51:37,441 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1071356203] [2020-07-21 20:51:37,442 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 20:51:37,479 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 20:51:37,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:51:37,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-21 20:51:37,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:51:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 20:51:37,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 20:51:37,608 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 20:51:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 20:51:41,864 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1071356203] [2020-07-21 20:51:41,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 20:51:41,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-21 20:51:41,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968039477] [2020-07-21 20:51:41,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-21 20:51:41,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:51:41,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-21 20:51:41,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=38, Unknown=2, NotChecked=0, Total=56 [2020-07-21 20:51:41,868 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 8 states. [2020-07-21 20:51:48,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:51:48,108 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-21 20:51:48,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 20:51:48,109 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-07-21 20:51:48,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:51:48,115 INFO L225 Difference]: With dead ends: 30 [2020-07-21 20:51:48,115 INFO L226 Difference]: Without dead ends: 28 [2020-07-21 20:51:48,117 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=20, Invalid=50, Unknown=2, NotChecked=0, Total=72 [2020-07-21 20:51:48,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-21 20:51:48,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-21 20:51:48,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-21 20:51:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-21 20:51:48,134 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 17 [2020-07-21 20:51:48,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:51:48,135 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-21 20:51:48,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-21 20:51:48,136 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-21 20:51:48,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-21 20:51:48,138 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:51:48,139 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 20:51:48,353 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:51:48,354 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:51:48,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:51:48,356 INFO L82 PathProgramCache]: Analyzing trace with hash 325764102, now seen corresponding path program 1 times [2020-07-21 20:51:48,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:51:48,357 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [373464820] [2020-07-21 20:51:48,357 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 20:51:48,385 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 20:51:48,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:51:48,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-21 20:51:48,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:51:48,470 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 20:51:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-21 20:51:48,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 20:51:48,638 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 20:51:48,639 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 20:51:48,659 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 20:51:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-21 20:51:48,710 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [373464820] [2020-07-21 20:51:48,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 20:51:48,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2020-07-21 20:51:48,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460904477] [2020-07-21 20:51:48,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-21 20:51:48,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:51:48,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-21 20:51:48,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-07-21 20:51:48,713 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 9 states. [2020-07-21 20:51:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:51:50,916 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-21 20:51:50,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 20:51:50,918 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-07-21 20:51:50,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:51:50,919 INFO L225 Difference]: With dead ends: 34 [2020-07-21 20:51:50,920 INFO L226 Difference]: Without dead ends: 27 [2020-07-21 20:51:50,921 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-21 20:51:50,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-21 20:51:50,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-21 20:51:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-21 20:51:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-07-21 20:51:50,935 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2020-07-21 20:51:50,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:51:50,935 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-07-21 20:51:50,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-21 20:51:50,936 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-21 20:51:50,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-21 20:51:50,937 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:51:50,938 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 20:51:51,151 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:51:51,152 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:51:51,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:51:51,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1538749201, now seen corresponding path program 2 times [2020-07-21 20:51:51,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:51:51,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1238083805] [2020-07-21 20:51:51,154 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 20:51:51,190 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 20:51:51,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:51:51,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-21 20:51:51,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:51:51,409 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 20:52:08,860 WARN L193 SmtUtils]: Spent 10.29 s on a formula simplification that was a NOOP. DAG size: 22 [2020-07-21 20:52:08,862 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 20:52:34,092 WARN L193 SmtUtils]: Spent 12.65 s on a formula simplification that was a NOOP. DAG size: 22 [2020-07-21 20:52:36,145 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 20:52:44,375 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_main_~z~0_BEFORE_CALL_7 Int) (v_main_~x~0_14 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_7 v_main_~x~0_14))) (and (not (= (+ (* v_main_~z~0_BEFORE_CALL_7 v_main_~z~0_BEFORE_CALL_7 v_main_~z~0_BEFORE_CALL_7) .cse0) (+ (* v_main_~z~0_BEFORE_CALL_7 v_main_~z~0_BEFORE_CALL_7 v_main_~x~0_14) v_main_~z~0_BEFORE_CALL_7))) (= (+ .cse0 1) (+ (* v_main_~z~0_BEFORE_CALL_7 v_main_~z~0_BEFORE_CALL_7) v_main_~x~0_14))))) is different from false [2020-07-21 20:52:46,394 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~z~0_BEFORE_CALL_7 Int) (v_main_~x~0_14 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_7 v_main_~x~0_14))) (and (not (= (+ (* v_main_~z~0_BEFORE_CALL_7 v_main_~z~0_BEFORE_CALL_7 v_main_~z~0_BEFORE_CALL_7) .cse0) (+ (* v_main_~z~0_BEFORE_CALL_7 v_main_~z~0_BEFORE_CALL_7 v_main_~x~0_14) v_main_~z~0_BEFORE_CALL_7))) (= (+ .cse0 1) (+ (* v_main_~z~0_BEFORE_CALL_7 v_main_~z~0_BEFORE_CALL_7) v_main_~x~0_14))))) is different from true [2020-07-21 20:52:46,397 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 20:52:46,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 20:52:52,093 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 20:53:07,447 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-07-21 20:53:07,580 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 20:53:07,580 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 20:53:09,635 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 (* main_~x~0 c_main_~z~0 c_main_~z~0)) (+ .cse0 (* c_main_~y~0 c_main_~z~0 c_main_~z~0))) (not (= (+ .cse0 1) (+ (* c_main_~y~0 c_main_~z~0) main_~x~0)))))) is different from true [2020-07-21 20:53:09,636 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1238083805] [2020-07-21 20:53:09,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-21 20:53:09,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-21 20:53:09,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753670311] [2020-07-21 20:53:09,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-21 20:53:09,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:53:09,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-21 20:53:09,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=145, Unknown=11, NotChecked=50, Total=240 [2020-07-21 20:53:09,638 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2020-07-21 20:53:56,792 WARN L193 SmtUtils]: Spent 18.11 s on a formula simplification that was a NOOP. DAG size: 25 [2020-07-21 20:54:09,162 WARN L193 SmtUtils]: Spent 6.12 s on a formula simplification. DAG size of input: 31 DAG size of output: 6 [2020-07-21 20:54:10,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:54:10,534 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2020-07-21 20:54:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-21 20:54:10,535 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-07-21 20:54:10,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:54:10,537 INFO L225 Difference]: With dead ends: 37 [2020-07-21 20:54:10,538 INFO L226 Difference]: Without dead ends: 35 [2020-07-21 20:54:10,539 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 105.4s TimeCoverageRelationStatistics Valid=53, Invalid=209, Unknown=18, NotChecked=62, Total=342 [2020-07-21 20:54:10,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-21 20:54:10,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-07-21 20:54:10,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-21 20:54:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2020-07-21 20:54:10,546 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2020-07-21 20:54:10,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:54:10,547 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2020-07-21 20:54:10,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-21 20:54:10,547 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-21 20:54:10,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-21 20:54:10,548 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:54:10,548 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 20:54:10,749 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:54:10,750 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:54:10,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:54:10,750 INFO L82 PathProgramCache]: Analyzing trace with hash -695576914, now seen corresponding path program 3 times [2020-07-21 20:54:10,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:54:10,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1987351822] [2020-07-21 20:54:10,752 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 20:54:10,795 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 20:54:10,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:54:10,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-21 20:54:10,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:54:11,796 WARN L193 SmtUtils]: Spent 691.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-07-21 20:54:12,932 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 20:54:19,094 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((v_main_~z~0_BEFORE_CALL_10 Int) (v_main_~x~0_17 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_10 v_main_~x~0_17))) (and (not (= (+ .cse0 (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10)) (+ v_main_~z~0_BEFORE_CALL_10 (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~x~0_17)))) (= (+ (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10) v_main_~x~0_17) (+ .cse0 1))))) (<= 0 |c___VERIFIER_assert_#in~cond|)) (<= 1 |c___VERIFIER_assert_#in~cond|)) is different from false [2020-07-21 20:54:19,097 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 20:54:27,328 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((v_main_~z~0_BEFORE_CALL_10 Int) (v_main_~x~0_17 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_10 v_main_~x~0_17))) (and (not (= (+ .cse0 (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10)) (+ v_main_~z~0_BEFORE_CALL_10 (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~x~0_17)))) (= (+ (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10) v_main_~x~0_17) (+ .cse0 1))))) (<= 0 c___VERIFIER_assert_~cond)) (<= 1 c___VERIFIER_assert_~cond)) is different from false [2020-07-21 20:54:29,369 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 20:54:37,569 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_main_~z~0_BEFORE_CALL_10 Int) (v_main_~x~0_17 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_10 v_main_~x~0_17))) (and (not (= (+ .cse0 (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10)) (+ v_main_~z~0_BEFORE_CALL_10 (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~x~0_17)))) (= (+ (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10) v_main_~x~0_17) (+ .cse0 1))))) is different from false [2020-07-21 20:54:39,585 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~z~0_BEFORE_CALL_10 Int) (v_main_~x~0_17 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_10 v_main_~x~0_17))) (and (not (= (+ .cse0 (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10)) (+ v_main_~z~0_BEFORE_CALL_10 (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~x~0_17)))) (= (+ (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10) v_main_~x~0_17) (+ .cse0 1))))) is different from true [2020-07-21 20:54:39,589 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2020-07-21 20:54:39,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 20:54:39,648 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 20:54:44,877 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 9 [2020-07-21 20:54:56,398 WARN L193 SmtUtils]: Spent 662.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-07-21 20:54:56,545 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-07-21 20:54:56,549 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 20:54:56,549 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 20:54:58,575 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~x~0 Int)) (let ((.cse0 (* main_~x~0 c_main_~z~0))) (or (= (+ .cse0 (* c_main_~y~0 c_main_~z~0 c_main_~z~0)) (+ c_main_~z~0 (* main_~x~0 c_main_~z~0 c_main_~z~0))) (not (= (+ .cse0 1) (+ (* c_main_~y~0 c_main_~z~0) main_~x~0)))))) is different from true [2020-07-21 20:54:58,576 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1987351822] [2020-07-21 20:54:58,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-21 20:54:58,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-21 20:54:58,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179353627] [2020-07-21 20:54:58,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-21 20:54:58,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:54:58,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-21 20:54:58,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=128, Unknown=10, NotChecked=100, Total=272 [2020-07-21 20:54:58,578 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 12 states. [2020-07-21 20:55:07,508 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (exists ((v_main_~z~0_BEFORE_CALL_10 Int) (v_main_~x~0_17 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_10 v_main_~x~0_17))) (and (not (= (+ .cse0 (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10)) (+ v_main_~z~0_BEFORE_CALL_10 (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~x~0_17)))) (= (+ (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10) v_main_~x~0_17) (+ .cse0 1))))) (<= 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 20:55:17,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:55:17,078 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2020-07-21 20:55:17,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 20:55:17,097 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-07-21 20:55:17,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:55:17,098 INFO L225 Difference]: With dead ends: 44 [2020-07-21 20:55:17,098 INFO L226 Difference]: Without dead ends: 42 [2020-07-21 20:55:17,099 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=40, Invalid=151, Unknown=11, NotChecked=140, Total=342 [2020-07-21 20:55:17,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-21 20:55:17,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-07-21 20:55:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-21 20:55:17,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2020-07-21 20:55:17,108 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 31 [2020-07-21 20:55:17,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:55:17,108 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2020-07-21 20:55:17,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-21 20:55:17,108 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2020-07-21 20:55:17,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-21 20:55:17,110 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:55:17,110 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 20:55:17,310 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:55:17,311 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:55:17,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:55:17,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1264228465, now seen corresponding path program 4 times [2020-07-21 20:55:17,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:55:17,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1227915254] [2020-07-21 20:55:17,313 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 20:55:17,351 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 20:55:17,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:55:17,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-21 20:55:17,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:55:28,397 WARN L193 SmtUtils]: Spent 4.43 s on a formula simplification that was a NOOP. DAG size: 21 [2020-07-21 20:55:39,541 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 20:56:09,195 WARN L193 SmtUtils]: Spent 14.28 s on a formula simplification that was a NOOP. DAG size: 29 [2020-07-21 20:56:09,198 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 20:56:42,984 WARN L193 SmtUtils]: Spent 13.95 s on a formula simplification that was a NOOP. DAG size: 29 [2020-07-21 20:56:45,025 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 20:56:53,254 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_main_~x~0_20 Int) (v_main_~z~0_BEFORE_CALL_12 Int) (v_main_~y~0_24 Int)) (let ((.cse1 (* v_main_~x~0_20 v_main_~z~0_BEFORE_CALL_12)) (.cse0 (* v_main_~x~0_20 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12))) (and (= (+ .cse0 v_main_~z~0_BEFORE_CALL_12) (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_24) .cse1)) (= (+ .cse1 1) (+ v_main_~x~0_20 (* v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_24))) (not (= (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_24) .cse0) (+ (* v_main_~x~0_20 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12) (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12))))))) is different from false [2020-07-21 20:56:55,319 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~x~0_20 Int) (v_main_~z~0_BEFORE_CALL_12 Int) (v_main_~y~0_24 Int)) (let ((.cse1 (* v_main_~x~0_20 v_main_~z~0_BEFORE_CALL_12)) (.cse0 (* v_main_~x~0_20 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12))) (and (= (+ .cse0 v_main_~z~0_BEFORE_CALL_12) (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_24) .cse1)) (= (+ .cse1 1) (+ v_main_~x~0_20 (* v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_24))) (not (= (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_24) .cse0) (+ (* v_main_~x~0_20 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12) (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12))))))) is different from true [2020-07-21 20:56:55,322 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 29 proven. 13 refuted. 2 times theorem prover too weak. 14 trivial. 0 not checked. [2020-07-21 20:56:55,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 20:57:02,328 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 20:57:16,044 WARN L193 SmtUtils]: Spent 666.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-07-21 20:57:17,518 WARN L193 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 20 [2020-07-21 20:57:17,520 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 20:57:17,521 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 20:57:20,671 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_~z~0 (* c_main_~x~0 c_main_~z~0 c_main_~z~0))) (not (= (+ .cse0 1) (+ (* c_main_~y~0 c_main_~z~0) c_main_~x~0))))) is different from true [2020-07-21 20:57:20,673 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 20:57:20,679 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 20:57:22,716 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 20:57:28,376 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_~z~0 .cse0) (+ (* c_main_~x~0 c_main_~z~0) (* c_main_~y~0 c_main_~z~0 c_main_~z~0)))) (= (+ .cse0 (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) (+ (* c_main_~z~0 c_main_~z~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0))))) is different from true [2020-07-21 20:57:28,898 WARN L193 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-07-21 20:57:30,328 WARN L193 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 20 [2020-07-21 20:57:30,330 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 20:57:30,331 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 20:57:32,377 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 c_main_~z~0)) (.cse1 (* main_~x~0 c_main_~z~0))) (or (not (= (+ c_main_~z~0 .cse0) (+ .cse1 (* main_~y~0 c_main_~z~0 c_main_~z~0)))) (= (+ .cse0 (* main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) (+ (* c_main_~z~0 c_main_~z~0) (* main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0))) (not (= (+ .cse1 1) (+ (* main_~y~0 c_main_~z~0) main_~x~0)))))) is different from true [2020-07-21 20:57:32,377 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1227915254] [2020-07-21 20:57:32,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-21 20:57:32,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-21 20:57:32,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463221267] [2020-07-21 20:57:32,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-21 20:57:32,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:57:32,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-21 20:57:32,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=159, Unknown=24, NotChecked=116, Total=342 [2020-07-21 20:57:32,379 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 12 states. [2020-07-21 20:57:49,082 WARN L193 SmtUtils]: Spent 6.16 s on a formula simplification. DAG size of input: 38 DAG size of output: 6 [2020-07-21 20:58:36,709 WARN L193 SmtUtils]: Spent 6.41 s on a formula simplification that was a NOOP. DAG size: 26 [2020-07-21 20:58:48,779 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_main_~x~0_20 Int) (v_main_~z~0_BEFORE_CALL_12 Int) (v_main_~y~0_24 Int)) (let ((.cse2 (* v_main_~x~0_20 v_main_~z~0_BEFORE_CALL_12)) (.cse1 (* v_main_~x~0_20 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12))) (and (= (+ .cse1 v_main_~z~0_BEFORE_CALL_12) (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_24) .cse2)) (= (+ .cse2 1) (+ v_main_~x~0_20 (* v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_24))) (not (= (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_24) .cse1) (+ (* v_main_~x~0_20 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12) (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12))))))))) (and (or (<= 1 |c___VERIFIER_assert_#in~cond|) (and .cse0 (<= 0 |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 20:59:10,564 WARN L193 SmtUtils]: Spent 7.39 s on a formula simplification that was a NOOP. DAG size: 31 [2020-07-21 20:59:14,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:59:14,759 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2020-07-21 20:59:14,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-21 20:59:14,793 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2020-07-21 20:59:14,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:59:14,794 INFO L225 Difference]: With dead ends: 41 [2020-07-21 20:59:14,794 INFO L226 Difference]: Without dead ends: 0 [2020-07-21 20:59:14,795 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 171.5s TimeCoverageRelationStatistics Valid=76, Invalid=287, Unknown=37, NotChecked=200, Total=600 [2020-07-21 20:59:14,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-21 20:59:14,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-21 20:59:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-21 20:59:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-21 20:59:14,796 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2020-07-21 20:59:14,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:59:14,796 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-21 20:59:14,796 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-21 20:59:14,796 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-21 20:59:14,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-21 20:59:14,998 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:59:15,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-21 20:59:16,185 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2020-07-21 20:59:37,614 WARN L193 SmtUtils]: Spent 21.43 s on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2020-07-21 21:00:54,188 WARN L193 SmtUtils]: Spent 1.28 m on a formula simplification. DAG size of input: 96 DAG size of output: 1 [2020-07-21 21:01:24,692 WARN L193 SmtUtils]: Spent 30.50 s on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2020-07-21 21:01:24,695 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-21 21:01:24,695 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-21 21:01:24,696 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-21 21:01:24,696 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-21 21:01:24,696 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-21 21:01:24,696 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-21 21:01:24,696 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 9 11) no Hoare annotation was computed. [2020-07-21 21:01:24,696 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-21 21:01:24,696 INFO L268 CegarLoopResult]: For program point L10-2(lines 9 11) no Hoare annotation was computed. [2020-07-21 21:01:24,697 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 9 11) no Hoare annotation was computed. [2020-07-21 21:01:24,697 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (or (and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0)) (and (= 1 main_~x~0) (= 1 main_~y~0)) (and (exists ((v_main_~x~0_20 Int) (v_main_~y~0_24 Int)) (let ((.cse0 (+ (* v_main_~x~0_20 main_~z~0) 1)) (.cse1 (* main_~z~0 v_main_~y~0_24))) (and (= .cse0 (+ v_main_~x~0_20 .cse1)) (= .cse0 main_~x~0) (= main_~y~0 .cse1)))) (exists ((v_main_~x~0_20 Int) (v_main_~y~0_24 Int)) (let ((.cse2 (* v_main_~x~0_20 main_~z~0)) (.cse4 (* v_main_~x~0_20 main_~z~0 main_~z~0)) (.cse3 (* main_~z~0 main_~z~0 v_main_~y~0_24))) (and (= (+ .cse2 1) (+ v_main_~x~0_20 (* main_~z~0 v_main_~y~0_24))) (= (+ .cse3 .cse2) (+ main_~z~0 .cse4)) (= main_~x~0 (+ main_~z~0 .cse4 1)) (= main_~y~0 .cse3)))))) [2020-07-21 21:01:24,697 INFO L268 CegarLoopResult]: For program point L32-1(lines 31 40) no Hoare annotation was computed. [2020-07-21 21:01:24,697 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 21 43) the Hoare annotation is: true [2020-07-21 21:01:24,698 INFO L264 CegarLoopResult]: At program point L31-2(lines 31 40) the Hoare annotation is: (or (and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0)) (and (= 1 main_~x~0) (= 1 main_~y~0)) (and (exists ((v_main_~x~0_20 Int) (v_main_~y~0_24 Int)) (let ((.cse0 (+ (* v_main_~x~0_20 main_~z~0) 1)) (.cse1 (* main_~z~0 v_main_~y~0_24))) (and (= .cse0 (+ v_main_~x~0_20 .cse1)) (= .cse0 main_~x~0) (= main_~y~0 .cse1)))) (exists ((v_main_~x~0_20 Int) (v_main_~y~0_24 Int)) (let ((.cse2 (* v_main_~x~0_20 main_~z~0)) (.cse4 (* v_main_~x~0_20 main_~z~0 main_~z~0)) (.cse3 (* main_~z~0 main_~z~0 v_main_~y~0_24))) (and (= (+ .cse2 1) (+ v_main_~x~0_20 (* main_~z~0 v_main_~y~0_24))) (= (+ .cse3 .cse2) (+ main_~z~0 .cse4)) (= main_~x~0 (+ main_~z~0 .cse4 1)) (= main_~y~0 .cse3)))))) [2020-07-21 21:01:24,698 INFO L264 CegarLoopResult]: At program point L31-3(lines 31 40) the Hoare annotation is: (= (+ (* main_~x~0 main_~z~0) 1) (+ main_~x~0 (* main_~y~0 main_~z~0))) [2020-07-21 21:01:24,698 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 21 43) no Hoare annotation was computed. [2020-07-21 21:01:24,698 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 21 43) no Hoare annotation was computed. [2020-07-21 21:01:24,698 INFO L268 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2020-07-21 21:01:24,698 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 12 18) the Hoare annotation is: true [2020-07-21 21:01:24,698 INFO L268 CegarLoopResult]: For program point L14(lines 14 15) no Hoare annotation was computed. [2020-07-21 21:01:24,699 INFO L268 CegarLoopResult]: For program point L13(lines 13 16) no Hoare annotation was computed. [2020-07-21 21:01:24,700 INFO L268 CegarLoopResult]: For program point L13-2(lines 12 18) no Hoare annotation was computed. [2020-07-21 21:01:24,701 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 12 18) no Hoare annotation was computed. [2020-07-21 21:01:24,701 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2020-07-21 21:01:24,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] [2020-07-21 21:01:24,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] [2020-07-21 21:01:24,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] [2020-07-21 21:01:24,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] [2020-07-21 21:01:24,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] [2020-07-21 21:01:24,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] [2020-07-21 21:01:24,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] [2020-07-21 21:01:24,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] [2020-07-21 21:01:24,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] [2020-07-21 21:01:24,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] [2020-07-21 21:01:24,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 09:01:24 BoogieIcfgContainer [2020-07-21 21:01:24,729 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 21:01:24,731 INFO L168 Benchmark]: Toolchain (without parser) took 588649.92 ms. Allocated memory was 136.8 MB in the beginning and 250.1 MB in the end (delta: 113.2 MB). Free memory was 100.6 MB in the beginning and 208.1 MB in the end (delta: -107.5 MB). Peak memory consumption was 122.0 MB. Max. memory is 7.1 GB. [2020-07-21 21:01:24,735 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 136.8 MB. Free memory is still 118.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-21 21:01:24,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.59 ms. Allocated memory is still 136.8 MB. Free memory was 100.2 MB in the beginning and 90.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-21 21:01:24,736 INFO L168 Benchmark]: Boogie Preprocessor took 32.70 ms. Allocated memory is still 136.8 MB. Free memory was 90.4 MB in the beginning and 89.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-21 21:01:24,737 INFO L168 Benchmark]: RCFGBuilder took 337.21 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 88.8 MB in the beginning and 166.9 MB in the end (delta: -78.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-07-21 21:01:24,738 INFO L168 Benchmark]: TraceAbstraction took 588030.00 ms. Allocated memory was 200.3 MB in the beginning and 250.1 MB in the end (delta: 49.8 MB). Free memory was 166.9 MB in the beginning and 208.1 MB in the end (delta: -41.2 MB). Peak memory consumption was 124.9 MB. Max. memory is 7.1 GB. [2020-07-21 21:01:24,741 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.28 ms. Allocated memory is still 136.8 MB. Free memory is still 118.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 243.59 ms. Allocated memory is still 136.8 MB. Free memory was 100.2 MB in the beginning and 90.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.70 ms. Allocated memory is still 136.8 MB. Free memory was 90.4 MB in the beginning and 89.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 337.21 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 88.8 MB in the beginning and 166.9 MB in the end (delta: -78.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 588030.00 ms. Allocated memory was 200.3 MB in the beginning and 250.1 MB in the end (delta: 49.8 MB). Free memory was 166.9 MB in the beginning and 208.1 MB in the end (delta: -41.2 MB). Peak memory consumption was 124.9 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_~x~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,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: 31]: Loop Invariant [2020-07-21 21:01:24,750 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,750 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,750 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] [2020-07-21 21:01:24,751 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,751 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] [2020-07-21 21:01:24,751 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,751 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] [2020-07-21 21:01:24,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] [2020-07-21 21:01:24,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] [2020-07-21 21:01:24,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] [2020-07-21 21:01:24,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] [2020-07-21 21:01:24,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] [2020-07-21 21:01:24,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] [2020-07-21 21:01:24,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_20,QUANTIFIED] [2020-07-21 21:01:24,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_24,QUANTIFIED] Derived loop invariant: ((x == z + 1 && z == y) || (1 == x && 1 == y)) || ((\exists v_main_~x~0_20 : int, v_main_~y~0_24 : int :: (v_main_~x~0_20 * z + 1 == v_main_~x~0_20 + z * v_main_~y~0_24 && v_main_~x~0_20 * z + 1 == x) && y == z * v_main_~y~0_24) && (\exists v_main_~x~0_20 : int, v_main_~y~0_24 : int :: ((v_main_~x~0_20 * z + 1 == v_main_~x~0_20 + z * v_main_~y~0_24 && z * z * v_main_~y~0_24 + v_main_~x~0_20 * z == z + v_main_~x~0_20 * z * z) && x == z + v_main_~x~0_20 * z * z + 1) && y == z * z * v_main_~y~0_24)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 458.2s, OverallIterations: 6, TraceHistogramMax: 5, AutomataDifference: 190.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 129.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 87 SDtfs, 55 SDslu, 421 SDs, 0 SdLazy, 296 SolverSat, 13 SolverUnsat, 30 SolverUnknown, 0 SolverNotchecked, 79.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 312.0s 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, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 16 PreInvPairs, 28 NumberOfFragments, 188 HoareAnnotationTreeSize, 16 FomulaSimplifications, 388 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 583 FormulaSimplificationTreeSizeReductionInter, 129.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 266.0s InterpolantComputationTime, 143 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 175 ConstructedInterpolants, 18 QuantifiedInterpolants, 31355 SizeOfPredicates, 24 NumberOfNonLiveVariables, 334 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 91/136 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...