./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f6fb2bb1 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/locks/test_locks_5.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 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-f6fb2bb [2019-11-19 18:26:40,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 18:26:40,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 18:26:40,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 18:26:40,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 18:26:40,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 18:26:40,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 18:26:40,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 18:26:40,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 18:26:40,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 18:26:40,925 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 18:26:40,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 18:26:40,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 18:26:40,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 18:26:40,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 18:26:40,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 18:26:40,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 18:26:40,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 18:26:40,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 18:26:40,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 18:26:40,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 18:26:40,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 18:26:40,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 18:26:40,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 18:26:40,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 18:26:40,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 18:26:40,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 18:26:40,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 18:26:40,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 18:26:40,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 18:26:40,960 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 18:26:40,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 18:26:40,961 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 18:26:40,962 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 18:26:40,964 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 18:26:40,964 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 18:26:40,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 18:26:40,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 18:26:40,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 18:26:40,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 18:26:40,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 18:26:40,968 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 18:26:41,000 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 18:26:41,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 18:26:41,005 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 18:26:41,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 18:26:41,007 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 18:26:41,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 18:26:41,008 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 18:26:41,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 18:26:41,008 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 18:26:41,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 18:26:41,009 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 18:26:41,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 18:26:41,010 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 18:26:41,011 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 18:26:41,011 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 18:26:41,011 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 18:26:41,011 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 18:26:41,012 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 18:26:41,012 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 18:26:41,012 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 18:26:41,012 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 18:26:41,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:26:41,013 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 18:26:41,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 18:26:41,014 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 18:26:41,014 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 18:26:41,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 18:26:41,015 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 18:26:41,015 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 -> 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb [2019-11-19 18:26:41,317 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 18:26:41,329 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 18:26:41,333 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 18:26:41,334 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 18:26:41,335 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 18:26:41,335 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_5.c [2019-11-19 18:26:41,409 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19ad7637/6d7bf4b53fc944a0a950efa09a341964/FLAGce7db7264 [2019-11-19 18:26:41,900 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 18:26:41,902 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_5.c [2019-11-19 18:26:41,910 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19ad7637/6d7bf4b53fc944a0a950efa09a341964/FLAGce7db7264 [2019-11-19 18:26:42,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19ad7637/6d7bf4b53fc944a0a950efa09a341964 [2019-11-19 18:26:42,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 18:26:42,304 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 18:26:42,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 18:26:42,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 18:26:42,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 18:26:42,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:26:42" (1/1) ... [2019-11-19 18:26:42,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cf39342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:42, skipping insertion in model container [2019-11-19 18:26:42,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:26:42" (1/1) ... [2019-11-19 18:26:42,322 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 18:26:42,347 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 18:26:42,538 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:26:42,542 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 18:26:42,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:26:42,572 INFO L192 MainTranslator]: Completed translation [2019-11-19 18:26:42,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:42 WrapperNode [2019-11-19 18:26:42,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 18:26:42,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 18:26:42,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 18:26:42,573 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 18:26:42,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:42" (1/1) ... [2019-11-19 18:26:42,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:42" (1/1) ... [2019-11-19 18:26:42,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 18:26:42,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 18:26:42,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 18:26:42,667 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 18:26:42,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:42" (1/1) ... [2019-11-19 18:26:42,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:42" (1/1) ... [2019-11-19 18:26:42,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:42" (1/1) ... [2019-11-19 18:26:42,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:42" (1/1) ... [2019-11-19 18:26:42,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:42" (1/1) ... [2019-11-19 18:26:42,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:42" (1/1) ... [2019-11-19 18:26:42,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:42" (1/1) ... [2019-11-19 18:26:42,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 18:26:42,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 18:26:42,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 18:26:42,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 18:26:42,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:42" (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-19 18:26:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 18:26:42,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 18:26:42,994 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 18:26:42,995 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-19 18:26:42,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:26:42 BoogieIcfgContainer [2019-11-19 18:26:42,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 18:26:42,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 18:26:42,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 18:26:43,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 18:26:43,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:26:42" (1/3) ... [2019-11-19 18:26:43,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7b4bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:26:43, skipping insertion in model container [2019-11-19 18:26:43,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:42" (2/3) ... [2019-11-19 18:26:43,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7b4bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:26:43, skipping insertion in model container [2019-11-19 18:26:43,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:26:42" (3/3) ... [2019-11-19 18:26:43,007 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2019-11-19 18:26:43,018 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 18:26:43,026 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 18:26:43,059 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 18:26:43,082 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 18:26:43,082 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 18:26:43,082 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 18:26:43,082 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 18:26:43,083 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 18:26:43,083 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 18:26:43,083 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 18:26:43,083 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 18:26:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-11-19 18:26:43,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 18:26:43,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:43,100 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:43,101 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:43,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:43,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1401695884, now seen corresponding path program 1 times [2019-11-19 18:26:43,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:43,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664210129] [2019-11-19 18:26:43,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:43,290 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-19 18:26:43,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664210129] [2019-11-19 18:26:43,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:43,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:43,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881210340] [2019-11-19 18:26:43,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:43,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:43,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:43,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:43,309 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-11-19 18:26:43,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:43,369 INFO L93 Difference]: Finished difference Result 52 states and 84 transitions. [2019-11-19 18:26:43,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:43,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-19 18:26:43,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:43,381 INFO L225 Difference]: With dead ends: 52 [2019-11-19 18:26:43,381 INFO L226 Difference]: Without dead ends: 38 [2019-11-19 18:26:43,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:43,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-19 18:26:43,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2019-11-19 18:26:43,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-19 18:26:43,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. [2019-11-19 18:26:43,416 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 45 transitions. Word has length 11 [2019-11-19 18:26:43,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:43,417 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 45 transitions. [2019-11-19 18:26:43,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:43,417 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2019-11-19 18:26:43,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 18:26:43,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:43,418 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:43,419 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:43,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:43,419 INFO L82 PathProgramCache]: Analyzing trace with hash 592349258, now seen corresponding path program 1 times [2019-11-19 18:26:43,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:43,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285904832] [2019-11-19 18:26:43,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:43,466 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-19 18:26:43,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285904832] [2019-11-19 18:26:43,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:43,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:43,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841003930] [2019-11-19 18:26:43,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:43,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:43,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:43,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:43,472 INFO L87 Difference]: Start difference. First operand 26 states and 45 transitions. Second operand 3 states. [2019-11-19 18:26:43,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:43,512 INFO L93 Difference]: Finished difference Result 63 states and 108 transitions. [2019-11-19 18:26:43,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:43,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-19 18:26:43,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:43,516 INFO L225 Difference]: With dead ends: 63 [2019-11-19 18:26:43,516 INFO L226 Difference]: Without dead ends: 38 [2019-11-19 18:26:43,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:43,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-19 18:26:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-11-19 18:26:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-19 18:26:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 61 transitions. [2019-11-19 18:26:43,524 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 61 transitions. Word has length 11 [2019-11-19 18:26:43,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:43,524 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 61 transitions. [2019-11-19 18:26:43,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 61 transitions. [2019-11-19 18:26:43,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 18:26:43,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:43,525 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:43,526 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:43,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:43,526 INFO L82 PathProgramCache]: Analyzing trace with hash 503114411, now seen corresponding path program 1 times [2019-11-19 18:26:43,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:43,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107909944] [2019-11-19 18:26:43,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:43,586 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-19 18:26:43,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107909944] [2019-11-19 18:26:43,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:43,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:43,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498836330] [2019-11-19 18:26:43,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:43,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:43,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:43,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:43,592 INFO L87 Difference]: Start difference. First operand 36 states and 61 transitions. Second operand 3 states. [2019-11-19 18:26:43,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:43,619 INFO L93 Difference]: Finished difference Result 59 states and 95 transitions. [2019-11-19 18:26:43,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:43,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-19 18:26:43,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:43,623 INFO L225 Difference]: With dead ends: 59 [2019-11-19 18:26:43,623 INFO L226 Difference]: Without dead ends: 41 [2019-11-19 18:26:43,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:43,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-19 18:26:43,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-19 18:26:43,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-19 18:26:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 63 transitions. [2019-11-19 18:26:43,636 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 63 transitions. Word has length 12 [2019-11-19 18:26:43,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:43,637 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 63 transitions. [2019-11-19 18:26:43,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:43,638 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 63 transitions. [2019-11-19 18:26:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 18:26:43,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:43,640 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:43,641 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:43,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:43,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1183172781, now seen corresponding path program 1 times [2019-11-19 18:26:43,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:43,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421178238] [2019-11-19 18:26:43,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:43,690 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-19 18:26:43,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421178238] [2019-11-19 18:26:43,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:43,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:43,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255422330] [2019-11-19 18:26:43,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:43,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:43,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:43,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:43,696 INFO L87 Difference]: Start difference. First operand 39 states and 63 transitions. Second operand 3 states. [2019-11-19 18:26:43,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:43,720 INFO L93 Difference]: Finished difference Result 72 states and 116 transitions. [2019-11-19 18:26:43,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:43,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-19 18:26:43,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:43,722 INFO L225 Difference]: With dead ends: 72 [2019-11-19 18:26:43,722 INFO L226 Difference]: Without dead ends: 70 [2019-11-19 18:26:43,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:43,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-19 18:26:43,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-11-19 18:26:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-19 18:26:43,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 84 transitions. [2019-11-19 18:26:43,739 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 84 transitions. Word has length 12 [2019-11-19 18:26:43,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:43,739 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 84 transitions. [2019-11-19 18:26:43,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:43,740 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 84 transitions. [2019-11-19 18:26:43,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 18:26:43,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:43,741 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:43,741 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:43,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:43,742 INFO L82 PathProgramCache]: Analyzing trace with hash 373826155, now seen corresponding path program 1 times [2019-11-19 18:26:43,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:43,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126367829] [2019-11-19 18:26:43,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:43,776 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-19 18:26:43,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126367829] [2019-11-19 18:26:43,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:43,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:43,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124446123] [2019-11-19 18:26:43,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:43,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:43,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:43,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:43,778 INFO L87 Difference]: Start difference. First operand 52 states and 84 transitions. Second operand 3 states. [2019-11-19 18:26:43,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:43,798 INFO L93 Difference]: Finished difference Result 120 states and 194 transitions. [2019-11-19 18:26:43,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:43,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-19 18:26:43,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:43,800 INFO L225 Difference]: With dead ends: 120 [2019-11-19 18:26:43,800 INFO L226 Difference]: Without dead ends: 72 [2019-11-19 18:26:43,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:43,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-19 18:26:43,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-11-19 18:26:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-19 18:26:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 110 transitions. [2019-11-19 18:26:43,810 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 110 transitions. Word has length 12 [2019-11-19 18:26:43,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:43,810 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 110 transitions. [2019-11-19 18:26:43,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:43,811 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 110 transitions. [2019-11-19 18:26:43,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 18:26:43,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:43,812 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:43,812 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:43,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:43,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1976134145, now seen corresponding path program 1 times [2019-11-19 18:26:43,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:43,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337614363] [2019-11-19 18:26:43,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:43,841 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-19 18:26:43,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337614363] [2019-11-19 18:26:43,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:43,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:43,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683300666] [2019-11-19 18:26:43,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:43,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:43,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:43,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:43,843 INFO L87 Difference]: Start difference. First operand 70 states and 110 transitions. Second operand 3 states. [2019-11-19 18:26:43,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:43,869 INFO L93 Difference]: Finished difference Result 107 states and 165 transitions. [2019-11-19 18:26:43,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:43,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-19 18:26:43,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:43,871 INFO L225 Difference]: With dead ends: 107 [2019-11-19 18:26:43,871 INFO L226 Difference]: Without dead ends: 74 [2019-11-19 18:26:43,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:43,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-19 18:26:43,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-11-19 18:26:43,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-19 18:26:43,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions. [2019-11-19 18:26:43,880 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 13 [2019-11-19 18:26:43,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:43,880 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 110 transitions. [2019-11-19 18:26:43,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:43,880 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions. [2019-11-19 18:26:43,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 18:26:43,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:43,881 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:43,881 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:43,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:43,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1296075775, now seen corresponding path program 1 times [2019-11-19 18:26:43,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:43,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105166239] [2019-11-19 18:26:43,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:43,920 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-19 18:26:43,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105166239] [2019-11-19 18:26:43,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:43,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:43,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526707944] [2019-11-19 18:26:43,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:43,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:43,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:43,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:43,923 INFO L87 Difference]: Start difference. First operand 72 states and 110 transitions. Second operand 3 states. [2019-11-19 18:26:43,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:43,962 INFO L93 Difference]: Finished difference Result 200 states and 304 transitions. [2019-11-19 18:26:43,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:43,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-19 18:26:43,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:43,964 INFO L225 Difference]: With dead ends: 200 [2019-11-19 18:26:43,964 INFO L226 Difference]: Without dead ends: 134 [2019-11-19 18:26:43,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:43,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-19 18:26:43,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2019-11-19 18:26:43,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-19 18:26:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 194 transitions. [2019-11-19 18:26:43,977 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 194 transitions. Word has length 13 [2019-11-19 18:26:43,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:43,977 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 194 transitions. [2019-11-19 18:26:43,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:43,978 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 194 transitions. [2019-11-19 18:26:43,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 18:26:43,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:43,979 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:43,979 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:43,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:43,979 INFO L82 PathProgramCache]: Analyzing trace with hash -486729149, now seen corresponding path program 1 times [2019-11-19 18:26:43,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:43,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648626783] [2019-11-19 18:26:43,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:44,010 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-19 18:26:44,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648626783] [2019-11-19 18:26:44,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:44,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:44,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993825877] [2019-11-19 18:26:44,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:44,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:44,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:44,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:44,013 INFO L87 Difference]: Start difference. First operand 132 states and 194 transitions. Second operand 3 states. [2019-11-19 18:26:44,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:44,029 INFO L93 Difference]: Finished difference Result 160 states and 236 transitions. [2019-11-19 18:26:44,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:44,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-19 18:26:44,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:44,032 INFO L225 Difference]: With dead ends: 160 [2019-11-19 18:26:44,033 INFO L226 Difference]: Without dead ends: 158 [2019-11-19 18:26:44,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:44,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-19 18:26:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 132. [2019-11-19 18:26:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-19 18:26:44,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 190 transitions. [2019-11-19 18:26:44,056 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 190 transitions. Word has length 13 [2019-11-19 18:26:44,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:44,059 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 190 transitions. [2019-11-19 18:26:44,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 190 transitions. [2019-11-19 18:26:44,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 18:26:44,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:44,060 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:44,060 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:44,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:44,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1523427712, now seen corresponding path program 1 times [2019-11-19 18:26:44,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:44,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90848515] [2019-11-19 18:26:44,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:44,113 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-19 18:26:44,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90848515] [2019-11-19 18:26:44,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:44,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:44,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688929756] [2019-11-19 18:26:44,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:44,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:44,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:44,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:44,116 INFO L87 Difference]: Start difference. First operand 132 states and 190 transitions. Second operand 3 states. [2019-11-19 18:26:44,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:44,139 INFO L93 Difference]: Finished difference Result 228 states and 328 transitions. [2019-11-19 18:26:44,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:44,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-19 18:26:44,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:44,144 INFO L225 Difference]: With dead ends: 228 [2019-11-19 18:26:44,144 INFO L226 Difference]: Without dead ends: 226 [2019-11-19 18:26:44,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:44,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-19 18:26:44,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 192. [2019-11-19 18:26:44,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-19 18:26:44,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 270 transitions. [2019-11-19 18:26:44,174 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 270 transitions. Word has length 14 [2019-11-19 18:26:44,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:44,176 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 270 transitions. [2019-11-19 18:26:44,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 270 transitions. [2019-11-19 18:26:44,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 18:26:44,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:44,179 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:44,179 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:44,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:44,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1962192958, now seen corresponding path program 1 times [2019-11-19 18:26:44,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:44,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327798901] [2019-11-19 18:26:44,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:44,207 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-19 18:26:44,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327798901] [2019-11-19 18:26:44,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:44,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:44,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521724962] [2019-11-19 18:26:44,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:44,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:44,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:44,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:44,210 INFO L87 Difference]: Start difference. First operand 192 states and 270 transitions. Second operand 3 states. [2019-11-19 18:26:44,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:44,235 INFO L93 Difference]: Finished difference Result 436 states and 608 transitions. [2019-11-19 18:26:44,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:44,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-19 18:26:44,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:44,240 INFO L225 Difference]: With dead ends: 436 [2019-11-19 18:26:44,240 INFO L226 Difference]: Without dead ends: 250 [2019-11-19 18:26:44,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:44,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-19 18:26:44,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-11-19 18:26:44,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-11-19 18:26:44,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 330 transitions. [2019-11-19 18:26:44,261 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 330 transitions. Word has length 14 [2019-11-19 18:26:44,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:44,261 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 330 transitions. [2019-11-19 18:26:44,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:44,261 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 330 transitions. [2019-11-19 18:26:44,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 18:26:44,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:44,263 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:44,263 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:44,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:44,263 INFO L82 PathProgramCache]: Analyzing trace with hash 18597174, now seen corresponding path program 1 times [2019-11-19 18:26:44,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:44,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202943564] [2019-11-19 18:26:44,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:44,287 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-19 18:26:44,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202943564] [2019-11-19 18:26:44,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:44,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:44,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487858617] [2019-11-19 18:26:44,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:44,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:44,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:44,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:44,290 INFO L87 Difference]: Start difference. First operand 248 states and 330 transitions. Second operand 3 states. [2019-11-19 18:26:44,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:44,321 INFO L93 Difference]: Finished difference Result 380 states and 504 transitions. [2019-11-19 18:26:44,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:44,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-19 18:26:44,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:44,324 INFO L225 Difference]: With dead ends: 380 [2019-11-19 18:26:44,324 INFO L226 Difference]: Without dead ends: 262 [2019-11-19 18:26:44,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:44,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-19 18:26:44,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-11-19 18:26:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-19 18:26:44,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 338 transitions. [2019-11-19 18:26:44,347 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 338 transitions. Word has length 15 [2019-11-19 18:26:44,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:44,349 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 338 transitions. [2019-11-19 18:26:44,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:44,350 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 338 transitions. [2019-11-19 18:26:44,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 18:26:44,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:44,352 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:44,353 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:44,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:44,353 INFO L82 PathProgramCache]: Analyzing trace with hash 698655544, now seen corresponding path program 1 times [2019-11-19 18:26:44,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:44,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545717171] [2019-11-19 18:26:44,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:44,398 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-19 18:26:44,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545717171] [2019-11-19 18:26:44,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:44,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:44,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980729962] [2019-11-19 18:26:44,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:44,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:44,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:44,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:44,400 INFO L87 Difference]: Start difference. First operand 260 states and 338 transitions. Second operand 3 states. [2019-11-19 18:26:44,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:44,442 INFO L93 Difference]: Finished difference Result 422 states and 539 transitions. [2019-11-19 18:26:44,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:44,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-19 18:26:44,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:44,446 INFO L225 Difference]: With dead ends: 422 [2019-11-19 18:26:44,446 INFO L226 Difference]: Without dead ends: 420 [2019-11-19 18:26:44,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:44,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-11-19 18:26:44,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 388. [2019-11-19 18:26:44,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-11-19 18:26:44,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 490 transitions. [2019-11-19 18:26:44,468 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 490 transitions. Word has length 15 [2019-11-19 18:26:44,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:44,468 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 490 transitions. [2019-11-19 18:26:44,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:44,468 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 490 transitions. [2019-11-19 18:26:44,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 18:26:44,470 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:44,470 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:44,470 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:44,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:44,471 INFO L82 PathProgramCache]: Analyzing trace with hash -110691082, now seen corresponding path program 1 times [2019-11-19 18:26:44,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:44,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531030843] [2019-11-19 18:26:44,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:44,506 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-19 18:26:44,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531030843] [2019-11-19 18:26:44,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:44,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:44,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982593600] [2019-11-19 18:26:44,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:44,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:44,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:44,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:44,510 INFO L87 Difference]: Start difference. First operand 388 states and 490 transitions. Second operand 3 states. [2019-11-19 18:26:44,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:44,540 INFO L93 Difference]: Finished difference Result 852 states and 1050 transitions. [2019-11-19 18:26:44,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:44,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-19 18:26:44,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:44,541 INFO L225 Difference]: With dead ends: 852 [2019-11-19 18:26:44,541 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 18:26:44,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:44,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 18:26:44,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 18:26:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 18:26:44,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 18:26:44,545 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2019-11-19 18:26:44,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:44,545 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 18:26:44,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:44,546 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 18:26:44,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 18:26:44,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 18:26:44,569 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-19 18:26:44,569 INFO L447 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2019-11-19 18:26:44,569 INFO L444 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2019-11-19 18:26:44,570 INFO L444 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-19 18:26:44,570 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 18:26:44,570 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 18:26:44,570 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2019-11-19 18:26:44,570 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2019-11-19 18:26:44,570 INFO L444 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2019-11-19 18:26:44,570 INFO L444 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2019-11-19 18:26:44,570 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2019-11-19 18:26:44,571 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2019-11-19 18:26:44,572 INFO L444 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-11-19 18:26:44,572 INFO L444 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-11-19 18:26:44,572 INFO L444 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2019-11-19 18:26:44,572 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 18:26:44,572 INFO L447 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2019-11-19 18:26:44,573 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-19 18:26:44,573 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2019-11-19 18:26:44,573 INFO L447 ceAbstractionStarter]: At program point L92(lines 4 93) the Hoare annotation is: true [2019-11-19 18:26:44,573 INFO L444 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-11-19 18:26:44,573 INFO L444 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-19 18:26:44,573 INFO L440 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2019-11-19 18:26:44,573 INFO L444 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2019-11-19 18:26:44,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:26:44 BoogieIcfgContainer [2019-11-19 18:26:44,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 18:26:44,588 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 18:26:44,588 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 18:26:44,589 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 18:26:44,589 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:26:42" (3/4) ... [2019-11-19 18:26:44,595 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 18:26:44,612 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-19 18:26:44,612 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 18:26:44,702 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 18:26:44,702 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 18:26:44,705 INFO L168 Benchmark]: Toolchain (without parser) took 2400.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 961.7 MB in the beginning and 959.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 108.3 MB. Max. memory is 11.5 GB. [2019-11-19 18:26:44,705 INFO L168 Benchmark]: CDTParser took 0.24 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-19 18:26:44,706 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.88 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 18:26:44,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -151.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-19 18:26:44,707 INFO L168 Benchmark]: Boogie Preprocessor took 32.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-19 18:26:44,708 INFO L168 Benchmark]: RCFGBuilder took 298.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-19 18:26:44,708 INFO L168 Benchmark]: TraceAbstraction took 1589.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 966.6 MB in the end (delta: 108.6 MB). Peak memory consumption was 108.6 MB. Max. memory is 11.5 GB. [2019-11-19 18:26:44,709 INFO L168 Benchmark]: Witness Printer took 113.67 ms. Allocated memory is still 1.1 GB. Free memory was 966.6 MB in the beginning and 959.8 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-19 18:26:44,713 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.24 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 267.88 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 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 93.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -151.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 298.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1589.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 966.6 MB in the end (delta: 108.6 MB). Peak memory consumption was 108.6 MB. Max. memory is 11.5 GB. * Witness Printer took 113.67 ms. Allocated memory is still 1.1 GB. Free memory was 966.6 MB in the beginning and 959.8 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. Result: SAFE, OverallTime: 1.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 561 SDtfs, 264 SDslu, 345 SDs, 0 SdLazy, 69 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=388occurred in iteration=12, 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, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 41 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 3796 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 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...