/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench/geo3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 02:12:54,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 02:12:54,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 02:12:54,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 02:12:54,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 02:12:54,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 02:12:54,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 02:12:54,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 02:12:54,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 02:12:54,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 02:12:54,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 02:12:54,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 02:12:54,366 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 02:12:54,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 02:12:54,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 02:12:54,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 02:12:54,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 02:12:54,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 02:12:54,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 02:12:54,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 02:12:54,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 02:12:54,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 02:12:54,378 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 02:12:54,379 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 02:12:54,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 02:12:54,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 02:12:54,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 02:12:54,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 02:12:54,383 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 02:12:54,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 02:12:54,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 02:12:54,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 02:12:54,385 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 02:12:54,386 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 02:12:54,387 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 02:12:54,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 02:12:54,388 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 02:12:54,388 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 02:12:54,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 02:12:54,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 02:12:54,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 02:12:54,391 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 02:12:54,405 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 02:12:54,405 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 02:12:54,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 02:12:54,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 02:12:54,407 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 02:12:54,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 02:12:54,407 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 02:12:54,407 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 02:12:54,408 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 02:12:54,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 02:12:54,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 02:12:54,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 02:12:54,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 02:12:54,409 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 02:12:54,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 02:12:54,409 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 02:12:54,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 02:12:54,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 02:12:54,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 02:12:54,410 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 02:12:54,410 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 02:12:54,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 02:12:54,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 02:12:54,411 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 02:12:54,411 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 02:12:54,411 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 02:12:54,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:12:54,411 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 02:12:54,412 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 02:12:54,412 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 [2020-07-21 02:12:54,716 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 02:12:54,729 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 02:12:54,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 02:12:54,734 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 02:12:54,734 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 02:12:54,735 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/geo3.c [2020-07-21 02:12:54,793 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e92c8e751/2c0e32be9bcb4509a78267fc04b098a6/FLAG893957ce7 [2020-07-21 02:12:55,186 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 02:12:55,187 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/geo3.c [2020-07-21 02:12:55,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e92c8e751/2c0e32be9bcb4509a78267fc04b098a6/FLAG893957ce7 [2020-07-21 02:12:55,607 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e92c8e751/2c0e32be9bcb4509a78267fc04b098a6 [2020-07-21 02:12:55,615 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 02:12:55,618 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 02:12:55,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 02:12:55,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 02:12:55,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 02:12:55,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:12:55" (1/1) ... [2020-07-21 02:12:55,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ef8221c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:12:55, skipping insertion in model container [2020-07-21 02:12:55,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:12:55" (1/1) ... [2020-07-21 02:12:55,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 02:12:55,651 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 02:12:55,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 02:12:55,886 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 02:12:55,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 02:12:55,914 INFO L208 MainTranslator]: Completed translation [2020-07-21 02:12:55,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:12:55 WrapperNode [2020-07-21 02:12:55,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 02:12:55,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 02:12:55,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 02:12:55,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 02:12:55,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:12:55" (1/1) ... [2020-07-21 02:12:55,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:12:55" (1/1) ... [2020-07-21 02:12:55,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:12:55" (1/1) ... [2020-07-21 02:12:55,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:12:55" (1/1) ... [2020-07-21 02:12:55,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:12:55" (1/1) ... [2020-07-21 02:12:55,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:12:55" (1/1) ... [2020-07-21 02:12:55,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:12:55" (1/1) ... [2020-07-21 02:12:56,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 02:12:56,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 02:12:56,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 02:12:56,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 02:12:56,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:12:55" (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 02:12:56,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 02:12:56,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 02:12:56,082 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-21 02:12:56,082 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-21 02:12:56,083 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 02:12:56,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 02:12:56,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 02:12:56,083 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-21 02:12:56,083 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-21 02:12:56,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-21 02:12:56,084 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 02:12:56,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 02:12:56,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 02:12:56,269 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 02:12:56,269 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-21 02:12:56,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:12:56 BoogieIcfgContainer [2020-07-21 02:12:56,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 02:12:56,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 02:12:56,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 02:12:56,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 02:12:56,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:12:55" (1/3) ... [2020-07-21 02:12:56,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d671f2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:12:56, skipping insertion in model container [2020-07-21 02:12:56,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:12:55" (2/3) ... [2020-07-21 02:12:56,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d671f2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:12:56, skipping insertion in model container [2020-07-21 02:12:56,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:12:56" (3/3) ... [2020-07-21 02:12:56,281 INFO L109 eAbstractionObserver]: Analyzing ICFG geo3.c [2020-07-21 02:12:56,291 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 02:12:56,297 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 02:12:56,311 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 02:12:56,334 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 02:12:56,334 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 02:12:56,334 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 02:12:56,334 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 02:12:56,334 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 02:12:56,335 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 02:12:56,335 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 02:12:56,335 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 02:12:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-21 02:12:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-21 02:12:56,358 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:12:56,359 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 02:12:56,359 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:12:56,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:12:56,366 INFO L82 PathProgramCache]: Analyzing trace with hash -64610451, now seen corresponding path program 1 times [2020-07-21 02:12:56,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:12:56,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [414259976] [2020-07-21 02:12:56,375 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:12:56,441 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 02:12:56,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:12:56,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-21 02:12:56,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:12:56,480 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 02:12:56,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 02:12:56,482 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [414259976] [2020-07-21 02:12:56,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 02:12:56,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-21 02:12:56,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895902897] [2020-07-21 02:12:56,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-21 02:12:56,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:12:56,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-21 02:12:56,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-21 02:12:56,510 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-21 02:12:56,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:12:56,535 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2020-07-21 02:12:56,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-21 02:12:56,537 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-21 02:12:56,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:12:56,547 INFO L225 Difference]: With dead ends: 35 [2020-07-21 02:12:56,548 INFO L226 Difference]: Without dead ends: 15 [2020-07-21 02:12:56,551 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-21 02:12:56,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-21 02:12:56,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-21 02:12:56,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-21 02:12:56,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-21 02:12:56,592 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2020-07-21 02:12:56,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:12:56,593 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-21 02:12:56,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-21 02:12:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-21 02:12:56,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-21 02:12:56,594 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:12:56,594 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 02:12:56,808 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:12:56,809 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:12:56,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:12:56,810 INFO L82 PathProgramCache]: Analyzing trace with hash -62822991, now seen corresponding path program 1 times [2020-07-21 02:12:56,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:12:56,810 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1235034492] [2020-07-21 02:12:56,811 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:12:56,849 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 02:12:56,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:12:56,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-21 02:12:56,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:12:56,958 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 02:12:56,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 02:12:56,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1235034492] [2020-07-21 02:12:56,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 02:12:56,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 02:12:56,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740507373] [2020-07-21 02:12:56,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 02:12:56,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:12:56,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 02:12:56,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 02:12:56,963 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2020-07-21 02:12:57,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:12:57,050 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-21 02:12:57,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 02:12:57,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-21 02:12:57,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:12:57,052 INFO L225 Difference]: With dead ends: 25 [2020-07-21 02:12:57,053 INFO L226 Difference]: Without dead ends: 22 [2020-07-21 02:12:57,054 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 02:12:57,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-21 02:12:57,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-21 02:12:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-21 02:12:57,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-21 02:12:57,062 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 10 [2020-07-21 02:12:57,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:12:57,063 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-21 02:12:57,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 02:12:57,063 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-21 02:12:57,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-21 02:12:57,064 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:12:57,064 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 02:12:57,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:12:57,281 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:12:57,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:12:57,282 INFO L82 PathProgramCache]: Analyzing trace with hash 50868238, now seen corresponding path program 1 times [2020-07-21 02:12:57,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:12:57,283 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1500590470] [2020-07-21 02:12:57,284 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:12:57,322 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 02:12:57,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:12:57,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-21 02:12:57,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:12:57,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 02:12:57,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 02:12:57,453 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 02:13:03,735 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 02:13:03,736 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 02:13:05,780 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~x~0 c_main_~z~0))) (or (= (+ .cse0 (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~a~0)) (+ (* c_main_~z~0 c_main_~a~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0))) (not (= (+ .cse0 c_main_~a~0) (+ c_main_~x~0 (* c_main_~y~0 c_main_~z~0 c_main_~a~0)))))) is different from true [2020-07-21 02:13:05,802 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 02:13:05,813 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 02:13:06,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-07-21 02:13:06,044 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1500590470] [2020-07-21 02:13:06,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 02:13:06,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2020-07-21 02:13:06,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040751742] [2020-07-21 02:13:06,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-21 02:13:06,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:13:06,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-21 02:13:06,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=4, NotChecked=18, Total=132 [2020-07-21 02:13:06,049 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 12 states. [2020-07-21 02:13:12,514 WARN L193 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 14 [2020-07-21 02:13:25,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:13:25,187 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-21 02:13:25,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-21 02:13:25,189 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-07-21 02:13:25,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:13:25,190 INFO L225 Difference]: With dead ends: 32 [2020-07-21 02:13:25,190 INFO L226 Difference]: Without dead ends: 28 [2020-07-21 02:13:25,192 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=44, Invalid=137, Unknown=5, NotChecked=24, Total=210 [2020-07-21 02:13:25,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-21 02:13:25,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-21 02:13:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-21 02:13:25,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-07-21 02:13:25,205 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 17 [2020-07-21 02:13:25,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:13:25,206 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-07-21 02:13:25,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-21 02:13:25,207 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-21 02:13:25,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-21 02:13:25,208 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:13:25,208 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 02:13:25,421 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:13:25,422 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:13:25,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:13:25,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1538749201, now seen corresponding path program 2 times [2020-07-21 02:13:25,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:13:25,423 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [647532127] [2020-07-21 02:13:25,423 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:13:25,459 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 02:13:25,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:13:25,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-21 02:13:25,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:13:25,853 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2020-07-21 02:13:25,866 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 02:13:46,927 WARN L193 SmtUtils]: Spent 12.79 s on a formula simplification that was a NOOP. DAG size: 24 [2020-07-21 02:13:46,931 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 02:14:09,681 WARN L193 SmtUtils]: Spent 12.56 s on a formula simplification that was a NOOP. DAG size: 24 [2020-07-21 02:14:11,725 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 02:14:19,937 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0_BEFORE_CALL_5 Int) (v_main_~z~0_BEFORE_CALL_5 Int) (v_main_~x~0_15 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_5 v_main_~x~0_15))) (and (not (= (+ (* v_main_~a~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5) .cse0) (+ (* v_main_~a~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5) (* v_main_~z~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5 v_main_~x~0_15)))) (= (+ .cse0 v_main_~a~0_BEFORE_CALL_5) (+ (* v_main_~a~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5) v_main_~x~0_15))))) is different from false [2020-07-21 02:14:21,960 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0_BEFORE_CALL_5 Int) (v_main_~z~0_BEFORE_CALL_5 Int) (v_main_~x~0_15 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_5 v_main_~x~0_15))) (and (not (= (+ (* v_main_~a~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5) .cse0) (+ (* v_main_~a~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5) (* v_main_~z~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5 v_main_~x~0_15)))) (= (+ .cse0 v_main_~a~0_BEFORE_CALL_5) (+ (* v_main_~a~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5 v_main_~z~0_BEFORE_CALL_5) v_main_~x~0_15))))) is different from true [2020-07-21 02:14:21,963 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 02:14:21,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 02:14:27,757 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 02:14:33,582 WARN L860 $PredicateComparison]: unable to prove that (= (+ (* c_main_~z~0 c_main_~a~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0)) (+ (* c_main_~x~0 c_main_~z~0) (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~a~0))) is different from true [2020-07-21 02:14:33,846 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2020-07-21 02:14:33,865 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 02:14:33,865 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 02:14:35,986 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~x~0 Int)) (let ((.cse0 (* main_~x~0 c_main_~z~0))) (or (= (+ (* c_main_~z~0 c_main_~a~0) (* main_~x~0 c_main_~z~0 c_main_~z~0)) (+ .cse0 (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~a~0))) (not (= (+ .cse0 c_main_~a~0) (+ main_~x~0 (* c_main_~y~0 c_main_~z~0 c_main_~a~0))))))) is different from true [2020-07-21 02:14:35,987 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [647532127] [2020-07-21 02:14:35,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-21 02:14:35,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-21 02:14:35,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601141230] [2020-07-21 02:14:35,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-21 02:14:35,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:14:35,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-21 02:14:35,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=126, Unknown=8, NotChecked=72, Total=240 [2020-07-21 02:14:35,990 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2020-07-21 02:17:28,592 WARN L193 SmtUtils]: Spent 1.37 m on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2020-07-21 02:17:39,079 WARN L193 SmtUtils]: Spent 6.25 s on a formula simplification. DAG size of input: 33 DAG size of output: 6 [2020-07-21 02:18:43,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:18:43,007 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2020-07-21 02:18:43,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-21 02:18:43,011 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-07-21 02:18:43,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:18:43,012 INFO L225 Difference]: With dead ends: 37 [2020-07-21 02:18:43,012 INFO L226 Difference]: Without dead ends: 35 [2020-07-21 02:18:43,013 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 157.4s TimeCoverageRelationStatistics Valid=53, Invalid=186, Unknown=13, NotChecked=90, Total=342 [2020-07-21 02:18:43,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-21 02:18:43,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-07-21 02:18:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-21 02:18:43,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2020-07-21 02:18:43,021 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2020-07-21 02:18:43,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:18:43,022 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2020-07-21 02:18:43,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-21 02:18:43,022 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-21 02:18:43,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-21 02:18:43,023 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:18:43,023 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 02:18:43,236 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:18:43,237 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:18:43,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:18:43,238 INFO L82 PathProgramCache]: Analyzing trace with hash -695576914, now seen corresponding path program 3 times [2020-07-21 02:18:43,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:18:43,239 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1530441932] [2020-07-21 02:18:43,240 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:18:43,296 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 02:18:43,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:18:43,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-21 02:18:43,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:18:48,250 WARN L193 SmtUtils]: Spent 2.62 s on a formula simplification that was a NOOP. DAG size: 14 [2020-07-21 02:18:56,856 WARN L193 SmtUtils]: Spent 4.01 s on a formula simplification that was a NOOP. DAG size: 16 [2020-07-21 02:18:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-21 02:18:58,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 02:18:58,458 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 02:19:05,184 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-07-21 02:19:20,867 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 02:19:20,867 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 02:19:22,913 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~x~0 c_main_~z~0))) (or (= (+ (* c_main_~z~0 c_main_~a~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0)) (+ .cse0 (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~a~0))) (not (= (+ .cse0 c_main_~a~0) (+ c_main_~x~0 (* c_main_~y~0 c_main_~z~0 c_main_~a~0)))))) is different from true [2020-07-21 02:19:22,917 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 02:19:22,925 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 02:19:38,246 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 22 DAG size of output: 4 [2020-07-21 02:19:40,543 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~x~0 c_main_~z~0 c_main_~z~0))) (or (not (= (+ (* c_main_~x~0 c_main_~z~0) (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~a~0)) (+ (* c_main_~z~0 c_main_~a~0) .cse0))) (= (+ (* c_main_~z~0 c_main_~z~0 c_main_~a~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) (+ (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~a~0) .cse0)))) is different from false [2020-07-21 02:19:42,586 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~x~0 c_main_~z~0 c_main_~z~0))) (or (not (= (+ (* c_main_~x~0 c_main_~z~0) (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~a~0)) (+ (* c_main_~z~0 c_main_~a~0) .cse0))) (= (+ (* c_main_~z~0 c_main_~z~0 c_main_~a~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) (+ (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~a~0) .cse0)))) is different from true [2020-07-21 02:19:42,953 WARN L193 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2020-07-21 02:19:43,439 WARN L193 SmtUtils]: Spent 485.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2020-07-21 02:19:43,442 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 02:19:43,443 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 02:19:45,470 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_main_~x~0 c_main_~z~0 c_main_~z~0)) (.cse0 (* c_main_~x~0 c_main_~z~0))) (or (not (= (+ .cse0 (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~a~0)) (+ (* c_main_~z~0 c_main_~a~0) .cse1))) (= (+ (* c_main_~z~0 c_main_~z~0 c_main_~a~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) (+ (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~a~0) .cse1)) (not (= (+ .cse0 c_main_~a~0) (+ c_main_~x~0 (* c_main_~y~0 c_main_~z~0 c_main_~a~0)))))) is different from true [2020-07-21 02:19:45,475 INFO L501 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-07-21 02:19:45,478 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-07-21 02:19:51,710 WARN L860 $PredicateComparison]: unable to prove that (or (not (= 0 |c___VERIFIER_assert_#in~cond|)) (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_10 Int) (v_main_~y~0_BEFORE_CALL_13 Int) (v_main_~a~0_BEFORE_CALL_11 Int)) (let ((.cse0 (* v_main_~x~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10)) (.cse1 (* v_main_~x~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_10))) (or (= (+ (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~y~0_BEFORE_CALL_13 v_main_~a~0_BEFORE_CALL_11) .cse0) (+ (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~a~0_BEFORE_CALL_11) (* v_main_~x~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10))) (not (= (+ .cse0 (* v_main_~z~0_BEFORE_CALL_10 v_main_~a~0_BEFORE_CALL_11)) (+ .cse1 (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~y~0_BEFORE_CALL_13 v_main_~a~0_BEFORE_CALL_11)))) (= (+ v_main_~x~0_BEFORE_CALL_11 (* v_main_~z~0_BEFORE_CALL_10 v_main_~y~0_BEFORE_CALL_13 v_main_~a~0_BEFORE_CALL_11)) (+ .cse1 v_main_~a~0_BEFORE_CALL_11)))))) is different from true [2020-07-21 02:20:01,921 WARN L860 $PredicateComparison]: unable to prove that (or (not (= 0 |c___VERIFIER_assert_#in~cond|)) (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_10 Int) (v_main_~y~0_BEFORE_CALL_13 Int) (v_main_~a~0_BEFORE_CALL_11 Int)) (let ((.cse0 (* v_main_~x~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10)) (.cse1 (* v_main_~x~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_10))) (or (= (+ (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~y~0_BEFORE_CALL_13 v_main_~a~0_BEFORE_CALL_11) .cse0) (+ (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~a~0_BEFORE_CALL_11) (* v_main_~x~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10))) (not (= (+ .cse0 (* v_main_~z~0_BEFORE_CALL_10 v_main_~a~0_BEFORE_CALL_11)) (+ .cse1 (* v_main_~z~0_BEFORE_CALL_10 v_main_~z~0_BEFORE_CALL_10 v_main_~y~0_BEFORE_CALL_13 v_main_~a~0_BEFORE_CALL_11)))) (= (+ v_main_~x~0_BEFORE_CALL_11 (* v_main_~z~0_BEFORE_CALL_10 v_main_~y~0_BEFORE_CALL_13 v_main_~a~0_BEFORE_CALL_11)) (+ .cse1 v_main_~a~0_BEFORE_CALL_11))))) (= 0 c___VERIFIER_assert_~cond)) is different from true [2020-07-21 02:20:04,597 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~x~0 c_main_~z~0 c_main_~z~0)) (.cse1 (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0))) (or (not (= (+ (* c_main_~x~0 c_main_~z~0) (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~a~0)) (+ (* c_main_~z~0 c_main_~a~0) .cse0))) (= (+ (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~a~0) .cse1) (+ (* c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~a~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~z~0))) (not (= (+ (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~a~0) .cse0) (+ (* c_main_~z~0 c_main_~z~0 c_main_~a~0) .cse1))))) is different from true [2020-07-21 02:20:04,609 INFO L501 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-07-21 02:20:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 19 not checked. [2020-07-21 02:20:04,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1530441932] [2020-07-21 02:20:04,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 02:20:04,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2020-07-21 02:20:04,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404057044] [2020-07-21 02:20:04,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-21 02:20:04,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:20:04,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-21 02:20:04,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=188, Unknown=22, NotChecked=198, Total=462 [2020-07-21 02:20:04,636 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 22 states. [2020-07-21 02:21:26,670 WARN L193 SmtUtils]: Spent 51.34 s on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2020-07-21 02:21:45,129 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~x~0 c_main_~z~0)) (.cse1 (* c_main_~z~0 c_main_~a~0))) (and (let ((.cse2 (* c_main_~x~0 c_main_~z~0 c_main_~z~0))) (or (not (= (+ .cse0 (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~a~0)) (+ .cse1 .cse2))) (= (+ (* c_main_~z~0 c_main_~z~0 c_main_~a~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) (+ (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~a~0) .cse2)))) (= (+ .cse0 c_main_~a~0) (+ c_main_~x~0 (* c_main_~y~0 c_main_~z~0 c_main_~a~0))) (= (+ .cse1 c_main_~a~0) c_main_~x~0) (= c_main_~z~0 c_main_~y~0))) is different from false [2020-07-21 02:21:47,198 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~z~0 c_main_~a~0))) (and (= c_main_~x~0 (+ (* c_main_~z~0 c_main_~z~0 c_main_~a~0) .cse0 c_main_~a~0)) (let ((.cse1 (* c_main_~x~0 c_main_~z~0))) (or (= (+ .cse0 (* c_main_~x~0 c_main_~z~0 c_main_~z~0)) (+ .cse1 (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~a~0))) (not (= (+ .cse1 c_main_~a~0) (+ c_main_~x~0 (* c_main_~y~0 c_main_~z~0 c_main_~a~0)))))) (= c_main_~y~0 (* c_main_~z~0 c_main_~z~0)))) is different from false [2020-07-21 02:21:50,750 WARN L193 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 32 DAG size of output: 7 [2020-07-21 02:22:04,480 WARN L193 SmtUtils]: Spent 11.61 s on a formula simplification that was a NOOP. DAG size: 21 [2020-07-21 02:22:19,940 WARN L193 SmtUtils]: Spent 4.10 s on a formula simplification that was a NOOP. DAG size: 17 [2020-07-21 02:22:39,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:22:39,721 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2020-07-21 02:22:39,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 02:22:39,772 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2020-07-21 02:22:39,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:22:39,773 INFO L225 Difference]: With dead ends: 44 [2020-07-21 02:22:39,774 INFO L226 Difference]: Without dead ends: 42 [2020-07-21 02:22:39,775 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 177.2s TimeCoverageRelationStatistics Valid=88, Invalid=328, Unknown=36, NotChecked=360, Total=812 [2020-07-21 02:22:39,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-21 02:22:39,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-07-21 02:22:39,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-21 02:22:39,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2020-07-21 02:22:39,783 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 31 [2020-07-21 02:22:39,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:22:39,784 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2020-07-21 02:22:39,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-21 02:22:39,784 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2020-07-21 02:22:39,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-21 02:22:39,785 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:22:39,785 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 02:22:39,995 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:22:39,995 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:22:39,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:22:39,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1264228465, now seen corresponding path program 4 times [2020-07-21 02:22:39,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:22:39,997 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [568265823] [2020-07-21 02:22:39,998 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:22:40,051 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 02:22:40,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:22:40,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-21 02:22:40,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:22:43,203 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~x~0_27 Int)) (= (+ (* c_main_~z~0 c_main_~z~0 c_main_~a~0) v_main_~x~0_27) (+ c_main_~a~0 (* c_main_~z~0 v_main_~x~0_27)))) is different from true [2020-07-21 02:22:52,819 WARN L193 SmtUtils]: Spent 7.14 s on a formula simplification that was a NOOP. DAG size: 17 [2020-07-21 02:23:06,300 WARN L193 SmtUtils]: Spent 5.10 s on a formula simplification that was a NOOP. DAG size: 24 [2020-07-21 02:23:06,311 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 02:23:10,493 WARN L838 $PredicateComparison]: unable to prove that (or (<= 1 |c___VERIFIER_assert_#in~cond|) (and (<= 0 |c___VERIFIER_assert_#in~cond|) (exists ((v_main_~z~0_BEFORE_CALL_15 Int) (v_main_~y~0_28 Int) (v_main_~x~0_28 Int) (v_main_~x~0_BEFORE_CALL_13 Int) (v_main_~x~0_27 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28))) (and (= (+ v_main_~x~0_28 (* v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_BEFORE_CALL_13)) (+ v_main_~x~0_BEFORE_CALL_13 (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_28))) (not (= (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_BEFORE_CALL_13) (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28 v_main_~y~0_28)) (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_BEFORE_CALL_13) .cse0))) (= (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28) v_main_~x~0_BEFORE_CALL_13 (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_27)) (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_BEFORE_CALL_13) v_main_~x~0_27 .cse0))))))) is different from false [2020-07-21 02:23:10,497 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 02:23:18,772 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((v_main_~z~0_BEFORE_CALL_15 Int) (v_main_~y~0_28 Int) (v_main_~x~0_28 Int) (v_main_~x~0_BEFORE_CALL_13 Int) (v_main_~x~0_27 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28))) (and (= (+ v_main_~x~0_28 (* v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_BEFORE_CALL_13)) (+ v_main_~x~0_BEFORE_CALL_13 (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_28))) (not (= (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_BEFORE_CALL_13) (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28 v_main_~y~0_28)) (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_BEFORE_CALL_13) .cse0))) (= (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28) v_main_~x~0_BEFORE_CALL_13 (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_27)) (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_BEFORE_CALL_13) v_main_~x~0_27 .cse0))))) (<= 0 c___VERIFIER_assert_~cond)) (<= 1 c___VERIFIER_assert_~cond)) is different from false [2020-07-21 02:23:20,858 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 02:23:29,039 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_main_~z~0_BEFORE_CALL_15 Int) (v_main_~y~0_28 Int) (v_main_~x~0_28 Int) (v_main_~x~0_BEFORE_CALL_13 Int) (v_main_~x~0_27 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28))) (and (= (+ v_main_~x~0_28 (* v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_BEFORE_CALL_13)) (+ v_main_~x~0_BEFORE_CALL_13 (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_28))) (not (= (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_BEFORE_CALL_13) (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28 v_main_~y~0_28)) (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_BEFORE_CALL_13) .cse0))) (= (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28) v_main_~x~0_BEFORE_CALL_13 (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_27)) (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_BEFORE_CALL_13) v_main_~x~0_27 .cse0))))) is different from false [2020-07-21 02:23:31,056 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~z~0_BEFORE_CALL_15 Int) (v_main_~y~0_28 Int) (v_main_~x~0_28 Int) (v_main_~x~0_BEFORE_CALL_13 Int) (v_main_~x~0_27 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28))) (and (= (+ v_main_~x~0_28 (* v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_BEFORE_CALL_13)) (+ v_main_~x~0_BEFORE_CALL_13 (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_28))) (not (= (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_BEFORE_CALL_13) (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28 v_main_~y~0_28)) (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~y~0_28 v_main_~x~0_BEFORE_CALL_13) .cse0))) (= (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_28) v_main_~x~0_BEFORE_CALL_13 (* v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_27)) (+ (* v_main_~z~0_BEFORE_CALL_15 v_main_~z~0_BEFORE_CALL_15 v_main_~x~0_BEFORE_CALL_13) v_main_~x~0_27 .cse0))))) is different from true [2020-07-21 02:23:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 15 proven. 11 refuted. 1 times theorem prover too weak. 14 trivial. 17 not checked. [2020-07-21 02:23:31,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 02:23:32,520 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 02:23:56,593 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-07-21 02:23:56,679 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 02:23:56,679 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 02:23:58,713 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~x~0 Int) (main_~y~0 Int)) (let ((.cse0 (* main_~x~0 c_main_~z~0))) (or (= (+ .cse0 (* main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~a~0)) (+ (* c_main_~z~0 c_main_~a~0) (* main_~x~0 c_main_~z~0 c_main_~z~0))) (not (= (+ .cse0 c_main_~a~0) (+ main_~x~0 (* main_~y~0 c_main_~z~0 c_main_~a~0))))))) is different from true [2020-07-21 02:23:58,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [568265823] [2020-07-21 02:23:58,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-21 02:23:58,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-21 02:23:58,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968338839] [2020-07-21 02:23:58,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-21 02:23:58,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:23:58,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-21 02:23:58,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=123, Unknown=18, NotChecked=130, Total=306 [2020-07-21 02:23:58,716 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 13 states. [2020-07-21 02:25:17,615 WARN L193 SmtUtils]: Spent 20.66 s on a formula simplification that was a NOOP. DAG size: 36 [2020-07-21 02:25:38,812 WARN L193 SmtUtils]: Spent 8.50 s on a formula simplification that was a NOOP. DAG size: 29 [2020-07-21 02:25:44,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:25:44,947 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2020-07-21 02:25:45,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-21 02:25:45,003 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2020-07-21 02:25:45,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:25:45,004 INFO L225 Difference]: With dead ends: 41 [2020-07-21 02:25:45,004 INFO L226 Difference]: Without dead ends: 0 [2020-07-21 02:25:45,005 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 138.5s TimeCoverageRelationStatistics Valid=53, Invalid=202, Unknown=37, NotChecked=170, Total=462 [2020-07-21 02:25:45,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-21 02:25:45,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-21 02:25:45,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-21 02:25:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-21 02:25:45,006 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2020-07-21 02:25:45,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:25:45,006 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-21 02:25:45,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-21 02:25:45,006 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-21 02:25:45,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-21 02:25:45,207 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:25:45,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-21 02:25:47,823 WARN L193 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2020-07-21 02:26:27,487 WARN L193 SmtUtils]: Spent 39.65 s on a formula simplification that was a NOOP. DAG size: 51