./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/test22-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/test22-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash efd11941ceab8dc56d9aa56f1950f714738654ba .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 16:57:35,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:57:35,028 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:57:35,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:57:35,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:57:35,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:57:35,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:57:35,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:57:35,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:57:35,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:57:35,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:57:35,052 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:57:35,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:57:35,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:57:35,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:57:35,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:57:35,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:57:35,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:57:35,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:57:35,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:57:35,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:57:35,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:57:35,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:57:35,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:57:35,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:57:35,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:57:35,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:57:35,075 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:57:35,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:57:35,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:57:35,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:57:35,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:57:35,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:57:35,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:57:35,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:57:35,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:57:35,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:57:35,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:57:35,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:57:35,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:57:35,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:57:35,095 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 16:57:35,118 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:57:35,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:57:35,120 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:57:35,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:57:35,121 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:57:35,121 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:57:35,122 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:57:35,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 16:57:35,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:57:35,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:57:35,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:57:35,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:57:35,124 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:57:35,124 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:57:35,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:57:35,125 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:57:35,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:57:35,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:57:35,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:57:35,126 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:57:35,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:57:35,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:57:35,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:57:35,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:57:35,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:57:35,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 16:57:35,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 16:57:35,129 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:57:35,129 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:57:35,129 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> efd11941ceab8dc56d9aa56f1950f714738654ba [2019-11-28 16:57:35,443 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:57:35,458 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:57:35,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:57:35,467 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:57:35,468 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:57:35,468 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test22-1.c [2019-11-28 16:57:35,540 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e741f40d/0e55a4fff88240abb40a5dda30896c7a/FLAGe8f166211 [2019-11-28 16:57:36,012 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:57:36,013 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-1.c [2019-11-28 16:57:36,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e741f40d/0e55a4fff88240abb40a5dda30896c7a/FLAGe8f166211 [2019-11-28 16:57:36,370 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e741f40d/0e55a4fff88240abb40a5dda30896c7a [2019-11-28 16:57:36,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:57:36,376 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:57:36,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:57:36,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:57:36,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:57:36,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:57:36" (1/1) ... [2019-11-28 16:57:36,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b847048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:36, skipping insertion in model container [2019-11-28 16:57:36,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:57:36" (1/1) ... [2019-11-28 16:57:36,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:57:36,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:57:36,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:57:36,638 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:57:36,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:57:36,679 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:57:36,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:36 WrapperNode [2019-11-28 16:57:36,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:57:36,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:57:36,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:57:36,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:57:36,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:36" (1/1) ... [2019-11-28 16:57:36,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:36" (1/1) ... [2019-11-28 16:57:36,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:57:36,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:57:36,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:57:36,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:57:36,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:36" (1/1) ... [2019-11-28 16:57:36,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:36" (1/1) ... [2019-11-28 16:57:36,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:36" (1/1) ... [2019-11-28 16:57:36,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:36" (1/1) ... [2019-11-28 16:57:36,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:36" (1/1) ... [2019-11-28 16:57:36,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:36" (1/1) ... [2019-11-28 16:57:36,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:36" (1/1) ... [2019-11-28 16:57:36,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:57:36,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:57:36,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:57:36,811 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:57:36,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:57:36,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 16:57:36,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 16:57:36,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 16:57:36,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:57:36,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:57:36,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 16:57:37,182 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:57:37,182 INFO L287 CfgBuilder]: Removed 15 assume(true) statements. [2019-11-28 16:57:37,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:57:37 BoogieIcfgContainer [2019-11-28 16:57:37,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:57:37,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:57:37,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:57:37,192 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:57:37,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:57:36" (1/3) ... [2019-11-28 16:57:37,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3165884b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:57:37, skipping insertion in model container [2019-11-28 16:57:37,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:36" (2/3) ... [2019-11-28 16:57:37,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3165884b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:57:37, skipping insertion in model container [2019-11-28 16:57:37,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:57:37" (3/3) ... [2019-11-28 16:57:37,197 INFO L109 eAbstractionObserver]: Analyzing ICFG test22-1.c [2019-11-28 16:57:37,208 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:57:37,216 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 16:57:37,246 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 16:57:37,269 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:57:37,269 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:57:37,270 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:57:37,270 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:57:37,270 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:57:37,270 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:57:37,270 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:57:37,270 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:57:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-11-28 16:57:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 16:57:37,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:37,291 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:57:37,292 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:37,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:37,297 INFO L82 PathProgramCache]: Analyzing trace with hash 164664103, now seen corresponding path program 1 times [2019-11-28 16:57:37,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:37,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627178976] [2019-11-28 16:57:37,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:57:37,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627178976] [2019-11-28 16:57:37,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:57:37,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 16:57:37,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282988213] [2019-11-28 16:57:37,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 16:57:37,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:37,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 16:57:37,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:57:37,543 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-11-28 16:57:37,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:37,558 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2019-11-28 16:57:37,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 16:57:37,560 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-11-28 16:57:37,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:37,568 INFO L225 Difference]: With dead ends: 34 [2019-11-28 16:57:37,568 INFO L226 Difference]: Without dead ends: 21 [2019-11-28 16:57:37,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:57:37,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-28 16:57:37,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-28 16:57:37,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 16:57:37,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-28 16:57:37,600 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 19 [2019-11-28 16:57:37,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:37,601 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-28 16:57:37,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 16:57:37,601 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-28 16:57:37,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 16:57:37,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:37,602 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:57:37,603 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:37,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:37,603 INFO L82 PathProgramCache]: Analyzing trace with hash 603612068, now seen corresponding path program 1 times [2019-11-28 16:57:37,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:37,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151842861] [2019-11-28 16:57:37,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:37,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:57:37,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151842861] [2019-11-28 16:57:37,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:57:37,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 16:57:37,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768185701] [2019-11-28 16:57:37,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 16:57:37,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:37,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 16:57:37,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-28 16:57:37,903 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2019-11-28 16:57:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:38,550 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2019-11-28 16:57:38,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 16:57:38,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-28 16:57:38,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:38,554 INFO L225 Difference]: With dead ends: 96 [2019-11-28 16:57:38,555 INFO L226 Difference]: Without dead ends: 91 [2019-11-28 16:57:38,558 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2019-11-28 16:57:38,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-28 16:57:38,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 33. [2019-11-28 16:57:38,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 16:57:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-11-28 16:57:38,582 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 20 [2019-11-28 16:57:38,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:38,583 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-11-28 16:57:38,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 16:57:38,583 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-11-28 16:57:38,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 16:57:38,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:38,585 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:57:38,585 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:38,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:38,586 INFO L82 PathProgramCache]: Analyzing trace with hash -407505182, now seen corresponding path program 1 times [2019-11-28 16:57:38,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:38,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027781176] [2019-11-28 16:57:38,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:38,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:57:38,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027781176] [2019-11-28 16:57:38,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:57:38,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 16:57:38,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311079514] [2019-11-28 16:57:38,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 16:57:38,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:38,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 16:57:38,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-28 16:57:38,779 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 10 states. [2019-11-28 16:57:39,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:39,219 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2019-11-28 16:57:39,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 16:57:39,220 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-28 16:57:39,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:39,221 INFO L225 Difference]: With dead ends: 91 [2019-11-28 16:57:39,222 INFO L226 Difference]: Without dead ends: 66 [2019-11-28 16:57:39,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2019-11-28 16:57:39,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-28 16:57:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 33. [2019-11-28 16:57:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 16:57:39,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-28 16:57:39,242 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2019-11-28 16:57:39,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:39,243 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-28 16:57:39,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 16:57:39,243 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-28 16:57:39,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 16:57:39,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:39,246 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:57:39,246 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:39,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:39,247 INFO L82 PathProgramCache]: Analyzing trace with hash -984735834, now seen corresponding path program 1 times [2019-11-28 16:57:39,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:39,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485324677] [2019-11-28 16:57:39,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:57:39,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485324677] [2019-11-28 16:57:39,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:57:39,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 16:57:39,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405114814] [2019-11-28 16:57:39,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 16:57:39,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:39,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 16:57:39,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-28 16:57:39,405 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 10 states. [2019-11-28 16:57:39,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:39,803 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2019-11-28 16:57:39,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 16:57:39,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-28 16:57:39,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:39,807 INFO L225 Difference]: With dead ends: 81 [2019-11-28 16:57:39,807 INFO L226 Difference]: Without dead ends: 64 [2019-11-28 16:57:39,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2019-11-28 16:57:39,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-28 16:57:39,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 33. [2019-11-28 16:57:39,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 16:57:39,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-11-28 16:57:39,820 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 20 [2019-11-28 16:57:39,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:39,821 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-11-28 16:57:39,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 16:57:39,821 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-11-28 16:57:39,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 16:57:39,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:39,822 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:57:39,822 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:39,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:39,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1995853084, now seen corresponding path program 1 times [2019-11-28 16:57:39,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:39,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726446664] [2019-11-28 16:57:39,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:57:40,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726446664] [2019-11-28 16:57:40,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:57:40,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 16:57:40,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176134406] [2019-11-28 16:57:40,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 16:57:40,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:40,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 16:57:40,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-28 16:57:40,027 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 10 states. [2019-11-28 16:57:40,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:40,535 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-11-28 16:57:40,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 16:57:40,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-28 16:57:40,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:40,537 INFO L225 Difference]: With dead ends: 73 [2019-11-28 16:57:40,537 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 16:57:40,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2019-11-28 16:57:40,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 16:57:40,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 26. [2019-11-28 16:57:40,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 16:57:40,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-11-28 16:57:40,545 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 20 [2019-11-28 16:57:40,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:40,545 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-28 16:57:40,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 16:57:40,546 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-11-28 16:57:40,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 16:57:40,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:40,547 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:57:40,547 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:40,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:40,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1760411593, now seen corresponding path program 1 times [2019-11-28 16:57:40,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:40,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802028499] [2019-11-28 16:57:40,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:57:40,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802028499] [2019-11-28 16:57:40,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693514739] [2019-11-28 16:57:40,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:57:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:40,855 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 16:57:40,862 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:57:41,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:57:41,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-28 16:57:41,202 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:57:41,207 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-28 16:57:41,208 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:57:41,221 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:57:41,223 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:57:41,223 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-11-28 16:57:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:57:41,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:57:41,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2019-11-28 16:57:41,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792433527] [2019-11-28 16:57:41,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-28 16:57:41,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:41,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 16:57:41,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-11-28 16:57:41,230 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 22 states. [2019-11-28 16:57:42,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:42,279 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-11-28 16:57:42,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 16:57:42,281 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-11-28 16:57:42,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:42,282 INFO L225 Difference]: With dead ends: 77 [2019-11-28 16:57:42,282 INFO L226 Difference]: Without dead ends: 72 [2019-11-28 16:57:42,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=297, Invalid=1185, Unknown=0, NotChecked=0, Total=1482 [2019-11-28 16:57:42,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-28 16:57:42,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 35. [2019-11-28 16:57:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 16:57:42,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-11-28 16:57:42,292 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 22 [2019-11-28 16:57:42,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:42,293 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-11-28 16:57:42,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-28 16:57:42,293 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-11-28 16:57:42,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 16:57:42,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:42,294 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:57:42,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:57:42,508 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:42,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:42,508 INFO L82 PathProgramCache]: Analyzing trace with hash -949600503, now seen corresponding path program 1 times [2019-11-28 16:57:42,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:42,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658493104] [2019-11-28 16:57:42,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:57:42,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658493104] [2019-11-28 16:57:42,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266061678] [2019-11-28 16:57:42,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:57:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:42,793 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 16:57:42,800 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:57:43,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:57:43,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-28 16:57:43,203 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:57:43,208 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-28 16:57:43,209 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:57:43,218 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:57:43,219 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:57:43,219 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-11-28 16:57:43,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:57:43,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:57:43,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2019-11-28 16:57:43,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893500093] [2019-11-28 16:57:43,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-28 16:57:43,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:43,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 16:57:43,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-11-28 16:57:43,225 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 22 states. [2019-11-28 16:57:44,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:44,506 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2019-11-28 16:57:44,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 16:57:44,507 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-11-28 16:57:44,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:44,508 INFO L225 Difference]: With dead ends: 81 [2019-11-28 16:57:44,508 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 16:57:44,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=297, Invalid=1185, Unknown=0, NotChecked=0, Total=1482 [2019-11-28 16:57:44,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 16:57:44,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 28. [2019-11-28 16:57:44,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 16:57:44,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-28 16:57:44,515 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2019-11-28 16:57:44,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:44,515 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-28 16:57:44,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-28 16:57:44,519 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-28 16:57:44,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 16:57:44,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:44,520 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:57:44,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:57:44,721 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:44,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:44,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1048225454, now seen corresponding path program 2 times [2019-11-28 16:57:44,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:44,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158646378] [2019-11-28 16:57:44,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:44,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:57:44,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158646378] [2019-11-28 16:57:44,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291406484] [2019-11-28 16:57:44,924 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:57:44,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 16:57:44,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 16:57:44,983 INFO L264 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-28 16:57:44,985 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:57:45,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:57:45,246 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-28 16:57:45,246 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:57:45,249 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-28 16:57:45,250 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:57:45,259 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:57:45,260 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:57:45,260 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-11-28 16:57:45,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:57:45,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:57:45,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-11-28 16:57:45,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740326809] [2019-11-28 16:57:45,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 16:57:45,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:45,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 16:57:45,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2019-11-28 16:57:45,265 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 24 states. [2019-11-28 16:57:46,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:46,642 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2019-11-28 16:57:46,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-28 16:57:46,642 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-11-28 16:57:46,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:46,643 INFO L225 Difference]: With dead ends: 85 [2019-11-28 16:57:46,644 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 16:57:46,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=408, Invalid=1572, Unknown=0, NotChecked=0, Total=1980 [2019-11-28 16:57:46,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 16:57:46,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 37. [2019-11-28 16:57:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 16:57:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-11-28 16:57:46,654 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 24 [2019-11-28 16:57:46,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:46,655 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-11-28 16:57:46,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 16:57:46,655 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-11-28 16:57:46,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 16:57:46,656 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:46,656 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:57:46,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:57:46,867 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:46,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:46,868 INFO L82 PathProgramCache]: Analyzing trace with hash -523217426, now seen corresponding path program 2 times [2019-11-28 16:57:46,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:46,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893347957] [2019-11-28 16:57:46,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:47,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:57:47,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893347957] [2019-11-28 16:57:47,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167644579] [2019-11-28 16:57:47,090 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:57:47,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 16:57:47,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 16:57:47,148 INFO L264 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-28 16:57:47,150 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:57:47,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:57:47,438 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-28 16:57:47,438 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:57:47,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-28 16:57:47,443 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:57:47,453 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:57:47,453 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:57:47,454 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-11-28 16:57:47,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:57:47,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:57:47,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-11-28 16:57:47,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268839428] [2019-11-28 16:57:47,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 16:57:47,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:47,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 16:57:47,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2019-11-28 16:57:47,458 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 24 states. [2019-11-28 16:57:48,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:48,951 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-11-28 16:57:48,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-28 16:57:48,953 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-11-28 16:57:48,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:48,953 INFO L225 Difference]: With dead ends: 89 [2019-11-28 16:57:48,954 INFO L226 Difference]: Without dead ends: 84 [2019-11-28 16:57:48,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=408, Invalid=1572, Unknown=0, NotChecked=0, Total=1980 [2019-11-28 16:57:48,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-28 16:57:48,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 30. [2019-11-28 16:57:48,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 16:57:48,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-28 16:57:48,970 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 24 [2019-11-28 16:57:48,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:48,971 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-28 16:57:48,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 16:57:48,971 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-11-28 16:57:48,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 16:57:48,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:48,974 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:57:49,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:57:49,179 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:49,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:49,180 INFO L82 PathProgramCache]: Analyzing trace with hash -462854061, now seen corresponding path program 3 times [2019-11-28 16:57:49,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:49,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287126765] [2019-11-28 16:57:49,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:49,438 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:57:49,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287126765] [2019-11-28 16:57:49,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440122471] [2019-11-28 16:57:49,438 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:57:49,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 16:57:49,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 16:57:49,496 INFO L264 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-28 16:57:49,498 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:57:49,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:57:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 16:57:49,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:57:49,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2019-11-28 16:57:49,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048708903] [2019-11-28 16:57:49,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-28 16:57:49,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:49,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-28 16:57:49,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2019-11-28 16:57:49,988 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 30 states. [2019-11-28 16:57:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:52,873 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2019-11-28 16:57:52,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-28 16:57:52,873 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 26 [2019-11-28 16:57:52,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:52,874 INFO L225 Difference]: With dead ends: 89 [2019-11-28 16:57:52,874 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 16:57:52,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=866, Invalid=3690, Unknown=0, NotChecked=0, Total=4556 [2019-11-28 16:57:52,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 16:57:52,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 27. [2019-11-28 16:57:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 16:57:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-28 16:57:52,882 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 26 [2019-11-28 16:57:52,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:52,882 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-28 16:57:52,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-28 16:57:52,882 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-28 16:57:52,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 16:57:52,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:52,883 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:57:53,085 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:57:53,086 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:53,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:53,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1209026451, now seen corresponding path program 3 times [2019-11-28 16:57:53,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:53,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50664570] [2019-11-28 16:57:53,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:57:53,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50664570] [2019-11-28 16:57:53,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742682463] [2019-11-28 16:57:53,331 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:57:53,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 16:57:53,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 16:57:53,396 INFO L264 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-28 16:57:53,398 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:57:53,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:57:53,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 16:57:53,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:57:53,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2019-11-28 16:57:53,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293382763] [2019-11-28 16:57:53,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-28 16:57:53,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:53,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-28 16:57:53,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2019-11-28 16:57:53,793 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 30 states. [2019-11-28 16:57:56,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:56,468 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-11-28 16:57:56,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-28 16:57:56,469 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 26 [2019-11-28 16:57:56,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:56,469 INFO L225 Difference]: With dead ends: 49 [2019-11-28 16:57:56,469 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 16:57:56,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=804, Invalid=3356, Unknown=0, NotChecked=0, Total=4160 [2019-11-28 16:57:56,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 16:57:56,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 16:57:56,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 16:57:56,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 16:57:56,472 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-11-28 16:57:56,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:56,473 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 16:57:56,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-28 16:57:56,473 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 16:57:56,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 16:57:56,674 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:57:56,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 16:57:56,831 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 38 [2019-11-28 16:57:56,942 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-11-28 16:57:58,097 WARN L192 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 179 DAG size of output: 155 [2019-11-28 16:57:58,214 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-11-28 16:57:58,657 WARN L192 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 27 [2019-11-28 16:57:59,808 WARN L192 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 154 DAG size of output: 33 [2019-11-28 16:57:59,858 INFO L246 CegarLoopResult]: For program point L35-2(lines 35 44) no Hoare annotation was computed. [2019-11-28 16:57:59,859 INFO L246 CegarLoopResult]: For program point L35-4(lines 35 44) no Hoare annotation was computed. [2019-11-28 16:57:59,859 INFO L242 CegarLoopResult]: At program point L27(lines 25 28) the Hoare annotation is: (let ((.cse10 (select (select |#memory_int| ULTIMATE.start_main_~pd2~0.base) ULTIMATE.start_main_~pd2~0.offset))) (let ((.cse5 (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base)) (.cse0 (<= .cse10 ULTIMATE.start_main_~i~0)) (.cse3 (not (= |~#d1~0.base| |~#d2~0.base|))) (.cse1 (not (= 0 ULTIMATE.start_main_~pd2~0.base))) (.cse2 (<= ULTIMATE.start_main_~i~0 .cse10)) (.cse6 (= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset)) (.cse7 (= 0 |~#d1~0.offset|)) (.cse4 (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pa~0.base)) (.cse8 (= ULTIMATE.start_main_~pa~0.offset ULTIMATE.start_main_~pd2~0.offset)) (.cse9 (= 1 |ULTIMATE.start_check_#res|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |~#d2~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse6 (= 0 ULTIMATE.start_main_~pd1~0.offset) .cse7 .cse8 (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|) .cse9) (and (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|) .cse5 .cse0 .cse3 .cse1 .cse2 .cse6 (= |~#d1~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse7 .cse4 .cse8 .cse9)))) [2019-11-28 16:57:59,859 INFO L246 CegarLoopResult]: For program point L11(lines 11 18) no Hoare annotation was computed. [2019-11-28 16:57:59,859 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 16:57:59,860 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 16:57:59,860 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 16:57:59,860 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2019-11-28 16:57:59,860 INFO L249 CegarLoopResult]: At program point L49(lines 30 50) the Hoare annotation is: true [2019-11-28 16:57:59,860 INFO L246 CegarLoopResult]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-11-28 16:57:59,860 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 16:57:59,861 INFO L242 CegarLoopResult]: At program point L42(lines 31 50) the Hoare annotation is: false [2019-11-28 16:57:59,861 INFO L246 CegarLoopResult]: For program point L38-1(lines 38 40) no Hoare annotation was computed. [2019-11-28 16:57:59,862 INFO L242 CegarLoopResult]: At program point L38-3(lines 38 40) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base)) (.cse1 (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))) (.cse2 (not (= 0 ULTIMATE.start_main_~pd2~0.base))) (.cse3 (not (= |~#d1~0.base| |~#d2~0.base|))) (.cse4 (= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset)) (.cse6 (= 0 |~#d1~0.offset|)) (.cse5 (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pa~0.base)) (.cse7 (= ULTIMATE.start_main_~pa~0.offset ULTIMATE.start_main_~pd2~0.offset))) (or (and .cse0 (= 0 |~#d2~0.offset|) .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_main_~pd1~0.offset) .cse6 .cse7 (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|)) (and (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|) .cse0 .cse1 .cse2 .cse3 .cse4 (= |~#d1~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse6 .cse5 .cse7))) [2019-11-28 16:57:59,862 INFO L246 CegarLoopResult]: For program point L38-4(lines 38 40) no Hoare annotation was computed. [2019-11-28 16:57:59,862 INFO L246 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-28 16:57:59,862 INFO L246 CegarLoopResult]: For program point L22-2(line 22) no Hoare annotation was computed. [2019-11-28 16:57:59,862 INFO L242 CegarLoopResult]: At program point L22-3(lines 20 23) the Hoare annotation is: (let ((.cse0 (= 0 |~#d1~0.offset|)) (.cse1 (= |~#d1~0.base| |ULTIMATE.start_get_dummy_#res.base|))) (or (and (= |~#d2~0.offset| |ULTIMATE.start_get_dummy_#res.offset|) (= |ULTIMATE.start_get_dummy_#res.base| |~#d2~0.base|) (= 0 |~#d2~0.offset|) .cse0 (not .cse1)) (and (not (= |~#d1~0.base| |~#d2~0.base|)) (= |~#d1~0.offset| |ULTIMATE.start_get_dummy_#res.offset|) .cse0 .cse1))) [2019-11-28 16:57:59,863 INFO L246 CegarLoopResult]: For program point L22-4(line 22) no Hoare annotation was computed. [2019-11-28 16:57:59,863 INFO L246 CegarLoopResult]: For program point L22-6(line 22) no Hoare annotation was computed. [2019-11-28 16:57:59,863 INFO L242 CegarLoopResult]: At program point L22-7(lines 20 23) the Hoare annotation is: (let ((.cse0 (not (= |~#d1~0.base| |~#d2~0.base|)))) (or (and (or (and .cse0 (= |~#d1~0.base| |ULTIMATE.start_get_dummy_#res.base|)) (and (= |~#d2~0.offset| |ULTIMATE.start_get_dummy_#res.offset|) (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|) (not (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|)))) (= |ULTIMATE.start_get_dummy_#res.offset| ULTIMATE.start_main_~pd1~0.offset) (= 0 |~#d1~0.offset|) (= 0 ULTIMATE.start_main_~pd1~0.offset)) (and (not (= ULTIMATE.start_main_~pd1~0.base |ULTIMATE.start_get_dummy_#res.base|)) .cse0))) [2019-11-28 16:57:59,863 INFO L246 CegarLoopResult]: For program point L22-8(line 22) no Hoare annotation was computed. [2019-11-28 16:57:59,863 INFO L246 CegarLoopResult]: For program point L22-10(line 22) no Hoare annotation was computed. [2019-11-28 16:57:59,863 INFO L242 CegarLoopResult]: At program point L22-11(lines 20 23) the Hoare annotation is: (let ((.cse0 (not (= |~#d1~0.base| |~#d2~0.base|)))) (or (and .cse0 (not (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base))) (and (let ((.cse2 (= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset)) (.cse1 (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|))) (or (and .cse1 .cse0 .cse2) (and (= |~#d2~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse2 (not .cse1) (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|)))) (= |~#d1~0.offset| ULTIMATE.start_main_~pd1~0.offset) (= 0 |~#d1~0.offset|)))) [2019-11-28 16:57:59,863 INFO L246 CegarLoopResult]: For program point L35(line 35) no Hoare annotation was computed. [2019-11-28 16:57:59,886 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:59,888 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:59,888 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:59,888 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:59,891 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:59,891 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:59,891 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:59,892 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:59,896 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:59,896 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:59,898 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:59,898 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:59,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:57:59 BoogieIcfgContainer [2019-11-28 16:57:59,901 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:57:59,901 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:57:59,901 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:57:59,902 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:57:59,902 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:57:37" (3/4) ... [2019-11-28 16:57:59,906 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 16:57:59,919 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 16:57:59,919 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 16:57:59,920 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 16:57:59,952 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((d2 == \result && \result == d2) && 0 == d2) && 0 == d1) && !(d1 == \result)) || (((!(d1 == d2) && d1 == \result) && 0 == d1) && d1 == \result) [2019-11-28 16:57:59,952 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(d1 == d2) && d1 == \result) || ((d2 == \result && pd1 == d2) && !(pd1 == d1))) && \result == pd1) && 0 == d1) && 0 == pd1) || (!(pd1 == \result) && !(d1 == d2)) [2019-11-28 16:57:59,953 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((unknown-#memory_int-unknown[pd2][pd2] <= i && !(0 == pd2)) && i <= unknown-#memory_int-unknown[pd2][pd2]) && !(d1 == d2)) && pd2 == pa) && pd1 == pd2) && d2 == pd1) && pd2 == pd1) && 0 == pd1) && 0 == d1) && pa == pd2) && pd1 == d2) && 1 == \result) || (((((((((((pd1 == d1 && pd1 == pd2) && unknown-#memory_int-unknown[pd2][pd2] <= i) && !(d1 == d2)) && !(0 == pd2)) && i <= unknown-#memory_int-unknown[pd2][pd2]) && pd2 == pd1) && d1 == pd1) && 0 == d1) && pd2 == pa) && pa == pd2) && 1 == \result) [2019-11-28 16:57:59,987 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 16:57:59,989 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:57:59,990 INFO L168 Benchmark]: Toolchain (without parser) took 23615.49 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 402.1 MB). Free memory was 957.7 MB in the beginning and 842.8 MB in the end (delta: 114.9 MB). Peak memory consumption was 517.0 MB. Max. memory is 11.5 GB. [2019-11-28 16:57:59,993 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:57:59,994 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.72 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 16:57:59,997 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 16:57:59,998 INFO L168 Benchmark]: Boogie Preprocessor took 25.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 16:57:59,998 INFO L168 Benchmark]: RCFGBuilder took 375.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-28 16:57:59,999 INFO L168 Benchmark]: TraceAbstraction took 22712.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 273.7 MB). Free memory was 1.1 GB in the beginning and 842.8 MB in the end (delta: 255.2 MB). Peak memory consumption was 528.9 MB. Max. memory is 11.5 GB. [2019-11-28 16:57:59,999 INFO L168 Benchmark]: Witness Printer took 87.59 ms. Allocated memory is still 1.4 GB. Free memory is still 842.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:58:00,004 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 303.72 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 104.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 375.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22712.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 273.7 MB). Free memory was 1.1 GB in the beginning and 842.8 MB in the end (delta: 255.2 MB). Peak memory consumption was 528.9 MB. Max. memory is 11.5 GB. * Witness Printer took 87.59 ms. Allocated memory is still 1.4 GB. Free memory is still 842.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((!(d1 == d2) && d1 == \result) || ((d2 == \result && pd1 == d2) && !(pd1 == d1))) && \result == pd1) && 0 == d1) && 0 == pd1) || (!(pd1 == \result) && !(d1 == d2)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (!(d1 == d2) && !(pd1 == pd2)) || (((((pd1 == d1 && !(d1 == d2)) && pd2 == pd1) || (((d2 == pd1 && pd2 == pd1) && !(pd1 == d1)) && pd1 == d2)) && d1 == pd1) && 0 == d1) - InvariantResult [Line: 25]: Loop Invariant [2019-11-28 16:58:00,025 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:58:00,027 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:58:00,028 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:58:00,028 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:58:00,029 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:58:00,034 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:58:00,035 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:58:00,035 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((((((unknown-#memory_int-unknown[pd2][pd2] <= i && !(0 == pd2)) && i <= unknown-#memory_int-unknown[pd2][pd2]) && !(d1 == d2)) && pd2 == pa) && pd1 == pd2) && d2 == pd1) && pd2 == pd1) && 0 == pd1) && 0 == d1) && pa == pd2) && pd1 == d2) && 1 == \result) || (((((((((((pd1 == d1 && pd1 == pd2) && unknown-#memory_int-unknown[pd2][pd2] <= i) && !(d1 == d2)) && !(0 == pd2)) && i <= unknown-#memory_int-unknown[pd2][pd2]) && pd2 == pd1) && d1 == pd1) && 0 == d1) && pd2 == pa) && pa == pd2) && 1 == \result) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((d2 == \result && \result == d2) && 0 == d2) && 0 == d1) && !(d1 == \result)) || (((!(d1 == d2) && d1 == \result) && 0 == d1) && d1 == \result) - InvariantResult [Line: 38]: Loop Invariant [2019-11-28 16:58:00,039 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:58:00,041 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:58:00,041 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:58:00,042 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((((pd1 == pd2 && 0 == d2) && i <= unknown-#memory_int-unknown[pa][pa]) && !(0 == pd2)) && !(d1 == d2)) && pd2 == pd1) && pd2 == pa) && 0 == pd1) && 0 == d1) && pa == pd2) && pd1 == d2) || (((((((((pd1 == d1 && pd1 == pd2) && i <= unknown-#memory_int-unknown[pa][pa]) && !(0 == pd2)) && !(d1 == d2)) && pd2 == pd1) && d1 == pd1) && 0 == d1) && pd2 == pa) && pa == pd2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. Result: SAFE, OverallTime: 19.4s, OverallIterations: 11, TraceHistogramMax: 4, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.1s, HoareTripleCheckerStatistics: 276 SDtfs, 1048 SDslu, 2027 SDs, 0 SdLazy, 3238 SolverSat, 413 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2646 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 363 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 43 NumberOfFragments, 293 HoareAnnotationTreeSize, 7 FomulaSimplifications, 6766116 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 573071 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 387 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 370 ConstructedInterpolants, 0 QuantifiedInterpolants, 53785 SizeOfPredicates, 70 NumberOfNonLiveVariables, 764 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 18/80 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...