/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 NUM_VARIABLES --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/array-fpi/eqn2f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-20 17:36:47,901 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 17:36:47,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 17:36:47,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 17:36:47,928 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 17:36:47,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 17:36:47,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 17:36:47,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 17:36:47,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 17:36:47,953 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 17:36:47,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 17:36:47,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 17:36:47,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 17:36:47,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 17:36:47,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 17:36:47,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 17:36:47,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 17:36:47,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 17:36:47,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 17:36:47,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 17:36:47,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 17:36:47,982 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 17:36:47,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 17:36:47,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 17:36:47,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 17:36:47,988 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 17:36:47,988 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 17:36:47,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 17:36:47,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 17:36:47,994 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 17:36:47,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 17:36:47,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 17:36:47,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 17:36:47,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 17:36:47,998 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 17:36:47,998 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 17:36:47,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 17:36:47,999 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 17:36:48,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 17:36:48,000 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 17:36:48,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 17:36:48,003 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-20 17:36:48,039 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 17:36:48,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 17:36:48,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 17:36:48,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 17:36:48,045 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 17:36:48,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 17:36:48,046 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 17:36:48,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 17:36:48,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 17:36:48,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 17:36:48,048 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 17:36:48,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 17:36:48,048 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 17:36:48,048 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 17:36:48,048 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 17:36:48,049 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 17:36:48,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 17:36:48,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 17:36:48,050 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 17:36:48,051 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 17:36:48,051 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 17:36:48,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 17:36:48,051 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 17:36:48,051 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 17:36:48,052 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 17:36:48,052 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 17:36:48,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:36:48,053 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 17:36:48,053 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 17:36:48,053 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 -> NUM_VARIABLES 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-20 17:36:48,378 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 17:36:48,396 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 17:36:48,399 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 17:36:48,401 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 17:36:48,402 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 17:36:48,403 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/eqn2f.c [2020-07-20 17:36:48,475 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab00f3287/ac4263080e454f85b88a4f59ddc68c13/FLAG4ebb6b66f [2020-07-20 17:36:48,944 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 17:36:48,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/eqn2f.c [2020-07-20 17:36:48,952 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab00f3287/ac4263080e454f85b88a4f59ddc68c13/FLAG4ebb6b66f [2020-07-20 17:36:49,365 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab00f3287/ac4263080e454f85b88a4f59ddc68c13 [2020-07-20 17:36:49,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 17:36:49,379 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 17:36:49,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 17:36:49,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 17:36:49,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 17:36:49,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:36:49" (1/1) ... [2020-07-20 17:36:49,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7269e0db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:49, skipping insertion in model container [2020-07-20 17:36:49,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:36:49" (1/1) ... [2020-07-20 17:36:49,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 17:36:49,422 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 17:36:49,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 17:36:49,640 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 17:36:49,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 17:36:49,676 INFO L208 MainTranslator]: Completed translation [2020-07-20 17:36:49,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:49 WrapperNode [2020-07-20 17:36:49,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 17:36:49,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 17:36:49,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 17:36:49,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 17:36:49,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:49" (1/1) ... [2020-07-20 17:36:49,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:49" (1/1) ... [2020-07-20 17:36:49,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:49" (1/1) ... [2020-07-20 17:36:49,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:49" (1/1) ... [2020-07-20 17:36:49,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:49" (1/1) ... [2020-07-20 17:36:49,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:49" (1/1) ... [2020-07-20 17:36:49,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:49" (1/1) ... [2020-07-20 17:36:49,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 17:36:49,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 17:36:49,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 17:36:49,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 17:36:49,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:49" (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-20 17:36:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 17:36:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 17:36:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-20 17:36:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-20 17:36:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 17:36:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 17:36:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-20 17:36:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-20 17:36:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-20 17:36:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 17:36:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-20 17:36:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 17:36:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-20 17:36:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-20 17:36:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-20 17:36:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 17:36:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 17:36:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-20 17:36:50,246 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 17:36:50,247 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-20 17:36:50,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:36:50 BoogieIcfgContainer [2020-07-20 17:36:50,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 17:36:50,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 17:36:50,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 17:36:50,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 17:36:50,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:36:49" (1/3) ... [2020-07-20 17:36:50,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee41f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:36:50, skipping insertion in model container [2020-07-20 17:36:50,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:49" (2/3) ... [2020-07-20 17:36:50,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee41f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:36:50, skipping insertion in model container [2020-07-20 17:36:50,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:36:50" (3/3) ... [2020-07-20 17:36:50,274 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn2f.c [2020-07-20 17:36:50,300 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 17:36:50,309 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 17:36:50,324 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 17:36:50,350 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 17:36:50,350 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 17:36:50,350 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 17:36:50,350 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 17:36:50,351 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 17:36:50,351 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 17:36:50,351 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 17:36:50,351 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 17:36:50,371 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-20 17:36:50,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-20 17:36:50,377 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:36:50,378 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 17:36:50,378 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:36:50,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:36:50,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1314760119, now seen corresponding path program 1 times [2020-07-20 17:36:50,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:36:50,394 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [984791627] [2020-07-20 17:36:50,395 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-20 17:36:50,509 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 17:36:50,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:36:50,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-20 17:36:50,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:36:50,542 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-20 17:36:50,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 17:36:50,545 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [984791627] [2020-07-20 17:36:50,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 17:36:50,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-20 17:36:50,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059779962] [2020-07-20 17:36:50,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-20 17:36:50,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:36:50,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-20 17:36:50,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-20 17:36:50,574 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2020-07-20 17:36:50,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:36:50,599 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2020-07-20 17:36:50,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-20 17:36:50,600 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2020-07-20 17:36:50,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:36:50,607 INFO L225 Difference]: With dead ends: 58 [2020-07-20 17:36:50,608 INFO L226 Difference]: Without dead ends: 29 [2020-07-20 17:36:50,611 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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-20 17:36:50,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-20 17:36:50,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-20 17:36:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-20 17:36:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-20 17:36:50,646 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2020-07-20 17:36:50,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:36:50,647 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-20 17:36:50,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-20 17:36:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-20 17:36:50,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-20 17:36:50,648 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:36:50,648 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 17:36:50,854 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:36:50,855 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:36:50,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:36:50,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1901566133, now seen corresponding path program 1 times [2020-07-20 17:36:50,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:36:50,857 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [847747603] [2020-07-20 17:36:50,858 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-20 17:36:50,943 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 17:36:50,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:36:50,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-20 17:36:50,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:36:51,040 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:36:51,040 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2020-07-20 17:36:51,042 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:36:51,079 INFO L624 ElimStorePlain]: treesize reduction 16, result has 61.9 percent of original size [2020-07-20 17:36:51,082 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:36:51,083 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:11 [2020-07-20 17:36:51,148 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:36:51,149 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-20 17:36:51,151 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-20 17:36:51,164 INFO L624 ElimStorePlain]: treesize reduction 12, result has 36.8 percent of original size [2020-07-20 17:36:51,165 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:36:51,165 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:7 [2020-07-20 17:36:51,206 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-20 17:36:51,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 17:36:51,207 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [847747603] [2020-07-20 17:36:51,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 17:36:51,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-20 17:36:51,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023711623] [2020-07-20 17:36:51,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-20 17:36:51,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:36:51,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-20 17:36:51,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-20 17:36:51,212 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 8 states. [2020-07-20 17:36:51,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:36:51,406 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2020-07-20 17:36:51,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 17:36:51,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-07-20 17:36:51,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:36:51,410 INFO L225 Difference]: With dead ends: 48 [2020-07-20 17:36:51,410 INFO L226 Difference]: Without dead ends: 46 [2020-07-20 17:36:51,411 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-20 17:36:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-20 17:36:51,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2020-07-20 17:36:51,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-20 17:36:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-20 17:36:51,424 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 22 [2020-07-20 17:36:51,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:36:51,425 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-20 17:36:51,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-20 17:36:51,425 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-20 17:36:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-20 17:36:51,426 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:36:51,427 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 17:36:51,641 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:36:51,642 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:36:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:36:51,643 INFO L82 PathProgramCache]: Analyzing trace with hash -2104565367, now seen corresponding path program 1 times [2020-07-20 17:36:51,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:36:51,644 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [814674695] [2020-07-20 17:36:51,645 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-20 17:36:51,740 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 17:36:51,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:36:51,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 17:36:51,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:36:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 17:36:51,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 17:36:51,772 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [814674695] [2020-07-20 17:36:51,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 17:36:51,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 17:36:51,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945897865] [2020-07-20 17:36:51,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 17:36:51,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:36:51,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 17:36:51,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-20 17:36:51,775 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2020-07-20 17:36:51,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:36:51,891 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-20 17:36:51,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 17:36:51,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-20 17:36:51,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:36:51,896 INFO L225 Difference]: With dead ends: 71 [2020-07-20 17:36:51,896 INFO L226 Difference]: Without dead ends: 58 [2020-07-20 17:36:51,897 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-20 17:36:51,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-20 17:36:51,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2020-07-20 17:36:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-20 17:36:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-07-20 17:36:51,907 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 24 [2020-07-20 17:36:51,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:36:51,908 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-07-20 17:36:51,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 17:36:51,908 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-07-20 17:36:51,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-20 17:36:51,909 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:36:51,910 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 17:36:52,117 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:36:52,117 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:36:52,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:36:52,118 INFO L82 PathProgramCache]: Analyzing trace with hash -2011180599, now seen corresponding path program 1 times [2020-07-20 17:36:52,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:36:52,118 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1683686648] [2020-07-20 17:36:52,118 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-20 17:36:52,175 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 17:36:52,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:36:52,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 17:36:52,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:36:52,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 17:36:52,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 17:36:52,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 17:36:52,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1683686648] [2020-07-20 17:36:52,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 17:36:52,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-20 17:36:52,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171318858] [2020-07-20 17:36:52,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 17:36:52,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:36:52,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 17:36:52,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 17:36:52,245 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2020-07-20 17:36:52,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:36:52,394 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2020-07-20 17:36:52,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 17:36:52,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-20 17:36:52,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:36:52,397 INFO L225 Difference]: With dead ends: 66 [2020-07-20 17:36:52,397 INFO L226 Difference]: Without dead ends: 55 [2020-07-20 17:36:52,398 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-07-20 17:36:52,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-20 17:36:52,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2020-07-20 17:36:52,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-20 17:36:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-07-20 17:36:52,408 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 24 [2020-07-20 17:36:52,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:36:52,408 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-07-20 17:36:52,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 17:36:52,409 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-20 17:36:52,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 17:36:52,410 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:36:52,410 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 17:36:52,625 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:36:52,626 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:36:52,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:36:52,627 INFO L82 PathProgramCache]: Analyzing trace with hash -69884793, now seen corresponding path program 1 times [2020-07-20 17:36:52,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:36:52,627 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [824249771] [2020-07-20 17:36:52,627 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-20 17:36:52,719 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 17:36:52,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:36:52,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 31 conjunts are in the unsatisfiable core [2020-07-20 17:36:52,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:36:52,742 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-20 17:36:52,743 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:36:52,756 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:36:52,763 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-20 17:36:52,764 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 17:36:52,787 INFO L624 ElimStorePlain]: treesize reduction 4, result has 85.7 percent of original size [2020-07-20 17:36:52,788 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:36:52,788 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:24 [2020-07-20 17:36:52,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:36:52,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:36:52,818 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:36:52,835 INFO L350 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2020-07-20 17:36:52,836 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 57 [2020-07-20 17:36:52,838 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:36:52,886 INFO L624 ElimStorePlain]: treesize reduction 39, result has 57.6 percent of original size [2020-07-20 17:36:52,887 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:36:52,887 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:53 [2020-07-20 17:36:52,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:36:53,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:36:53,009 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:36:53,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:36:53,146 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-07-20 17:36:53,146 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:36:53,147 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 62 treesize of output 237 [2020-07-20 17:36:53,153 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:36:53,278 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 38 [2020-07-20 17:36:53,280 INFO L624 ElimStorePlain]: treesize reduction 257, result has 22.8 percent of original size [2020-07-20 17:36:53,281 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 17:36:53,282 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:76 [2020-07-20 17:36:53,332 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:36:53,480 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2020-07-20 17:36:53,486 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:36:53,697 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:36:53,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:36:53,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:36:53,703 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:36:53,704 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:36:53,744 INFO L350 Elim1Store]: treesize reduction 43, result has 37.7 percent of original size [2020-07-20 17:36:53,745 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 58 treesize of output 43 [2020-07-20 17:36:53,746 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:36:53,769 INFO L624 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2020-07-20 17:36:53,771 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:36:53,771 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:7 [2020-07-20 17:36:53,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 17:36:53,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 17:36:53,916 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:36:55,014 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (or (<= c_~N~0 main_~i~0) (< (+ main_~i~0 1) c_~N~0) (= 1 (select (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* main_~i~0 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-20 17:36:55,952 WARN L193 SmtUtils]: Spent 874.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2020-07-20 17:36:56,157 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-07-20 17:36:57,421 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_2 Int)) (or (= 1 (select (let ((.cse2 (let ((.cse3 (select |c_#memory_int| c_main_~a~0.base)) (.cse4 (* c_main_~i~0 8))) (store .cse3 (+ .cse4 c_main_~a~0.offset) (+ (select .cse3 (+ .cse4 c_main_~a~0.offset (- 8))) 4))))) (let ((.cse0 (select (store |c_#memory_int| c_main_~a~0.base .cse2) c_main_~b~0.base)) (.cse1 (* v_prenex_2 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse2 (+ .cse1 c_main_~a~0.offset (- 8))) (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))))))) c_main_~b~0.offset)) (< v_prenex_2 c_main_~i~0) (< c_main_~i~0 v_prenex_2))) is different from false [2020-07-20 17:36:57,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-07-20 17:36:57,465 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [824249771] [2020-07-20 17:36:57,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 17:36:57,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2020-07-20 17:36:57,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688184799] [2020-07-20 17:36:57,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-20 17:36:57,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:36:57,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-20 17:36:57,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=304, Unknown=2, NotChecked=74, Total=462 [2020-07-20 17:36:57,469 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 22 states. [2020-07-20 17:36:58,387 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (= 1 c_main_~i~0) (= 0 c_main_~a~0.offset) (forall ((v_prenex_2 Int)) (or (= 1 (select (let ((.cse2 (let ((.cse3 (select |c_#memory_int| c_main_~a~0.base)) (.cse4 (* c_main_~i~0 8))) (store .cse3 (+ .cse4 c_main_~a~0.offset) (+ (select .cse3 (+ .cse4 c_main_~a~0.offset (- 8))) 4))))) (let ((.cse0 (select (store |c_#memory_int| c_main_~a~0.base .cse2) c_main_~b~0.base)) (.cse1 (* v_prenex_2 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse2 (+ .cse1 c_main_~a~0.offset (- 8))) (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))))))) c_main_~b~0.offset)) (< v_prenex_2 c_main_~i~0) (< c_main_~i~0 v_prenex_2))) (= 8 (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset)) (= c_main_~b~0.offset 0)) is different from false [2020-07-20 17:36:59,223 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse0 (select .cse1 (+ c_main_~a~0.offset 8)))) (and (<= c_~N~0 2) (<= c_main_~i~0 2) (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (< 1 c_~N~0) (= 0 c_main_~a~0.offset) (= 12 .cse0) (= .cse0 (+ (select .cse1 c_main_~a~0.offset) 4)) (= c_main_~b~0.offset 0) (forall ((main_~i~0 Int)) (or (<= c_~N~0 main_~i~0) (< (+ main_~i~0 1) c_~N~0) (= 1 (select (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base)) (.cse3 (* main_~i~0 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8))) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset (- 8)))))) c_main_~b~0.offset))))))) is different from false [2020-07-20 17:37:00,310 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 34 [2020-07-20 17:37:01,092 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse0 (select .cse1 (+ c_main_~a~0.offset 8)))) (and (<= c_~N~0 2) (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (< 1 c_~N~0) (= 0 c_main_~a~0.offset) (= 12 .cse0) (= .cse0 (+ (select .cse1 c_main_~a~0.offset) 4)) (= c_main_~b~0.offset 0) (forall ((main_~i~0 Int)) (or (<= c_~N~0 main_~i~0) (< (+ main_~i~0 1) c_~N~0) (= 1 (select (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base)) (.cse3 (* main_~i~0 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8))) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset (- 8)))))) c_main_~b~0.offset))))))) is different from false [2020-07-20 17:37:02,102 WARN L193 SmtUtils]: Spent 969.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-07-20 17:37:04,155 WARN L193 SmtUtils]: Spent 1.99 s on a formula simplification that was a NOOP. DAG size: 34 [2020-07-20 17:37:07,330 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (forall ((main_~i~0 Int)) (or (<= c_~N~0 main_~i~0) (< (+ main_~i~0 1) c_~N~0) (= 1 (select (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* main_~i~0 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset (- 8)))))) c_main_~b~0.offset))))) is different from false [2020-07-20 17:37:09,192 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2020-07-20 17:37:10,653 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 44 [2020-07-20 17:37:12,642 WARN L193 SmtUtils]: Spent 1.45 s on a formula simplification that was a NOOP. DAG size: 55 [2020-07-20 17:37:14,196 WARN L193 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 54 [2020-07-20 17:37:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:37:14,265 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2020-07-20 17:37:14,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-20 17:37:14,268 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2020-07-20 17:37:14,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:37:14,271 INFO L225 Difference]: With dead ends: 89 [2020-07-20 17:37:14,272 INFO L226 Difference]: Without dead ends: 87 [2020-07-20 17:37:14,275 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=240, Invalid=770, Unknown=6, NotChecked=390, Total=1406 [2020-07-20 17:37:14,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-07-20 17:37:14,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 48. [2020-07-20 17:37:14,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-20 17:37:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2020-07-20 17:37:14,291 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 26 [2020-07-20 17:37:14,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:37:14,292 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2020-07-20 17:37:14,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-20 17:37:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-07-20 17:37:14,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-20 17:37:14,293 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:37:14,293 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 17:37:14,507 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:37:14,508 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:37:14,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:37:14,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1499578309, now seen corresponding path program 2 times [2020-07-20 17:37:14,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:37:14,510 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [607969086] [2020-07-20 17:37:14,510 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-20 17:37:14,632 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 17:37:14,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:37:14,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 17:37:14,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:37:14,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 17:37:14,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 17:37:14,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 17:37:14,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [607969086] [2020-07-20 17:37:14,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 17:37:14,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-20 17:37:14,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250803635] [2020-07-20 17:37:14,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 17:37:14,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:37:14,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 17:37:14,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-20 17:37:14,743 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 9 states. [2020-07-20 17:37:15,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:37:15,028 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2020-07-20 17:37:15,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 17:37:15,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-07-20 17:37:15,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:37:15,030 INFO L225 Difference]: With dead ends: 95 [2020-07-20 17:37:15,030 INFO L226 Difference]: Without dead ends: 74 [2020-07-20 17:37:15,031 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2020-07-20 17:37:15,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-20 17:37:15,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2020-07-20 17:37:15,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-20 17:37:15,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2020-07-20 17:37:15,045 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 28 [2020-07-20 17:37:15,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:37:15,046 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2020-07-20 17:37:15,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 17:37:15,046 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2020-07-20 17:37:15,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-20 17:37:15,047 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:37:15,047 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 17:37:15,256 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:37:15,257 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:37:15,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:37:15,258 INFO L82 PathProgramCache]: Analyzing trace with hash 2071122883, now seen corresponding path program 3 times [2020-07-20 17:37:15,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:37:15,259 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [999376307] [2020-07-20 17:37:15,259 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:37:15,350 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 17:37:15,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:37:15,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 29 conjunts are in the unsatisfiable core [2020-07-20 17:37:15,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:37:15,374 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-20 17:37:15,374 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:37:15,382 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:37:15,390 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-20 17:37:15,391 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 17:37:15,398 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:37:15,399 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:37:15,399 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:22 [2020-07-20 17:37:15,470 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-20 17:37:15,471 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2020-07-20 17:37:15,472 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:37:15,507 INFO L624 ElimStorePlain]: treesize reduction 35, result has 55.7 percent of original size [2020-07-20 17:37:15,508 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:37:15,508 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:44 [2020-07-20 17:37:15,628 INFO L350 Elim1Store]: treesize reduction 126, result has 31.5 percent of original size [2020-07-20 17:37:15,629 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 89 [2020-07-20 17:37:15,631 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:37:15,683 INFO L624 ElimStorePlain]: treesize reduction 35, result has 66.7 percent of original size [2020-07-20 17:37:15,684 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:37:15,684 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2020-07-20 17:37:15,894 INFO L350 Elim1Store]: treesize reduction 86, result has 50.9 percent of original size [2020-07-20 17:37:15,895 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 82 treesize of output 155 [2020-07-20 17:37:15,897 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:37:15,978 INFO L624 ElimStorePlain]: treesize reduction 94, result has 46.6 percent of original size [2020-07-20 17:37:15,979 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:37:15,979 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:92, output treesize:82 [2020-07-20 17:37:16,111 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 17:37:16,114 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:16,117 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 17:37:16,150 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:37:16,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:16,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:16,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:16,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:16,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:16,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:16,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:16,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:16,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:16,202 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:37:16,265 INFO L244 Elim1Store]: Index analysis took 115 ms [2020-07-20 17:37:16,269 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 94 [2020-07-20 17:37:16,270 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:37:16,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:16,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:16,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:16,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:16,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:16,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:16,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:16,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:16,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:16,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:16,347 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:37:16,348 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 100 treesize of output 204 [2020-07-20 17:37:16,353 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 17:37:16,588 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2020-07-20 17:37:16,588 INFO L624 ElimStorePlain]: treesize reduction 173, result has 56.8 percent of original size [2020-07-20 17:37:16,591 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-07-20 17:37:16,592 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:225, output treesize:227 [2020-07-20 17:37:16,752 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:16,754 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:17,154 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-07-20 17:37:17,160 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-20 17:37:17,836 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2020-07-20 17:37:17,837 INFO L350 Elim1Store]: treesize reduction 102, result has 64.7 percent of original size [2020-07-20 17:37:17,838 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 20 case distinctions, treesize of input 116 treesize of output 213 [2020-07-20 17:37:17,844 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 1] term [2020-07-20 17:37:17,845 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 17:37:17,846 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2020-07-20 17:37:17,846 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 17:37:17,847 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-20 17:37:17,847 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 17:37:17,848 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 17:37:17,848 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:17,849 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 17:37:17,850 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:17,850 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 17:37:17,850 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:17,855 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 2, 5, 2, 4, 2, 3, 2, 2, 3, 1] term [2020-07-20 17:37:17,855 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:17,856 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 4, 2, 3, 2, 2, 3, 1] term [2020-07-20 17:37:17,857 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:17,858 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-20 17:37:17,858 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 17:37:17,859 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 17:37:17,860 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:17,860 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 17:37:17,861 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:17,861 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 17:37:17,862 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:17,863 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 2, 3, 1] term [2020-07-20 17:37:17,864 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:17,865 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 2, 3, 1] term [2020-07-20 17:37:17,866 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:17,867 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 17:37:17,867 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:17,868 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 17:37:17,868 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:17,869 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 17:37:17,869 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:17,871 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 3, 1] term [2020-07-20 17:37:17,871 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:17,872 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 1] term [2020-07-20 17:37:17,872 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:17,874 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 17:37:17,874 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:17,875 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 17:37:17,875 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:17,876 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 17:37:17,876 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:17,878 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-20 17:37:17,879 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 17:37:17,880 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 17:37:17,880 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:17,881 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 17:37:17,881 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:17,882 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 17:37:17,882 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:17,884 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[12, 2, 1] term [2020-07-20 17:37:17,884 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:17,885 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 2, 3, 1] term [2020-07-20 17:37:17,886 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 17:37:17,887 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 2, 3, 1] term [2020-07-20 17:37:17,887 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 17:37:17,888 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 1] term [2020-07-20 17:37:17,888 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 17:37:17,889 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2020-07-20 17:37:17,889 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 17:37:17,890 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-20 17:37:17,891 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 17:37:17,891 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 17:37:17,892 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:17,892 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 17:37:17,893 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:17,894 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 17:37:17,894 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:17,896 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 2, 3, 1] term [2020-07-20 17:37:17,896 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 17:37:17,897 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 2, 3, 1] term [2020-07-20 17:37:17,897 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 17:37:17,898 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 2, 3, 1] term [2020-07-20 17:37:17,899 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:17,900 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 3, 1] term [2020-07-20 17:37:17,900 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:17,901 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 1] term [2020-07-20 17:37:17,901 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:17,904 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 1] term [2020-07-20 17:37:17,904 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 17:37:17,905 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2020-07-20 17:37:17,905 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 17:37:17,906 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-20 17:37:17,906 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 17:37:17,907 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 17:37:17,908 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:17,908 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 17:37:17,909 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:17,909 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 17:37:17,909 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:17,912 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 4, 2, 3, 2, 3, 3, 2, 3, 1] term [2020-07-20 17:37:17,912 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:17,914 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 2, 3, 2, 3, 3, 2, 3, 1] term [2020-07-20 17:37:17,915 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:17,917 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 2, 3, 2, 3, 3, 2, 3, 1] term [2020-07-20 17:37:17,918 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:17,921 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 3, 1] term [2020-07-20 17:37:17,922 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:17,922 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 1] term [2020-07-20 17:37:17,923 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:17,924 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 17:37:17,924 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:17,925 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 17:37:17,925 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:17,953 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:37:18,315 WARN L193 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 369 DAG size of output: 15 [2020-07-20 17:37:18,316 INFO L624 ElimStorePlain]: treesize reduction 4090, result has 0.4 percent of original size [2020-07-20 17:37:18,317 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:37:18,317 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:129, output treesize:7 [2020-07-20 17:37:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 17:37:18,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 17:37:18,574 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:37:20,828 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (or (= 1 (select (let ((.cse4 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* main_~i~0 8))) (let ((.cse2 (select .cse4 (+ c_main_~b~0.offset .cse1 (- 8)))) (.cse3 (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset (- 8))))) (let ((.cse0 (store .cse4 (+ c_main_~b~0.offset .cse1) (+ .cse2 .cse3)))) (store .cse0 (+ c_main_~b~0.offset .cse1 8) (+ .cse2 (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset)) .cse3))))) c_main_~b~0.offset)) (< (+ main_~i~0 2) c_~N~0) (<= c_~N~0 (+ main_~i~0 1)))) is different from false [2020-07-20 17:37:25,178 WARN L193 SmtUtils]: Spent 1.97 s on a formula simplification that was a NOOP. DAG size: 40 [2020-07-20 17:37:27,194 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_7 Int)) (let ((.cse0 (+ v_prenex_7 1))) (or (< c_main_~i~0 .cse0) (< .cse0 c_main_~i~0) (= 1 (select (let ((.cse7 (let ((.cse8 (select |c_#memory_int| c_main_~a~0.base)) (.cse9 (* c_main_~i~0 8))) (store .cse8 (+ .cse9 c_main_~a~0.offset) (+ (select .cse8 (+ .cse9 c_main_~a~0.offset (- 8))) 4))))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base .cse7))) (let ((.cse6 (select .cse4 c_main_~b~0.base)) (.cse2 (* v_prenex_7 8))) (let ((.cse3 (select .cse6 (+ c_main_~b~0.offset .cse2 (- 8)))) (.cse5 (select .cse7 (+ .cse2 c_main_~a~0.offset (- 8))))) (let ((.cse1 (store .cse6 (+ c_main_~b~0.offset .cse2) (+ .cse3 .cse5)))) (store .cse1 (+ c_main_~b~0.offset .cse2 8) (+ .cse3 (select (select (store .cse4 c_main_~b~0.base .cse1) c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset)) .cse5))))))) c_main_~b~0.offset))))) is different from false [2020-07-20 17:37:29,217 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_7 Int)) (or (< c_main_~i~0 v_prenex_7) (= 1 (select (let ((.cse6 (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* c_main_~i~0 8))) (store .cse7 (+ .cse8 c_main_~a~0.offset 8) (+ (select .cse7 (+ .cse8 c_main_~a~0.offset)) 4))))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base .cse6))) (let ((.cse5 (select .cse4 c_main_~b~0.base)) (.cse1 (* v_prenex_7 8))) (let ((.cse2 (select .cse5 (+ c_main_~b~0.offset .cse1 (- 8)))) (.cse3 (select .cse6 (+ .cse1 c_main_~a~0.offset (- 8))))) (let ((.cse0 (store .cse5 (+ c_main_~b~0.offset .cse1) (+ .cse2 .cse3)))) (store .cse0 (+ c_main_~b~0.offset .cse1 8) (+ .cse2 .cse3 (select (select (store .cse4 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset))))))))) c_main_~b~0.offset)) (< v_prenex_7 c_main_~i~0))) is different from false [2020-07-20 17:37:31,263 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_7 Int)) (or (< c_main_~i~0 v_prenex_7) (< v_prenex_7 c_main_~i~0) (= 1 (select (let ((.cse6 (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* c_main_~i~0 8))) (let ((.cse9 (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))))) (store (store .cse7 (+ .cse8 c_main_~a~0.offset) (+ .cse9 4)) (+ .cse8 c_main_~a~0.offset 8) (+ .cse9 8)))))) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base .cse6))) (let ((.cse5 (select .cse3 c_main_~b~0.base)) (.cse1 (* v_prenex_7 8))) (let ((.cse2 (select .cse6 (+ .cse1 c_main_~a~0.offset (- 8)))) (.cse4 (select .cse5 (+ c_main_~b~0.offset .cse1 (- 8))))) (let ((.cse0 (store .cse5 (+ c_main_~b~0.offset .cse1) (+ .cse2 .cse4)))) (store .cse0 (+ c_main_~b~0.offset .cse1 8) (+ .cse2 (select (select (store .cse3 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset)) .cse4))))))) c_main_~b~0.offset)))) is different from false [2020-07-20 17:37:31,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2020-07-20 17:37:31,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [999376307] [2020-07-20 17:37:31,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 17:37:31,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2020-07-20 17:37:31,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770091141] [2020-07-20 17:37:31,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-07-20 17:37:31,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:37:31,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-07-20 17:37:31,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=531, Unknown=5, NotChecked=204, Total=870 [2020-07-20 17:37:31,310 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 30 states. [2020-07-20 17:37:33,363 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_7 Int)) (or (< c_main_~i~0 v_prenex_7) (< v_prenex_7 c_main_~i~0) (= 1 (select (let ((.cse6 (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* c_main_~i~0 8))) (let ((.cse9 (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))))) (store (store .cse7 (+ .cse8 c_main_~a~0.offset) (+ .cse9 4)) (+ .cse8 c_main_~a~0.offset 8) (+ .cse9 8)))))) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base .cse6))) (let ((.cse5 (select .cse3 c_main_~b~0.base)) (.cse1 (* v_prenex_7 8))) (let ((.cse2 (select .cse6 (+ .cse1 c_main_~a~0.offset (- 8)))) (.cse4 (select .cse5 (+ c_main_~b~0.offset .cse1 (- 8))))) (let ((.cse0 (store .cse5 (+ c_main_~b~0.offset .cse1) (+ .cse2 .cse4)))) (store .cse0 (+ c_main_~b~0.offset .cse1 8) (+ .cse2 (select (select (store .cse3 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset)) .cse4))))))) c_main_~b~0.offset)))) (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (= 1 c_main_~i~0) (= 8 (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset)) (not (= c_main_~a~0.base c_main_~b~0.base))) is different from false [2020-07-20 17:37:34,990 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| c_main_~a~0.base))) (and (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (= 1 c_main_~i~0) (forall ((v_prenex_7 Int)) (or (< c_main_~i~0 v_prenex_7) (= 1 (select (let ((.cse6 (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* c_main_~i~0 8))) (store .cse7 (+ .cse8 c_main_~a~0.offset 8) (+ (select .cse7 (+ .cse8 c_main_~a~0.offset)) 4))))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base .cse6))) (let ((.cse5 (select .cse4 c_main_~b~0.base)) (.cse1 (* v_prenex_7 8))) (let ((.cse2 (select .cse5 (+ c_main_~b~0.offset .cse1 (- 8)))) (.cse3 (select .cse6 (+ .cse1 c_main_~a~0.offset (- 8))))) (let ((.cse0 (store .cse5 (+ c_main_~b~0.offset .cse1) (+ .cse2 .cse3)))) (store .cse0 (+ c_main_~b~0.offset .cse1 8) (+ .cse2 .cse3 (select (select (store .cse4 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset))))))))) c_main_~b~0.offset)) (< v_prenex_7 c_main_~i~0))) (= 8 (select .cse9 c_main_~a~0.offset)) (not (= c_main_~a~0.base c_main_~b~0.base)) (let ((.cse10 (* c_main_~i~0 8))) (= (+ (select .cse9 (+ .cse10 c_main_~a~0.offset (- 8))) 4) (select .cse9 (+ .cse10 c_main_~a~0.offset)))))) is different from false [2020-07-20 17:37:36,625 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| c_main_~a~0.base))) (and (= 2 c_main_~i~0) (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (forall ((v_prenex_7 Int)) (let ((.cse0 (+ v_prenex_7 1))) (or (< c_main_~i~0 .cse0) (< .cse0 c_main_~i~0) (= 1 (select (let ((.cse7 (let ((.cse8 (select |c_#memory_int| c_main_~a~0.base)) (.cse9 (* c_main_~i~0 8))) (store .cse8 (+ .cse9 c_main_~a~0.offset) (+ (select .cse8 (+ .cse9 c_main_~a~0.offset (- 8))) 4))))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base .cse7))) (let ((.cse6 (select .cse4 c_main_~b~0.base)) (.cse2 (* v_prenex_7 8))) (let ((.cse3 (select .cse6 (+ c_main_~b~0.offset .cse2 (- 8)))) (.cse5 (select .cse7 (+ .cse2 c_main_~a~0.offset (- 8))))) (let ((.cse1 (store .cse6 (+ c_main_~b~0.offset .cse2) (+ .cse3 .cse5)))) (store .cse1 (+ c_main_~b~0.offset .cse2 8) (+ .cse3 (select (select (store .cse4 c_main_~b~0.base .cse1) c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset)) .cse5))))))) c_main_~b~0.offset))))) (= 8 (select .cse10 c_main_~a~0.offset)) (let ((.cse11 (* c_main_~i~0 8))) (= (select .cse10 (+ .cse11 c_main_~a~0.offset (- 8))) (+ (select .cse10 (+ .cse11 c_main_~a~0.offset (- 16))) 4))) (not (= c_main_~a~0.base c_main_~b~0.base)))) is different from false [2020-07-20 17:37:40,954 WARN L193 SmtUtils]: Spent 4.10 s on a formula simplification that was a NOOP. DAG size: 43 [2020-07-20 17:37:43,006 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse0 (select .cse1 (+ c_main_~a~0.offset 8))) (.cse2 (select .cse1 c_main_~a~0.offset))) (and (= (+ .cse0 4) (select .cse1 (+ c_main_~a~0.offset 16))) (<= c_main_~i~0 3) (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (<= c_~N~0 3) (< 2 c_~N~0) (= 8 .cse2) (= .cse0 (+ .cse2 4)) (not (= c_main_~a~0.base c_main_~b~0.base)) (forall ((main_~i~0 Int)) (or (= 1 (select (let ((.cse7 (select |c_#memory_int| c_main_~b~0.base)) (.cse4 (* main_~i~0 8))) (let ((.cse5 (select .cse7 (+ c_main_~b~0.offset .cse4 (- 8)))) (.cse6 (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset (- 8))))) (let ((.cse3 (store .cse7 (+ c_main_~b~0.offset .cse4) (+ .cse5 .cse6)))) (store .cse3 (+ c_main_~b~0.offset .cse4 8) (+ .cse5 (select (select (store |c_#memory_int| c_main_~b~0.base .cse3) c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset)) .cse6))))) c_main_~b~0.offset)) (< (+ main_~i~0 2) c_~N~0) (<= c_~N~0 (+ main_~i~0 1))))))) is different from false [2020-07-20 17:37:51,457 WARN L193 SmtUtils]: Spent 8.26 s on a formula simplification that was a NOOP. DAG size: 67 [2020-07-20 17:37:53,493 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse0 (select .cse1 (+ c_main_~a~0.offset 8))) (.cse2 (select .cse1 c_main_~a~0.offset))) (and (= (+ .cse0 4) (select .cse1 (+ c_main_~a~0.offset 16))) (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (<= c_~N~0 3) (< 2 c_~N~0) (= 8 .cse2) (= .cse0 (+ .cse2 4)) (not (= c_main_~a~0.base c_main_~b~0.base)) (forall ((main_~i~0 Int)) (or (= 1 (select (let ((.cse7 (select |c_#memory_int| c_main_~b~0.base)) (.cse4 (* main_~i~0 8))) (let ((.cse5 (select .cse7 (+ c_main_~b~0.offset .cse4 (- 8)))) (.cse6 (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset (- 8))))) (let ((.cse3 (store .cse7 (+ c_main_~b~0.offset .cse4) (+ .cse5 .cse6)))) (store .cse3 (+ c_main_~b~0.offset .cse4 8) (+ .cse5 (select (select (store |c_#memory_int| c_main_~b~0.base .cse3) c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset)) .cse6))))) c_main_~b~0.offset)) (< (+ main_~i~0 2) c_~N~0) (<= c_~N~0 (+ main_~i~0 1))))))) is different from false [2020-07-20 17:37:57,739 WARN L193 SmtUtils]: Spent 4.10 s on a formula simplification that was a NOOP. DAG size: 56 [2020-07-20 17:38:03,962 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_prenex_7 Int)) (or (= 1 (select (let ((.cse4 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* v_prenex_7 8))) (let ((.cse2 (select .cse4 (+ c_main_~b~0.offset .cse1 (- 8)))) (.cse3 (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset (- 8))))) (let ((.cse0 (store .cse4 (+ c_main_~b~0.offset .cse1) (+ .cse2 .cse3)))) (store .cse0 (+ c_main_~b~0.offset .cse1 8) (+ .cse2 (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset)) .cse3))))) c_main_~b~0.offset)) (<= c_~N~0 (+ v_prenex_7 1)) (< (+ v_prenex_7 2) c_~N~0))) (< c_main_~i~0 c_~N~0)) (forall ((main_~i~0 Int)) (or (= 1 (select (let ((.cse9 (select |c_#memory_int| c_main_~b~0.base)) (.cse6 (* main_~i~0 8))) (let ((.cse7 (select .cse9 (+ c_main_~b~0.offset .cse6 (- 8)))) (.cse8 (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse6 c_main_~a~0.offset (- 8))))) (let ((.cse5 (store .cse9 (+ c_main_~b~0.offset .cse6) (+ .cse7 .cse8)))) (store .cse5 (+ c_main_~b~0.offset .cse6 8) (+ .cse7 (select (select (store |c_#memory_int| c_main_~b~0.base .cse5) c_main_~a~0.base) (+ .cse6 c_main_~a~0.offset)) .cse8))))) c_main_~b~0.offset)) (< (+ main_~i~0 2) c_~N~0) (<= c_~N~0 (+ main_~i~0 1)))) (or (<= c_~N~0 c_main_~i~0) (< (+ c_main_~i~0 1) c_~N~0) (= 1 (select (let ((.cse10 (select |c_#memory_int| c_main_~b~0.base)) (.cse11 (* c_main_~i~0 8))) (store .cse10 (+ c_main_~b~0.offset .cse11) (+ (select .cse10 (+ c_main_~b~0.offset .cse11 (- 8))) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse11 c_main_~a~0.offset (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-20 17:38:04,422 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2020-07-20 17:38:08,796 WARN L193 SmtUtils]: Spent 4.14 s on a formula simplification that was a NOOP. DAG size: 58 [2020-07-20 17:38:23,170 WARN L193 SmtUtils]: Spent 8.67 s on a formula simplification. DAG size of input: 172 DAG size of output: 79 [2020-07-20 17:38:27,648 WARN L193 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 45 [2020-07-20 17:38:33,003 WARN L193 SmtUtils]: Spent 4.37 s on a formula simplification. DAG size of input: 162 DAG size of output: 55 [2020-07-20 17:38:37,830 WARN L193 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 164 DAG size of output: 57 [2020-07-20 17:38:40,773 WARN L193 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 62 [2020-07-20 17:38:43,164 WARN L193 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 64 [2020-07-20 17:38:57,098 WARN L193 SmtUtils]: Spent 8.92 s on a formula simplification that was a NOOP. DAG size: 103 [2020-07-20 17:39:03,267 WARN L193 SmtUtils]: Spent 4.39 s on a formula simplification that was a NOOP. DAG size: 92 [2020-07-20 17:39:06,764 WARN L193 SmtUtils]: Spent 2.17 s on a formula simplification that was a NOOP. DAG size: 78 [2020-07-20 17:39:09,007 WARN L193 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 42 [2020-07-20 17:39:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:39:09,472 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2020-07-20 17:39:09,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-07-20 17:39:09,479 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2020-07-20 17:39:09,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:39:09,480 INFO L225 Difference]: With dead ends: 109 [2020-07-20 17:39:09,480 INFO L226 Difference]: Without dead ends: 107 [2020-07-20 17:39:09,482 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 95.3s TimeCoverageRelationStatistics Valid=509, Invalid=1775, Unknown=12, NotChecked=1010, Total=3306 [2020-07-20 17:39:09,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-07-20 17:39:09,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 58. [2020-07-20 17:39:09,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-20 17:39:09,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2020-07-20 17:39:09,496 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 30 [2020-07-20 17:39:09,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:39:09,496 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2020-07-20 17:39:09,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-07-20 17:39:09,496 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2020-07-20 17:39:09,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-20 17:39:09,497 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:39:09,497 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 17:39:09,701 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:39:09,702 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:39:09,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:39:09,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1619571715, now seen corresponding path program 4 times [2020-07-20 17:39:09,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:39:09,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [367817473] [2020-07-20 17:39:09,704 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:39:09,782 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 17:39:09,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:39:09,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 17:39:09,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:39:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-20 17:39:09,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 17:39:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-20 17:39:09,882 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [367817473] [2020-07-20 17:39:09,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 17:39:09,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-20 17:39:09,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384540662] [2020-07-20 17:39:09,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 17:39:09,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:39:09,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 17:39:09,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-20 17:39:09,884 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 9 states. [2020-07-20 17:39:10,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:39:10,294 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2020-07-20 17:39:10,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 17:39:10,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-07-20 17:39:10,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:39:10,298 INFO L225 Difference]: With dead ends: 104 [2020-07-20 17:39:10,298 INFO L226 Difference]: Without dead ends: 86 [2020-07-20 17:39:10,299 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2020-07-20 17:39:10,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-20 17:39:10,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2020-07-20 17:39:10,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-20 17:39:10,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2020-07-20 17:39:10,311 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 30 [2020-07-20 17:39:10,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:39:10,312 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2020-07-20 17:39:10,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 17:39:10,312 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2020-07-20 17:39:10,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-20 17:39:10,313 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:39:10,313 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 17:39:10,527 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:39:10,528 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:39:10,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:39:10,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1718620161, now seen corresponding path program 5 times [2020-07-20 17:39:10,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:39:10,529 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1497137437] [2020-07-20 17:39:10,530 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:39:10,662 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 17:39:10,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:39:10,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 17:39:10,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:39:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 17:39:10,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 17:39:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 17:39:10,834 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1497137437] [2020-07-20 17:39:10,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 17:39:10,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2020-07-20 17:39:10,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333061714] [2020-07-20 17:39:10,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 17:39:10,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:39:10,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 17:39:10,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-07-20 17:39:10,836 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 12 states. [2020-07-20 17:39:11,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:39:11,512 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2020-07-20 17:39:11,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-20 17:39:11,513 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2020-07-20 17:39:11,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:39:11,515 INFO L225 Difference]: With dead ends: 117 [2020-07-20 17:39:11,515 INFO L226 Difference]: Without dead ends: 101 [2020-07-20 17:39:11,516 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2020-07-20 17:39:11,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-20 17:39:11,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 69. [2020-07-20 17:39:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-20 17:39:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2020-07-20 17:39:11,532 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 32 [2020-07-20 17:39:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:39:11,533 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2020-07-20 17:39:11,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 17:39:11,533 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2020-07-20 17:39:11,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-20 17:39:11,535 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:39:11,535 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 17:39:11,749 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:39:11,750 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:39:11,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:39:11,750 INFO L82 PathProgramCache]: Analyzing trace with hash 890841693, now seen corresponding path program 1 times [2020-07-20 17:39:11,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:39:11,751 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1114516796] [2020-07-20 17:39:11,751 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:39:11,813 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 17:39:11,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-20 17:39:11,813 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 17:39:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 17:39:11,830 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 17:39:11,854 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-20 17:39:11,855 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 17:39:12,066 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:39:12,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 05:39:12 BoogieIcfgContainer [2020-07-20 17:39:12,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 17:39:12,150 INFO L168 Benchmark]: Toolchain (without parser) took 142773.35 ms. Allocated memory was 145.8 MB in the beginning and 282.1 MB in the end (delta: 136.3 MB). Free memory was 102.8 MB in the beginning and 176.4 MB in the end (delta: -73.5 MB). Peak memory consumption was 62.8 MB. Max. memory is 7.1 GB. [2020-07-20 17:39:12,150 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 145.8 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-20 17:39:12,151 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.91 ms. Allocated memory is still 145.8 MB. Free memory was 102.4 MB in the beginning and 91.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-20 17:39:12,151 INFO L168 Benchmark]: Boogie Preprocessor took 135.10 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 91.7 MB in the beginning and 181.0 MB in the end (delta: -89.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-20 17:39:12,152 INFO L168 Benchmark]: RCFGBuilder took 441.83 ms. Allocated memory is still 203.9 MB. Free memory was 181.0 MB in the beginning and 164.6 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. [2020-07-20 17:39:12,158 INFO L168 Benchmark]: TraceAbstraction took 141889.87 ms. Allocated memory was 203.9 MB in the beginning and 282.1 MB in the end (delta: 78.1 MB). Free memory was 164.0 MB in the beginning and 176.4 MB in the end (delta: -12.4 MB). Peak memory consumption was 65.7 MB. Max. memory is 7.1 GB. [2020-07-20 17:39:12,160 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.26 ms. Allocated memory is still 145.8 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 296.91 ms. Allocated memory is still 145.8 MB. Free memory was 102.4 MB in the beginning and 91.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.10 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 91.7 MB in the beginning and 181.0 MB in the end (delta: -89.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 441.83 ms. Allocated memory is still 203.9 MB. Free memory was 181.0 MB in the beginning and 164.6 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 141889.87 ms. Allocated memory was 203.9 MB in the beginning and 282.1 MB in the end (delta: 78.1 MB). Free memory was 164.0 MB in the beginning and 176.4 MB in the end (delta: -12.4 MB). Peak memory consumption was 65.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=4, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=2] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=2] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=2] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=2] [L25] int i; [L26] long long *a = malloc(sizeof(long long)*N); [L27] long long *b = malloc(sizeof(long long)*N); [L29] a[0] = 8 [L30] b[0] = 1 [L32] i=1 VAL [\old(N)=0, a={-2:0}, b={-1:0}, i=1, malloc(sizeof(long long)*N)={-1:0}, malloc(sizeof(long long)*N)={-2:0}, N=2] [L32] COND TRUE i