./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id2_b3_o5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab 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/recursive-simple/id2_b3_o5.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 ceb806ae997f94b7f09b4e2dce31a0e63ff1a329 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:25:35,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:25:35,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:25:35,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:25:35,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:25:35,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:25:35,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:25:35,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:25:35,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:25:35,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:25:35,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:25:35,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:25:35,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:25:35,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:25:35,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:25:35,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:25:35,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:25:35,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:25:35,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:25:35,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:25:35,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:25:35,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:25:35,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:25:35,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:25:35,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:25:35,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:25:35,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:25:35,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:25:35,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:25:35,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:25:35,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:25:35,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:25:35,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:25:35,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:25:35,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:25:35,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:25:35,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:25:35,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:25:35,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:25:35,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:25:35,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:25:35,420 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:25:35,436 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:25:35,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:25:35,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:25:35,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:25:35,438 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:25:35,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:25:35,439 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:25:35,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:25:35,440 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:25:35,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:25:35,440 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:25:35,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:25:35,441 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:25:35,441 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:25:35,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:25:35,442 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:25:35,442 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:25:35,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:25:35,443 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:25:35,443 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:25:35,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:25:35,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:25:35,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:25:35,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:25:35,444 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:25:35,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:25:35,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:25:35,445 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:25:35,446 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 -> ceb806ae997f94b7f09b4e2dce31a0e63ff1a329 [2019-11-28 00:25:35,762 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:25:35,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:25:35,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:25:35,783 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:25:35,783 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:25:35,785 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id2_b3_o5.c [2019-11-28 00:25:35,858 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58a1ec26c/addca15dd7694fe490f97473dca124b4/FLAG8268e1845 [2019-11-28 00:25:36,266 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:25:36,269 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id2_b3_o5.c [2019-11-28 00:25:36,275 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58a1ec26c/addca15dd7694fe490f97473dca124b4/FLAG8268e1845 [2019-11-28 00:25:36,642 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58a1ec26c/addca15dd7694fe490f97473dca124b4 [2019-11-28 00:25:36,645 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:25:36,646 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:25:36,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:25:36,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:25:36,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:25:36,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:36" (1/1) ... [2019-11-28 00:25:36,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19255d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:36, skipping insertion in model container [2019-11-28 00:25:36,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:36" (1/1) ... [2019-11-28 00:25:36,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:25:36,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:25:36,883 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:25:36,887 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:25:36,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:25:36,912 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:25:36,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:36 WrapperNode [2019-11-28 00:25:36,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:25:36,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:25:36,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:25:36,913 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:25:36,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:36" (1/1) ... [2019-11-28 00:25:36,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:36" (1/1) ... [2019-11-28 00:25:36,996 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:25:36,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:25:36,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:25:36,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:25:37,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:36" (1/1) ... [2019-11-28 00:25:37,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:36" (1/1) ... [2019-11-28 00:25:37,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:36" (1/1) ... [2019-11-28 00:25:37,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:36" (1/1) ... [2019-11-28 00:25:37,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:36" (1/1) ... [2019-11-28 00:25:37,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:36" (1/1) ... [2019-11-28 00:25:37,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:36" (1/1) ... [2019-11-28 00:25:37,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:25:37,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:25:37,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:25:37,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:25:37,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25: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 00:25:37,075 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2019-11-28 00:25:37,076 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2019-11-28 00:25:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:25:37,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:25:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-11-28 00:25:37,076 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-11-28 00:25:37,302 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:25:37,302 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:25:37,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:37 BoogieIcfgContainer [2019-11-28 00:25:37,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:25:37,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:25:37,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:25:37,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:25:37,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:25:36" (1/3) ... [2019-11-28 00:25:37,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33cbc1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:25:37, skipping insertion in model container [2019-11-28 00:25:37,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:36" (2/3) ... [2019-11-28 00:25:37,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33cbc1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:25:37, skipping insertion in model container [2019-11-28 00:25:37,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:37" (3/3) ... [2019-11-28 00:25:37,335 INFO L109 eAbstractionObserver]: Analyzing ICFG id2_b3_o5.c [2019-11-28 00:25:37,360 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:25:37,383 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:25:37,412 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:25:37,443 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:25:37,443 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:25:37,443 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:25:37,443 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:25:37,444 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:25:37,444 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:25:37,444 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:25:37,444 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:25:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-11-28 00:25:37,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 00:25:37,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:37,465 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:37,465 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:37,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:37,472 INFO L82 PathProgramCache]: Analyzing trace with hash -394807891, now seen corresponding path program 1 times [2019-11-28 00:25:37,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:37,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55231682] [2019-11-28 00:25:37,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:37,731 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 00:25:37,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55231682] [2019-11-28 00:25:37,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:25:37,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:25:37,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369921457] [2019-11-28 00:25:37,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:25:37,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:37,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:25:37,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:25:37,755 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2019-11-28 00:25:37,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:37,810 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-11-28 00:25:37,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:25:37,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-28 00:25:37,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:37,824 INFO L225 Difference]: With dead ends: 35 [2019-11-28 00:25:37,824 INFO L226 Difference]: Without dead ends: 22 [2019-11-28 00:25:37,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:25:37,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-28 00:25:37,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-28 00:25:37,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 00:25:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-28 00:25:37,877 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 9 [2019-11-28 00:25:37,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:37,878 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-28 00:25:37,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:25:37,878 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-11-28 00:25:37,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:25:37,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:37,880 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:37,881 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:37,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:37,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1343664860, now seen corresponding path program 1 times [2019-11-28 00:25:37,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:37,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831200097] [2019-11-28 00:25:37,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,038 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 00:25:38,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831200097] [2019-11-28 00:25:38,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:25:38,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:25:38,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472710142] [2019-11-28 00:25:38,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:25:38,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:38,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:25:38,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:25:38,047 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states. [2019-11-28 00:25:38,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:38,076 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-11-28 00:25:38,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:25:38,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-28 00:25:38,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:38,079 INFO L225 Difference]: With dead ends: 28 [2019-11-28 00:25:38,079 INFO L226 Difference]: Without dead ends: 24 [2019-11-28 00:25:38,080 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:25:38,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-28 00:25:38,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-11-28 00:25:38,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 00:25:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-28 00:25:38,089 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2019-11-28 00:25:38,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:38,089 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-28 00:25:38,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:25:38,090 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-11-28 00:25:38,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:25:38,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:38,091 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:38,091 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:38,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:38,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1372294011, now seen corresponding path program 1 times [2019-11-28 00:25:38,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:38,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159150807] [2019-11-28 00:25:38,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,281 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 00:25:38,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159150807] [2019-11-28 00:25:38,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:25:38,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 00:25:38,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056269770] [2019-11-28 00:25:38,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:25:38,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:38,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:25:38,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:25:38,284 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 8 states. [2019-11-28 00:25:38,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:38,368 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2019-11-28 00:25:38,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:25:38,368 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-28 00:25:38,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:38,370 INFO L225 Difference]: With dead ends: 44 [2019-11-28 00:25:38,370 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 00:25:38,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:25:38,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 00:25:38,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-28 00:25:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 00:25:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-11-28 00:25:38,377 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2019-11-28 00:25:38,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:38,378 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-28 00:25:38,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:25:38,378 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-11-28 00:25:38,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:25:38,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:38,382 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:38,382 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:38,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:38,383 INFO L82 PathProgramCache]: Analyzing trace with hash -971845561, now seen corresponding path program 1 times [2019-11-28 00:25:38,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:38,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595888479] [2019-11-28 00:25:38,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:25:38,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595888479] [2019-11-28 00:25:38,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:25:38,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:25:38,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097510871] [2019-11-28 00:25:38,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:25:38,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:38,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:25:38,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:25:38,541 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2019-11-28 00:25:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:38,578 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-11-28 00:25:38,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:25:38,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-28 00:25:38,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:38,582 INFO L225 Difference]: With dead ends: 46 [2019-11-28 00:25:38,582 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 00:25:38,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:25:38,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 00:25:38,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-11-28 00:25:38,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 00:25:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-11-28 00:25:38,597 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2019-11-28 00:25:38,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:38,597 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-11-28 00:25:38,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:25:38,599 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-11-28 00:25:38,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:25:38,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:38,602 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:38,602 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:38,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:38,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1168359066, now seen corresponding path program 1 times [2019-11-28 00:25:38,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:38,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683922094] [2019-11-28 00:25:38,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:25:38,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683922094] [2019-11-28 00:25:38,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339277790] [2019-11-28 00:25:38,892 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 00:25:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 00:25:38,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:25:39,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:39,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-28 00:25:39,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794770718] [2019-11-28 00:25:39,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:25:39,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:39,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:25:39,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:25:39,092 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 12 states. [2019-11-28 00:25:39,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:39,230 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-11-28 00:25:39,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 00:25:39,231 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-28 00:25:39,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:39,232 INFO L225 Difference]: With dead ends: 60 [2019-11-28 00:25:39,232 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 00:25:39,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:25:39,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 00:25:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2019-11-28 00:25:39,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 00:25:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-11-28 00:25:39,242 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2019-11-28 00:25:39,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:39,243 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-28 00:25:39,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:25:39,243 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-11-28 00:25:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 00:25:39,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:39,245 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:39,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:39,449 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:39,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:39,450 INFO L82 PathProgramCache]: Analyzing trace with hash -222974932, now seen corresponding path program 1 times [2019-11-28 00:25:39,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:39,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772609568] [2019-11-28 00:25:39,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 00:25:39,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772609568] [2019-11-28 00:25:39,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127254493] [2019-11-28 00:25:39,805 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 00:25:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 00:25:39,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:39,931 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 00:25:39,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:39,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-11-28 00:25:39,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948152552] [2019-11-28 00:25:39,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 00:25:39,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:39,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 00:25:39,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-11-28 00:25:39,936 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 15 states. [2019-11-28 00:25:40,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:40,106 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-11-28 00:25:40,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 00:25:40,106 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2019-11-28 00:25:40,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:40,108 INFO L225 Difference]: With dead ends: 70 [2019-11-28 00:25:40,108 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 00:25:40,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-11-28 00:25:40,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 00:25:40,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2019-11-28 00:25:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 00:25:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-28 00:25:40,117 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 30 [2019-11-28 00:25:40,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:40,118 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-28 00:25:40,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 00:25:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-28 00:25:40,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 00:25:40,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:40,120 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:40,324 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:40,324 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:40,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:40,325 INFO L82 PathProgramCache]: Analyzing trace with hash -141607649, now seen corresponding path program 2 times [2019-11-28 00:25:40,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:40,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282258415] [2019-11-28 00:25:40,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:40,658 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-28 00:25:40,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282258415] [2019-11-28 00:25:40,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83440429] [2019-11-28 00:25:40,660 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 00:25:40,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:25:40,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:40,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 00:25:40,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:40,765 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-28 00:25:40,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:40,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-11-28 00:25:40,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209096995] [2019-11-28 00:25:40,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 00:25:40,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:40,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 00:25:40,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-11-28 00:25:40,768 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 15 states. [2019-11-28 00:25:40,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:40,945 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2019-11-28 00:25:40,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 00:25:40,946 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2019-11-28 00:25:40,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:40,947 INFO L225 Difference]: With dead ends: 74 [2019-11-28 00:25:40,948 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 00:25:40,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-11-28 00:25:40,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 00:25:40,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-11-28 00:25:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 00:25:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-28 00:25:40,957 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 37 [2019-11-28 00:25:40,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:40,958 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-28 00:25:40,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 00:25:40,959 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-28 00:25:40,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 00:25:40,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:40,961 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:41,173 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:41,174 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:41,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:41,174 INFO L82 PathProgramCache]: Analyzing trace with hash -90623267, now seen corresponding path program 2 times [2019-11-28 00:25:41,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:41,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841529905] [2019-11-28 00:25:41,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 00:25:41,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841529905] [2019-11-28 00:25:41,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837655883] [2019-11-28 00:25:41,576 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) [2019-11-28 00:25:41,615 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 00:25:41,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:41,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:25:41,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-28 00:25:41,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 00:25:41,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2019-11-28 00:25:41,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506867219] [2019-11-28 00:25:41,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:25:41,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:41,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:25:41,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-11-28 00:25:41,701 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-11-28 00:25:41,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:41,713 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-11-28 00:25:41,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:25:41,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-28 00:25:41,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:41,714 INFO L225 Difference]: With dead ends: 50 [2019-11-28 00:25:41,714 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:25:41,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-11-28 00:25:41,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:25:41,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:25:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:25:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:25:41,717 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2019-11-28 00:25:41,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:41,718 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:25:41,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:25:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:25:41,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:25:41,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:41,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:25:41,935 INFO L246 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2019-11-28 00:25:41,935 INFO L249 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2019-11-28 00:25:41,935 INFO L246 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2019-11-28 00:25:41,935 INFO L246 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2019-11-28 00:25:41,936 INFO L246 CegarLoopResult]: For program point id2EXIT(lines 14 19) no Hoare annotation was computed. [2019-11-28 00:25:41,936 INFO L249 CegarLoopResult]: At program point id2ENTRY(lines 14 19) the Hoare annotation is: true [2019-11-28 00:25:41,936 INFO L246 CegarLoopResult]: For program point id2FINAL(lines 14 19) no Hoare annotation was computed. [2019-11-28 00:25:41,936 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:25:41,936 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:25:41,936 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:25:41,936 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-28 00:25:41,936 INFO L246 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-28 00:25:41,937 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2019-11-28 00:25:41,937 INFO L249 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2019-11-28 00:25:41,937 INFO L246 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-11-28 00:25:41,937 INFO L246 CegarLoopResult]: For program point L21(lines 21 27) no Hoare annotation was computed. [2019-11-28 00:25:41,937 INFO L246 CegarLoopResult]: For program point idFINAL(lines 7 12) no Hoare annotation was computed. [2019-11-28 00:25:41,937 INFO L246 CegarLoopResult]: For program point idEXIT(lines 7 12) no Hoare annotation was computed. [2019-11-28 00:25:41,937 INFO L246 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2019-11-28 00:25:41,938 INFO L249 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2019-11-28 00:25:41,938 INFO L246 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2019-11-28 00:25:41,938 INFO L246 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2019-11-28 00:25:41,938 INFO L249 CegarLoopResult]: At program point idENTRY(lines 7 12) the Hoare annotation is: true [2019-11-28 00:25:41,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:25:41 BoogieIcfgContainer [2019-11-28 00:25:41,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:25:41,944 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:25:41,944 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:25:41,945 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:25:41,945 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:37" (3/4) ... [2019-11-28 00:25:41,954 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:25:41,965 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id2 [2019-11-28 00:25:41,965 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2019-11-28 00:25:41,970 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 00:25:41,970 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 00:25:42,021 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:25:42,022 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:25:42,024 INFO L168 Benchmark]: Toolchain (without parser) took 5376.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:42,025 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:25:42,026 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.32 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:42,026 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:42,027 INFO L168 Benchmark]: Boogie Preprocessor took 18.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:25:42,027 INFO L168 Benchmark]: RCFGBuilder took 288.50 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:42,028 INFO L168 Benchmark]: TraceAbstraction took 4629.86 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.4 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:42,028 INFO L168 Benchmark]: Witness Printer took 77.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:25:42,032 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 265.32 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.2 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 83.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 288.50 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4629.86 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.4 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. * Witness Printer took 77.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 1 error locations. Result: SAFE, OverallTime: 4.4s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 206 SDtfs, 27 SDslu, 1249 SDs, 0 SdLazy, 350 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 190 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 30 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 5 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 332 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 32728 SizeOfPredicates, 13 NumberOfNonLiveVariables, 238 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 110/150 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...