./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 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/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-30f4e4a [2019-11-27 22:36:09,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:36:09,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:36:09,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:36:09,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:36:09,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:36:09,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:36:09,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:36:09,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:36:09,177 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:36:09,178 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:36:09,179 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:36:09,179 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:36:09,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:36:09,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:36:09,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:36:09,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:36:09,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:36:09,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:36:09,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:36:09,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:36:09,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:36:09,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:36:09,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:36:09,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:36:09,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:36:09,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:36:09,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:36:09,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:36:09,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:36:09,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:36:09,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:36:09,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:36:09,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:36:09,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:36:09,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:36:09,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:36:09,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:36:09,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:36:09,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:36:09,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:36:09,220 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:36:09,250 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:36:09,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:36:09,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:36:09,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:36:09,252 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:36:09,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:36:09,253 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:36:09,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:36:09,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:36:09,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:36:09,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:36:09,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:36:09,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:36:09,255 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:36:09,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:36:09,256 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:36:09,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:36:09,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:36:09,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:36:09,257 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:36:09,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:36:09,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:36:09,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:36:09,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:36:09,258 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:36:09,258 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:36:09,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:36:09,258 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:36:09,259 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-27 22:36:09,565 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:36:09,579 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:36:09,582 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:36:09,584 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:36:09,584 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:36:09,585 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-27 22:36:09,650 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7867e0bd4/b0590b48b4f74e28af4f52177ee74648/FLAGa07fd28f4 [2019-11-27 22:36:10,115 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:36:10,116 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_5.c [2019-11-27 22:36:10,126 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7867e0bd4/b0590b48b4f74e28af4f52177ee74648/FLAGa07fd28f4 [2019-11-27 22:36:10,521 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7867e0bd4/b0590b48b4f74e28af4f52177ee74648 [2019-11-27 22:36:10,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:36:10,527 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:36:10,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:36:10,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:36:10,533 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:36:10,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:36:10" (1/1) ... [2019-11-27 22:36:10,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c492e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:10, skipping insertion in model container [2019-11-27 22:36:10,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:36:10" (1/1) ... [2019-11-27 22:36:10,545 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:36:10,565 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:36:10,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:36:10,762 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:36:10,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:36:10,793 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:36:10,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:10 WrapperNode [2019-11-27 22:36:10,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:36:10,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:36:10,795 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:36:10,795 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:36:10,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:10" (1/1) ... [2019-11-27 22:36:10,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:10" (1/1) ... [2019-11-27 22:36:10,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:36:10,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:36:10,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:36:10,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:36:10,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:10" (1/1) ... [2019-11-27 22:36:10,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:10" (1/1) ... [2019-11-27 22:36:10,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:10" (1/1) ... [2019-11-27 22:36:10,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:10" (1/1) ... [2019-11-27 22:36:10,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:10" (1/1) ... [2019-11-27 22:36:10,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:10" (1/1) ... [2019-11-27 22:36:10,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:10" (1/1) ... [2019-11-27 22:36:10,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:36:10,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:36:10,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:36:10,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:36:10,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:10" (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-27 22:36:10,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:36:10,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:36:11,218 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:36:11,218 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-27 22:36:11,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:36:11 BoogieIcfgContainer [2019-11-27 22:36:11,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:36:11,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:36:11,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:36:11,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:36:11,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:36:10" (1/3) ... [2019-11-27 22:36:11,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235686a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:36:11, skipping insertion in model container [2019-11-27 22:36:11,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:10" (2/3) ... [2019-11-27 22:36:11,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235686a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:36:11, skipping insertion in model container [2019-11-27 22:36:11,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:36:11" (3/3) ... [2019-11-27 22:36:11,233 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2019-11-27 22:36:11,247 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:36:11,255 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:36:11,302 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:36:11,326 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:36:11,326 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:36:11,326 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:36:11,327 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:36:11,327 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:36:11,327 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:36:11,327 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:36:11,327 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:36:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-11-27 22:36:11,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-27 22:36:11,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:11,354 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:11,355 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:11,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:11,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1401695884, now seen corresponding path program 1 times [2019-11-27 22:36:11,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:11,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206740319] [2019-11-27 22:36:11,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:11,520 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-27 22:36:11,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206740319] [2019-11-27 22:36:11,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:11,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:11,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968741631] [2019-11-27 22:36:11,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:11,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:11,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:11,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:11,552 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-11-27 22:36:11,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:11,634 INFO L93 Difference]: Finished difference Result 52 states and 84 transitions. [2019-11-27 22:36:11,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:11,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-27 22:36:11,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:11,650 INFO L225 Difference]: With dead ends: 52 [2019-11-27 22:36:11,651 INFO L226 Difference]: Without dead ends: 38 [2019-11-27 22:36:11,655 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-27 22:36:11,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-27 22:36:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2019-11-27 22:36:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-27 22:36:11,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. [2019-11-27 22:36:11,703 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 45 transitions. Word has length 11 [2019-11-27 22:36:11,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:11,704 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 45 transitions. [2019-11-27 22:36:11,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:11,704 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2019-11-27 22:36:11,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-27 22:36:11,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:11,706 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:11,706 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:11,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:11,707 INFO L82 PathProgramCache]: Analyzing trace with hash 592349258, now seen corresponding path program 1 times [2019-11-27 22:36:11,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:11,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801106781] [2019-11-27 22:36:11,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:11,804 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-27 22:36:11,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801106781] [2019-11-27 22:36:11,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:11,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:11,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320979441] [2019-11-27 22:36:11,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:11,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:11,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:11,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:11,808 INFO L87 Difference]: Start difference. First operand 26 states and 45 transitions. Second operand 3 states. [2019-11-27 22:36:11,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:11,831 INFO L93 Difference]: Finished difference Result 63 states and 108 transitions. [2019-11-27 22:36:11,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:11,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-27 22:36:11,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:11,833 INFO L225 Difference]: With dead ends: 63 [2019-11-27 22:36:11,833 INFO L226 Difference]: Without dead ends: 38 [2019-11-27 22:36:11,834 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-27 22:36:11,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-27 22:36:11,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-11-27 22:36:11,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-27 22:36:11,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 61 transitions. [2019-11-27 22:36:11,842 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 61 transitions. Word has length 11 [2019-11-27 22:36:11,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:11,842 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 61 transitions. [2019-11-27 22:36:11,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:11,843 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 61 transitions. [2019-11-27 22:36:11,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-27 22:36:11,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:11,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:11,844 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:11,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:11,845 INFO L82 PathProgramCache]: Analyzing trace with hash 503114411, now seen corresponding path program 1 times [2019-11-27 22:36:11,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:11,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963248991] [2019-11-27 22:36:11,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:11,877 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-27 22:36:11,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963248991] [2019-11-27 22:36:11,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:11,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:11,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856690978] [2019-11-27 22:36:11,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:11,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:11,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:11,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:11,880 INFO L87 Difference]: Start difference. First operand 36 states and 61 transitions. Second operand 3 states. [2019-11-27 22:36:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:11,906 INFO L93 Difference]: Finished difference Result 59 states and 95 transitions. [2019-11-27 22:36:11,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:11,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-27 22:36:11,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:11,908 INFO L225 Difference]: With dead ends: 59 [2019-11-27 22:36:11,908 INFO L226 Difference]: Without dead ends: 41 [2019-11-27 22:36:11,909 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-27 22:36:11,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-27 22:36:11,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-27 22:36:11,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-27 22:36:11,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 63 transitions. [2019-11-27 22:36:11,916 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 63 transitions. Word has length 12 [2019-11-27 22:36:11,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:11,917 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 63 transitions. [2019-11-27 22:36:11,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:11,917 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 63 transitions. [2019-11-27 22:36:11,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-27 22:36:11,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:11,919 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:11,919 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:11,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:11,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1183172781, now seen corresponding path program 1 times [2019-11-27 22:36:11,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:11,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291253918] [2019-11-27 22:36:11,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:11,953 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-27 22:36:11,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291253918] [2019-11-27 22:36:11,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:11,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:11,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247183174] [2019-11-27 22:36:11,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:11,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:11,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:11,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:11,955 INFO L87 Difference]: Start difference. First operand 39 states and 63 transitions. Second operand 3 states. [2019-11-27 22:36:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:11,975 INFO L93 Difference]: Finished difference Result 72 states and 116 transitions. [2019-11-27 22:36:11,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:11,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-27 22:36:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:11,977 INFO L225 Difference]: With dead ends: 72 [2019-11-27 22:36:11,978 INFO L226 Difference]: Without dead ends: 70 [2019-11-27 22:36:11,978 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-27 22:36:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-27 22:36:11,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-11-27 22:36:11,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-27 22:36:11,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 84 transitions. [2019-11-27 22:36:11,987 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 84 transitions. Word has length 12 [2019-11-27 22:36:11,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:11,988 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 84 transitions. [2019-11-27 22:36:11,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:11,988 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 84 transitions. [2019-11-27 22:36:11,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-27 22:36:11,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:11,989 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:11,990 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:11,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:11,990 INFO L82 PathProgramCache]: Analyzing trace with hash 373826155, now seen corresponding path program 1 times [2019-11-27 22:36:11,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:11,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122491037] [2019-11-27 22:36:11,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:12,032 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-27 22:36:12,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122491037] [2019-11-27 22:36:12,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:12,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:12,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396704638] [2019-11-27 22:36:12,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:12,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:12,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:12,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:12,035 INFO L87 Difference]: Start difference. First operand 52 states and 84 transitions. Second operand 3 states. [2019-11-27 22:36:12,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:12,075 INFO L93 Difference]: Finished difference Result 120 states and 194 transitions. [2019-11-27 22:36:12,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:12,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-27 22:36:12,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:12,081 INFO L225 Difference]: With dead ends: 120 [2019-11-27 22:36:12,081 INFO L226 Difference]: Without dead ends: 72 [2019-11-27 22:36:12,084 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-27 22:36:12,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-27 22:36:12,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-11-27 22:36:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-27 22:36:12,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 110 transitions. [2019-11-27 22:36:12,103 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 110 transitions. Word has length 12 [2019-11-27 22:36:12,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:12,104 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 110 transitions. [2019-11-27 22:36:12,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:12,106 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 110 transitions. [2019-11-27 22:36:12,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-27 22:36:12,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:12,107 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:12,108 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:12,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:12,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1976134145, now seen corresponding path program 1 times [2019-11-27 22:36:12,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:12,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400417745] [2019-11-27 22:36:12,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:12,170 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-27 22:36:12,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400417745] [2019-11-27 22:36:12,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:12,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:12,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931337350] [2019-11-27 22:36:12,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:12,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:12,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:12,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:12,174 INFO L87 Difference]: Start difference. First operand 70 states and 110 transitions. Second operand 3 states. [2019-11-27 22:36:12,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:12,209 INFO L93 Difference]: Finished difference Result 107 states and 165 transitions. [2019-11-27 22:36:12,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:12,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-27 22:36:12,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:12,211 INFO L225 Difference]: With dead ends: 107 [2019-11-27 22:36:12,211 INFO L226 Difference]: Without dead ends: 74 [2019-11-27 22:36:12,213 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-27 22:36:12,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-27 22:36:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-11-27 22:36:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-27 22:36:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions. [2019-11-27 22:36:12,225 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 13 [2019-11-27 22:36:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:12,225 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 110 transitions. [2019-11-27 22:36:12,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions. [2019-11-27 22:36:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-27 22:36:12,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:12,228 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:12,229 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:12,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:12,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1296075775, now seen corresponding path program 1 times [2019-11-27 22:36:12,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:12,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721683464] [2019-11-27 22:36:12,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:12,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-27 22:36:12,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721683464] [2019-11-27 22:36:12,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:12,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:12,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163563450] [2019-11-27 22:36:12,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:12,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:12,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:12,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:12,292 INFO L87 Difference]: Start difference. First operand 72 states and 110 transitions. Second operand 3 states. [2019-11-27 22:36:12,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:12,319 INFO L93 Difference]: Finished difference Result 200 states and 304 transitions. [2019-11-27 22:36:12,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:12,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-27 22:36:12,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:12,321 INFO L225 Difference]: With dead ends: 200 [2019-11-27 22:36:12,322 INFO L226 Difference]: Without dead ends: 134 [2019-11-27 22:36:12,322 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-27 22:36:12,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-27 22:36:12,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2019-11-27 22:36:12,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-27 22:36:12,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 194 transitions. [2019-11-27 22:36:12,335 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 194 transitions. Word has length 13 [2019-11-27 22:36:12,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:12,336 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 194 transitions. [2019-11-27 22:36:12,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:12,336 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 194 transitions. [2019-11-27 22:36:12,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-27 22:36:12,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:12,337 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:12,337 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:12,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:12,338 INFO L82 PathProgramCache]: Analyzing trace with hash -486729149, now seen corresponding path program 1 times [2019-11-27 22:36:12,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:12,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524218578] [2019-11-27 22:36:12,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:12,377 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-27 22:36:12,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524218578] [2019-11-27 22:36:12,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:12,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:12,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479608898] [2019-11-27 22:36:12,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:12,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:12,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:12,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:12,380 INFO L87 Difference]: Start difference. First operand 132 states and 194 transitions. Second operand 3 states. [2019-11-27 22:36:12,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:12,408 INFO L93 Difference]: Finished difference Result 160 states and 236 transitions. [2019-11-27 22:36:12,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:12,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-27 22:36:12,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:12,410 INFO L225 Difference]: With dead ends: 160 [2019-11-27 22:36:12,410 INFO L226 Difference]: Without dead ends: 158 [2019-11-27 22:36:12,411 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-27 22:36:12,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-27 22:36:12,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 132. [2019-11-27 22:36:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-27 22:36:12,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 190 transitions. [2019-11-27 22:36:12,440 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 190 transitions. Word has length 13 [2019-11-27 22:36:12,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:12,440 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 190 transitions. [2019-11-27 22:36:12,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:12,440 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 190 transitions. [2019-11-27 22:36:12,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 22:36:12,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:12,444 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:12,444 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:12,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:12,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1523427712, now seen corresponding path program 1 times [2019-11-27 22:36:12,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:12,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559408603] [2019-11-27 22:36:12,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:12,492 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-27 22:36:12,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559408603] [2019-11-27 22:36:12,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:12,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:12,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562053489] [2019-11-27 22:36:12,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:12,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:12,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:12,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:12,495 INFO L87 Difference]: Start difference. First operand 132 states and 190 transitions. Second operand 3 states. [2019-11-27 22:36:12,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:12,526 INFO L93 Difference]: Finished difference Result 228 states and 328 transitions. [2019-11-27 22:36:12,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:12,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-27 22:36:12,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:12,528 INFO L225 Difference]: With dead ends: 228 [2019-11-27 22:36:12,528 INFO L226 Difference]: Without dead ends: 226 [2019-11-27 22:36:12,529 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-27 22:36:12,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-27 22:36:12,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 192. [2019-11-27 22:36:12,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-27 22:36:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 270 transitions. [2019-11-27 22:36:12,555 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 270 transitions. Word has length 14 [2019-11-27 22:36:12,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:12,557 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 270 transitions. [2019-11-27 22:36:12,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:12,558 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 270 transitions. [2019-11-27 22:36:12,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 22:36:12,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:12,560 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:12,561 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:12,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:12,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1962192958, now seen corresponding path program 1 times [2019-11-27 22:36:12,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:12,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319597810] [2019-11-27 22:36:12,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:12,596 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-27 22:36:12,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319597810] [2019-11-27 22:36:12,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:12,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:12,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758052636] [2019-11-27 22:36:12,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:12,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:12,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:12,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:12,600 INFO L87 Difference]: Start difference. First operand 192 states and 270 transitions. Second operand 3 states. [2019-11-27 22:36:12,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:12,637 INFO L93 Difference]: Finished difference Result 436 states and 608 transitions. [2019-11-27 22:36:12,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:12,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-27 22:36:12,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:12,642 INFO L225 Difference]: With dead ends: 436 [2019-11-27 22:36:12,643 INFO L226 Difference]: Without dead ends: 250 [2019-11-27 22:36:12,646 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-27 22:36:12,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-27 22:36:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-11-27 22:36:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-11-27 22:36:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 330 transitions. [2019-11-27 22:36:12,677 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 330 transitions. Word has length 14 [2019-11-27 22:36:12,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:12,677 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 330 transitions. [2019-11-27 22:36:12,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:12,679 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 330 transitions. [2019-11-27 22:36:12,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 22:36:12,681 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:12,681 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:12,681 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:12,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:12,683 INFO L82 PathProgramCache]: Analyzing trace with hash 18597174, now seen corresponding path program 1 times [2019-11-27 22:36:12,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:12,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607330154] [2019-11-27 22:36:12,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:12,722 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-27 22:36:12,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607330154] [2019-11-27 22:36:12,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:12,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:12,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241293637] [2019-11-27 22:36:12,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:12,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:12,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:12,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:12,725 INFO L87 Difference]: Start difference. First operand 248 states and 330 transitions. Second operand 3 states. [2019-11-27 22:36:12,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:12,758 INFO L93 Difference]: Finished difference Result 380 states and 504 transitions. [2019-11-27 22:36:12,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:12,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-27 22:36:12,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:12,761 INFO L225 Difference]: With dead ends: 380 [2019-11-27 22:36:12,761 INFO L226 Difference]: Without dead ends: 262 [2019-11-27 22:36:12,762 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-27 22:36:12,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-27 22:36:12,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-11-27 22:36:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-27 22:36:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 338 transitions. [2019-11-27 22:36:12,775 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 338 transitions. Word has length 15 [2019-11-27 22:36:12,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:12,775 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 338 transitions. [2019-11-27 22:36:12,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:12,776 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 338 transitions. [2019-11-27 22:36:12,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 22:36:12,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:12,777 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:12,777 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:12,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:12,778 INFO L82 PathProgramCache]: Analyzing trace with hash 698655544, now seen corresponding path program 1 times [2019-11-27 22:36:12,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:12,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706867597] [2019-11-27 22:36:12,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:12,804 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-27 22:36:12,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706867597] [2019-11-27 22:36:12,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:12,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:12,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704716078] [2019-11-27 22:36:12,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:12,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:12,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:12,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:12,806 INFO L87 Difference]: Start difference. First operand 260 states and 338 transitions. Second operand 3 states. [2019-11-27 22:36:12,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:12,826 INFO L93 Difference]: Finished difference Result 422 states and 539 transitions. [2019-11-27 22:36:12,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:12,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-27 22:36:12,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:12,829 INFO L225 Difference]: With dead ends: 422 [2019-11-27 22:36:12,830 INFO L226 Difference]: Without dead ends: 420 [2019-11-27 22:36:12,830 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-27 22:36:12,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-11-27 22:36:12,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 388. [2019-11-27 22:36:12,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-11-27 22:36:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 490 transitions. [2019-11-27 22:36:12,844 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 490 transitions. Word has length 15 [2019-11-27 22:36:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:12,845 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 490 transitions. [2019-11-27 22:36:12,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:12,845 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 490 transitions. [2019-11-27 22:36:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 22:36:12,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:12,847 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:12,847 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:12,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:12,847 INFO L82 PathProgramCache]: Analyzing trace with hash -110691082, now seen corresponding path program 1 times [2019-11-27 22:36:12,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:12,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882047980] [2019-11-27 22:36:12,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:12,867 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-27 22:36:12,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882047980] [2019-11-27 22:36:12,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:12,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:12,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416265265] [2019-11-27 22:36:12,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:12,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:12,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:12,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:12,870 INFO L87 Difference]: Start difference. First operand 388 states and 490 transitions. Second operand 3 states. [2019-11-27 22:36:12,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:12,897 INFO L93 Difference]: Finished difference Result 852 states and 1050 transitions. [2019-11-27 22:36:12,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:12,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-27 22:36:12,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:12,899 INFO L225 Difference]: With dead ends: 852 [2019-11-27 22:36:12,899 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:36:12,900 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-27 22:36:12,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:36:12,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:36:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:36:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:36:12,901 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2019-11-27 22:36:12,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:12,902 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:36:12,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:36:12,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:36:12,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:36:12,922 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-27 22:36:12,923 INFO L249 CegarLoopResult]: At program point L89(lines 5 93) the Hoare annotation is: true [2019-11-27 22:36:12,923 INFO L246 CegarLoopResult]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2019-11-27 22:36:12,923 INFO L246 CegarLoopResult]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-27 22:36:12,923 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:36:12,923 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:36:12,923 INFO L246 CegarLoopResult]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2019-11-27 22:36:12,923 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2019-11-27 22:36:12,924 INFO L246 CegarLoopResult]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2019-11-27 22:36:12,924 INFO L246 CegarLoopResult]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2019-11-27 22:36:12,924 INFO L246 CegarLoopResult]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2019-11-27 22:36:12,924 INFO L246 CegarLoopResult]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2019-11-27 22:36:12,924 INFO L246 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2019-11-27 22:36:12,924 INFO L246 CegarLoopResult]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-11-27 22:36:12,925 INFO L246 CegarLoopResult]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2019-11-27 22:36:12,925 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:36:12,925 INFO L249 CegarLoopResult]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2019-11-27 22:36:12,925 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-27 22:36:12,925 INFO L246 CegarLoopResult]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2019-11-27 22:36:12,925 INFO L249 CegarLoopResult]: At program point L92(lines 4 93) the Hoare annotation is: true [2019-11-27 22:36:12,925 INFO L246 CegarLoopResult]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-11-27 22:36:12,926 INFO L246 CegarLoopResult]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-27 22:36:12,926 INFO L242 CegarLoopResult]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2019-11-27 22:36:12,926 INFO L246 CegarLoopResult]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2019-11-27 22:36:12,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:36:12 BoogieIcfgContainer [2019-11-27 22:36:12,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:36:12,939 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:36:12,939 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:36:12,939 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:36:12,940 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:36:11" (3/4) ... [2019-11-27 22:36:12,944 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:36:12,959 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-27 22:36:12,960 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:36:13,088 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:36:13,089 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:36:13,091 INFO L168 Benchmark]: Toolchain (without parser) took 2563.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 956.3 MB in the beginning and 994.1 MB in the end (delta: -37.8 MB). Peak memory consumption was 104.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:13,092 INFO L168 Benchmark]: CDTParser took 0.28 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-27 22:36:13,092 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.30 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:13,093 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:13,093 INFO L168 Benchmark]: Boogie Preprocessor took 22.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:13,093 INFO L168 Benchmark]: RCFGBuilder took 310.19 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: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:13,094 INFO L168 Benchmark]: TraceAbstraction took 1716.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 111.8 MB). Peak memory consumption was 111.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:13,094 INFO L168 Benchmark]: Witness Printer took 150.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 994.1 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:13,096 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.28 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.30 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 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 92.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 310.19 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: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1716.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 111.8 MB). Peak memory consumption was 111.8 MB. Max. memory is 11.5 GB. * Witness Printer took 150.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 994.1 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 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.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 561 SDtfs, 264 SDslu, 345 SDs, 0 SdLazy, 69 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s 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.2s 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.4s 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...