./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_13.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:46:10,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:46:10,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:46:10,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:46:10,306 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:46:10,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:46:10,310 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:46:10,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:46:10,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:46:10,319 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:46:10,320 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:46:10,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:46:10,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:46:10,331 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:46:10,333 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:46:10,335 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:46:10,336 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:46:10,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:46:10,343 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:46:10,347 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:46:10,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:46:10,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:46:10,354 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:46:10,355 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:46:10,359 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:46:10,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:46:10,361 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:46:10,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:46:10,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:46:10,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:46:10,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:46:10,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:46:10,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:46:10,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:46:10,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:46:10,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:46:10,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:46:10,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:46:10,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:46:10,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:46:10,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:46:10,379 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 02:46:10,407 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:46:10,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:46:10,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:46:10,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:46:10,409 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:46:10,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:46:10,410 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:46:10,410 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:46:10,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:46:10,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:46:10,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:46:10,411 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:46:10,412 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:46:10,412 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:46:10,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:46:10,413 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:46:10,413 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:46:10,413 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:46:10,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:46:10,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:46:10,414 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:46:10,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:46:10,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:46:10,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:46:10,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:46:10,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:46:10,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:46:10,416 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 [2019-11-28 02:46:10,730 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:46:10,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:46:10,756 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:46:10,758 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:46:10,759 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:46:10,760 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_13.c [2019-11-28 02:46:10,840 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98b4d748b/5e998b2703374962a0dbb3fb51b1868b/FLAG31c12a251 [2019-11-28 02:46:11,360 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:46:11,361 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c [2019-11-28 02:46:11,367 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98b4d748b/5e998b2703374962a0dbb3fb51b1868b/FLAG31c12a251 [2019-11-28 02:46:11,699 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98b4d748b/5e998b2703374962a0dbb3fb51b1868b [2019-11-28 02:46:11,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:46:11,705 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:46:11,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:11,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:46:11,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:46:11,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:11" (1/1) ... [2019-11-28 02:46:11,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e68f3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:11, skipping insertion in model container [2019-11-28 02:46:11,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:11" (1/1) ... [2019-11-28 02:46:11,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:46:11,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:46:11,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:11,999 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:46:12,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:12,117 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:46:12,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:12 WrapperNode [2019-11-28 02:46:12,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:12,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:46:12,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:46:12,123 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:46:12,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:12" (1/1) ... [2019-11-28 02:46:12,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:12" (1/1) ... [2019-11-28 02:46:12,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:12" (1/1) ... [2019-11-28 02:46:12,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:12" (1/1) ... [2019-11-28 02:46:12,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:12" (1/1) ... [2019-11-28 02:46:12,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:12" (1/1) ... [2019-11-28 02:46:12,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:12" (1/1) ... [2019-11-28 02:46:12,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:46:12,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:46:12,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:46:12,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:46:12,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:46:12,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:46:12,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:46:12,219 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:46:12,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 02:46:12,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:46:12,220 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:46:12,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:46:12,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:46:12,596 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:46:12,597 INFO L297 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 02:46:12,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:12 BoogieIcfgContainer [2019-11-28 02:46:12,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:46:12,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:46:12,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:46:12,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:46:12,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:46:11" (1/3) ... [2019-11-28 02:46:12,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db56a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:12, skipping insertion in model container [2019-11-28 02:46:12,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:12" (2/3) ... [2019-11-28 02:46:12,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db56a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:12, skipping insertion in model container [2019-11-28 02:46:12,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:12" (3/3) ... [2019-11-28 02:46:12,607 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2019-11-28 02:46:12,617 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:46:12,624 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 02:46:12,638 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 02:46:12,660 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:46:12,660 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:46:12,660 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:46:12,660 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:46:12,661 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:46:12,661 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:46:12,661 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:46:12,661 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:46:12,679 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-11-28 02:46:12,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:46:12,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:12,690 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:12,691 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:12,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:12,697 INFO L82 PathProgramCache]: Analyzing trace with hash 2062980600, now seen corresponding path program 1 times [2019-11-28 02:46:12,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:12,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952951085] [2019-11-28 02:46:12,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:12,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952951085] [2019-11-28 02:46:12,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:12,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:12,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779469594] [2019-11-28 02:46:12,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:12,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:12,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:12,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:12,952 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2019-11-28 02:46:13,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:13,012 INFO L93 Difference]: Finished difference Result 98 states and 173 transitions. [2019-11-28 02:46:13,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:13,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 02:46:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:13,027 INFO L225 Difference]: With dead ends: 98 [2019-11-28 02:46:13,027 INFO L226 Difference]: Without dead ends: 90 [2019-11-28 02:46:13,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:13,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-28 02:46:13,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2019-11-28 02:46:13,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 02:46:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2019-11-28 02:46:13,073 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 23 [2019-11-28 02:46:13,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:13,074 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2019-11-28 02:46:13,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:13,074 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2019-11-28 02:46:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:46:13,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:13,076 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:13,076 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:13,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:13,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1041912246, now seen corresponding path program 1 times [2019-11-28 02:46:13,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:13,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936842191] [2019-11-28 02:46:13,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:13,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936842191] [2019-11-28 02:46:13,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:13,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:13,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487575934] [2019-11-28 02:46:13,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:13,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:13,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:13,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:13,171 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 3 states. [2019-11-28 02:46:13,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:13,218 INFO L93 Difference]: Finished difference Result 90 states and 162 transitions. [2019-11-28 02:46:13,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:13,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 02:46:13,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:13,222 INFO L225 Difference]: With dead ends: 90 [2019-11-28 02:46:13,223 INFO L226 Difference]: Without dead ends: 90 [2019-11-28 02:46:13,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-28 02:46:13,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-11-28 02:46:13,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-28 02:46:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 161 transitions. [2019-11-28 02:46:13,239 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 161 transitions. Word has length 23 [2019-11-28 02:46:13,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:13,239 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 161 transitions. [2019-11-28 02:46:13,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:13,240 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2019-11-28 02:46:13,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:46:13,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:13,243 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:13,243 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:13,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:13,244 INFO L82 PathProgramCache]: Analyzing trace with hash -471898432, now seen corresponding path program 1 times [2019-11-28 02:46:13,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:13,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937488876] [2019-11-28 02:46:13,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:13,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937488876] [2019-11-28 02:46:13,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:13,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:13,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464156028] [2019-11-28 02:46:13,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:13,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:13,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:13,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:13,350 INFO L87 Difference]: Start difference. First operand 88 states and 161 transitions. Second operand 3 states. [2019-11-28 02:46:13,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:13,388 INFO L93 Difference]: Finished difference Result 93 states and 164 transitions. [2019-11-28 02:46:13,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:13,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 02:46:13,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:13,392 INFO L225 Difference]: With dead ends: 93 [2019-11-28 02:46:13,392 INFO L226 Difference]: Without dead ends: 93 [2019-11-28 02:46:13,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:13,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-28 02:46:13,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-11-28 02:46:13,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-28 02:46:13,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 163 transitions. [2019-11-28 02:46:13,415 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 163 transitions. Word has length 24 [2019-11-28 02:46:13,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:13,420 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 163 transitions. [2019-11-28 02:46:13,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:13,420 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2019-11-28 02:46:13,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:46:13,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:13,422 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:13,422 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:13,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:13,422 INFO L82 PathProgramCache]: Analyzing trace with hash -2060246334, now seen corresponding path program 1 times [2019-11-28 02:46:13,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:13,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738851742] [2019-11-28 02:46:13,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:13,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738851742] [2019-11-28 02:46:13,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:13,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:13,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213518691] [2019-11-28 02:46:13,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:13,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:13,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:13,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:13,500 INFO L87 Difference]: Start difference. First operand 91 states and 163 transitions. Second operand 3 states. [2019-11-28 02:46:13,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:13,524 INFO L93 Difference]: Finished difference Result 170 states and 309 transitions. [2019-11-28 02:46:13,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:13,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 02:46:13,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:13,528 INFO L225 Difference]: With dead ends: 170 [2019-11-28 02:46:13,528 INFO L226 Difference]: Without dead ends: 170 [2019-11-28 02:46:13,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:13,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-28 02:46:13,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2019-11-28 02:46:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 02:46:13,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 216 transitions. [2019-11-28 02:46:13,540 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 216 transitions. Word has length 24 [2019-11-28 02:46:13,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:13,540 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 216 transitions. [2019-11-28 02:46:13,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:13,540 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 216 transitions. [2019-11-28 02:46:13,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:46:13,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:13,542 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:13,542 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:13,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:13,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1213652608, now seen corresponding path program 1 times [2019-11-28 02:46:13,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:13,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127972234] [2019-11-28 02:46:13,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:13,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127972234] [2019-11-28 02:46:13,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:13,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:13,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862147621] [2019-11-28 02:46:13,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:13,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:13,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:13,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:13,598 INFO L87 Difference]: Start difference. First operand 120 states and 216 transitions. Second operand 3 states. [2019-11-28 02:46:13,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:13,618 INFO L93 Difference]: Finished difference Result 172 states and 307 transitions. [2019-11-28 02:46:13,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:13,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 02:46:13,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:13,620 INFO L225 Difference]: With dead ends: 172 [2019-11-28 02:46:13,621 INFO L226 Difference]: Without dead ends: 172 [2019-11-28 02:46:13,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:13,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-28 02:46:13,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2019-11-28 02:46:13,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-28 02:46:13,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 306 transitions. [2019-11-28 02:46:13,639 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 306 transitions. Word has length 24 [2019-11-28 02:46:13,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:13,641 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 306 transitions. [2019-11-28 02:46:13,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:13,641 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 306 transitions. [2019-11-28 02:46:13,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:46:13,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:13,645 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:13,645 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:13,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:13,646 INFO L82 PathProgramCache]: Analyzing trace with hash 557085835, now seen corresponding path program 1 times [2019-11-28 02:46:13,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:13,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464327246] [2019-11-28 02:46:13,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:13,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464327246] [2019-11-28 02:46:13,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:13,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:13,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434870757] [2019-11-28 02:46:13,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:13,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:13,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:13,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:13,744 INFO L87 Difference]: Start difference. First operand 170 states and 306 transitions. Second operand 3 states. [2019-11-28 02:46:13,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:13,767 INFO L93 Difference]: Finished difference Result 174 states and 307 transitions. [2019-11-28 02:46:13,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:13,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 02:46:13,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:13,773 INFO L225 Difference]: With dead ends: 174 [2019-11-28 02:46:13,773 INFO L226 Difference]: Without dead ends: 174 [2019-11-28 02:46:13,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:13,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-28 02:46:13,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2019-11-28 02:46:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-28 02:46:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 306 transitions. [2019-11-28 02:46:13,804 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 306 transitions. Word has length 25 [2019-11-28 02:46:13,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:13,804 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 306 transitions. [2019-11-28 02:46:13,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:13,805 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 306 transitions. [2019-11-28 02:46:13,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:46:13,808 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:13,808 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:13,808 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:13,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:13,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1031262067, now seen corresponding path program 1 times [2019-11-28 02:46:13,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:13,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582644972] [2019-11-28 02:46:13,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:13,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582644972] [2019-11-28 02:46:13,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:13,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:13,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715209094] [2019-11-28 02:46:13,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:13,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:13,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:13,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:13,882 INFO L87 Difference]: Start difference. First operand 172 states and 306 transitions. Second operand 3 states. [2019-11-28 02:46:13,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:13,898 INFO L93 Difference]: Finished difference Result 322 states and 579 transitions. [2019-11-28 02:46:13,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:13,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 02:46:13,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:13,902 INFO L225 Difference]: With dead ends: 322 [2019-11-28 02:46:13,902 INFO L226 Difference]: Without dead ends: 322 [2019-11-28 02:46:13,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:13,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-28 02:46:13,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 232. [2019-11-28 02:46:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-28 02:46:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2019-11-28 02:46:13,916 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 25 [2019-11-28 02:46:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:13,917 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2019-11-28 02:46:13,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:13,917 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2019-11-28 02:46:13,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:46:13,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:13,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:13,920 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:13,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:13,921 INFO L82 PathProgramCache]: Analyzing trace with hash -2052330421, now seen corresponding path program 1 times [2019-11-28 02:46:13,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:13,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342592879] [2019-11-28 02:46:13,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:13,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342592879] [2019-11-28 02:46:13,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:13,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:13,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975528950] [2019-11-28 02:46:13,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:13,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:13,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:13,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:13,952 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 3 states. [2019-11-28 02:46:13,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:13,976 INFO L93 Difference]: Finished difference Result 330 states and 579 transitions. [2019-11-28 02:46:13,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:13,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 02:46:13,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:13,979 INFO L225 Difference]: With dead ends: 330 [2019-11-28 02:46:13,980 INFO L226 Difference]: Without dead ends: 330 [2019-11-28 02:46:13,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:13,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-11-28 02:46:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2019-11-28 02:46:13,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-11-28 02:46:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 578 transitions. [2019-11-28 02:46:13,994 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 578 transitions. Word has length 25 [2019-11-28 02:46:13,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:13,995 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 578 transitions. [2019-11-28 02:46:13,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:13,995 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 578 transitions. [2019-11-28 02:46:14,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:46:14,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:14,006 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:14,006 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:14,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:14,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1904139915, now seen corresponding path program 1 times [2019-11-28 02:46:14,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:14,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44597638] [2019-11-28 02:46:14,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:14,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44597638] [2019-11-28 02:46:14,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:14,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:14,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804269183] [2019-11-28 02:46:14,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:14,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:14,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:14,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:14,050 INFO L87 Difference]: Start difference. First operand 328 states and 578 transitions. Second operand 3 states. [2019-11-28 02:46:14,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:14,065 INFO L93 Difference]: Finished difference Result 334 states and 579 transitions. [2019-11-28 02:46:14,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:14,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 02:46:14,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:14,068 INFO L225 Difference]: With dead ends: 334 [2019-11-28 02:46:14,068 INFO L226 Difference]: Without dead ends: 334 [2019-11-28 02:46:14,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:14,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-11-28 02:46:14,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2019-11-28 02:46:14,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-28 02:46:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 578 transitions. [2019-11-28 02:46:14,079 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 578 transitions. Word has length 26 [2019-11-28 02:46:14,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:14,080 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 578 transitions. [2019-11-28 02:46:14,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:14,080 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 578 transitions. [2019-11-28 02:46:14,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:46:14,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:14,082 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:14,083 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:14,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:14,083 INFO L82 PathProgramCache]: Analyzing trace with hash 802479479, now seen corresponding path program 1 times [2019-11-28 02:46:14,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:14,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393404628] [2019-11-28 02:46:14,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:14,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393404628] [2019-11-28 02:46:14,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:14,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:14,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269091420] [2019-11-28 02:46:14,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:14,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:14,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:14,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:14,125 INFO L87 Difference]: Start difference. First operand 332 states and 578 transitions. Second operand 3 states. [2019-11-28 02:46:14,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:14,144 INFO L93 Difference]: Finished difference Result 618 states and 1087 transitions. [2019-11-28 02:46:14,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:14,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 02:46:14,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:14,149 INFO L225 Difference]: With dead ends: 618 [2019-11-28 02:46:14,150 INFO L226 Difference]: Without dead ends: 618 [2019-11-28 02:46:14,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:14,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-11-28 02:46:14,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 456. [2019-11-28 02:46:14,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-11-28 02:46:14,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 782 transitions. [2019-11-28 02:46:14,166 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 782 transitions. Word has length 26 [2019-11-28 02:46:14,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:14,166 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 782 transitions. [2019-11-28 02:46:14,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:14,167 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 782 transitions. [2019-11-28 02:46:14,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:46:14,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:14,169 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:14,169 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:14,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:14,170 INFO L82 PathProgramCache]: Analyzing trace with hash -218588875, now seen corresponding path program 1 times [2019-11-28 02:46:14,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:14,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270893773] [2019-11-28 02:46:14,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:14,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270893773] [2019-11-28 02:46:14,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:14,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:14,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138178713] [2019-11-28 02:46:14,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:14,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:14,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:14,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:14,198 INFO L87 Difference]: Start difference. First operand 456 states and 782 transitions. Second operand 3 states. [2019-11-28 02:46:14,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:14,218 INFO L93 Difference]: Finished difference Result 642 states and 1095 transitions. [2019-11-28 02:46:14,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:14,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 02:46:14,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:14,222 INFO L225 Difference]: With dead ends: 642 [2019-11-28 02:46:14,223 INFO L226 Difference]: Without dead ends: 642 [2019-11-28 02:46:14,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:14,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-11-28 02:46:14,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2019-11-28 02:46:14,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-11-28 02:46:14,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1094 transitions. [2019-11-28 02:46:14,241 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1094 transitions. Word has length 26 [2019-11-28 02:46:14,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:14,242 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 1094 transitions. [2019-11-28 02:46:14,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:14,242 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1094 transitions. [2019-11-28 02:46:14,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:46:14,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:14,244 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:14,244 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:14,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:14,245 INFO L82 PathProgramCache]: Analyzing trace with hash -892726496, now seen corresponding path program 1 times [2019-11-28 02:46:14,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:14,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137107678] [2019-11-28 02:46:14,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:14,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137107678] [2019-11-28 02:46:14,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:14,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:14,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776329601] [2019-11-28 02:46:14,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:14,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:14,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:14,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:14,274 INFO L87 Difference]: Start difference. First operand 640 states and 1094 transitions. Second operand 3 states. [2019-11-28 02:46:14,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:14,293 INFO L93 Difference]: Finished difference Result 650 states and 1095 transitions. [2019-11-28 02:46:14,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:14,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 02:46:14,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:14,298 INFO L225 Difference]: With dead ends: 650 [2019-11-28 02:46:14,298 INFO L226 Difference]: Without dead ends: 650 [2019-11-28 02:46:14,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:14,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-11-28 02:46:14,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2019-11-28 02:46:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-11-28 02:46:14,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1094 transitions. [2019-11-28 02:46:14,317 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1094 transitions. Word has length 27 [2019-11-28 02:46:14,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:14,318 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 1094 transitions. [2019-11-28 02:46:14,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:14,318 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1094 transitions. [2019-11-28 02:46:14,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:46:14,319 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:14,320 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:14,320 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:14,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:14,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1813892898, now seen corresponding path program 1 times [2019-11-28 02:46:14,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:14,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282857502] [2019-11-28 02:46:14,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:14,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282857502] [2019-11-28 02:46:14,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:14,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:14,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209383673] [2019-11-28 02:46:14,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:14,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:14,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:14,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:14,348 INFO L87 Difference]: Start difference. First operand 648 states and 1094 transitions. Second operand 3 states. [2019-11-28 02:46:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:14,366 INFO L93 Difference]: Finished difference Result 1194 states and 2039 transitions. [2019-11-28 02:46:14,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:14,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 02:46:14,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:14,373 INFO L225 Difference]: With dead ends: 1194 [2019-11-28 02:46:14,373 INFO L226 Difference]: Without dead ends: 1194 [2019-11-28 02:46:14,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:14,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2019-11-28 02:46:14,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 904. [2019-11-28 02:46:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-11-28 02:46:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1494 transitions. [2019-11-28 02:46:14,400 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1494 transitions. Word has length 27 [2019-11-28 02:46:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:14,401 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1494 transitions. [2019-11-28 02:46:14,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1494 transitions. [2019-11-28 02:46:14,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:46:14,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:14,403 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:14,404 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:14,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:14,404 INFO L82 PathProgramCache]: Analyzing trace with hash 792824544, now seen corresponding path program 1 times [2019-11-28 02:46:14,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:14,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733871464] [2019-11-28 02:46:14,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:14,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733871464] [2019-11-28 02:46:14,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:14,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:14,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487432664] [2019-11-28 02:46:14,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:14,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:14,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:14,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:14,428 INFO L87 Difference]: Start difference. First operand 904 states and 1494 transitions. Second operand 3 states. [2019-11-28 02:46:14,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:14,448 INFO L93 Difference]: Finished difference Result 1258 states and 2071 transitions. [2019-11-28 02:46:14,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:14,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 02:46:14,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:14,454 INFO L225 Difference]: With dead ends: 1258 [2019-11-28 02:46:14,455 INFO L226 Difference]: Without dead ends: 1258 [2019-11-28 02:46:14,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:14,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-11-28 02:46:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2019-11-28 02:46:14,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-11-28 02:46:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2070 transitions. [2019-11-28 02:46:14,488 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2070 transitions. Word has length 27 [2019-11-28 02:46:14,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:14,488 INFO L462 AbstractCegarLoop]: Abstraction has 1256 states and 2070 transitions. [2019-11-28 02:46:14,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:14,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2070 transitions. [2019-11-28 02:46:14,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 02:46:14,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:14,491 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:14,491 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:14,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:14,492 INFO L82 PathProgramCache]: Analyzing trace with hash 396318762, now seen corresponding path program 1 times [2019-11-28 02:46:14,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:14,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522851295] [2019-11-28 02:46:14,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:14,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522851295] [2019-11-28 02:46:14,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:14,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:14,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831733795] [2019-11-28 02:46:14,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:14,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:14,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:14,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:14,519 INFO L87 Difference]: Start difference. First operand 1256 states and 2070 transitions. Second operand 3 states. [2019-11-28 02:46:14,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:14,538 INFO L93 Difference]: Finished difference Result 1274 states and 2071 transitions. [2019-11-28 02:46:14,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:14,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-28 02:46:14,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:14,544 INFO L225 Difference]: With dead ends: 1274 [2019-11-28 02:46:14,545 INFO L226 Difference]: Without dead ends: 1274 [2019-11-28 02:46:14,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:14,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-11-28 02:46:14,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2019-11-28 02:46:14,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-11-28 02:46:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2070 transitions. [2019-11-28 02:46:14,578 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2070 transitions. Word has length 28 [2019-11-28 02:46:14,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:14,578 INFO L462 AbstractCegarLoop]: Abstraction has 1272 states and 2070 transitions. [2019-11-28 02:46:14,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2070 transitions. [2019-11-28 02:46:14,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 02:46:14,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:14,581 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:14,581 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:14,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:14,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1192029140, now seen corresponding path program 1 times [2019-11-28 02:46:14,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:14,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382800871] [2019-11-28 02:46:14,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:14,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382800871] [2019-11-28 02:46:14,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:14,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:14,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955571582] [2019-11-28 02:46:14,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:14,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:14,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:14,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:14,619 INFO L87 Difference]: Start difference. First operand 1272 states and 2070 transitions. Second operand 3 states. [2019-11-28 02:46:14,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:14,648 INFO L93 Difference]: Finished difference Result 2314 states and 3815 transitions. [2019-11-28 02:46:14,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:14,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-28 02:46:14,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:14,661 INFO L225 Difference]: With dead ends: 2314 [2019-11-28 02:46:14,661 INFO L226 Difference]: Without dead ends: 2314 [2019-11-28 02:46:14,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-11-28 02:46:14,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1800. [2019-11-28 02:46:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2019-11-28 02:46:14,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2854 transitions. [2019-11-28 02:46:14,712 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2854 transitions. Word has length 28 [2019-11-28 02:46:14,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:14,713 INFO L462 AbstractCegarLoop]: Abstraction has 1800 states and 2854 transitions. [2019-11-28 02:46:14,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:14,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2854 transitions. [2019-11-28 02:46:14,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 02:46:14,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:14,717 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:14,719 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:14,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:14,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2081869802, now seen corresponding path program 1 times [2019-11-28 02:46:14,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:14,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280302069] [2019-11-28 02:46:14,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:14,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280302069] [2019-11-28 02:46:14,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:14,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:14,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402705018] [2019-11-28 02:46:14,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:14,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:14,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:14,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:14,752 INFO L87 Difference]: Start difference. First operand 1800 states and 2854 transitions. Second operand 3 states. [2019-11-28 02:46:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:14,783 INFO L93 Difference]: Finished difference Result 2474 states and 3911 transitions. [2019-11-28 02:46:14,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:14,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-28 02:46:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:14,796 INFO L225 Difference]: With dead ends: 2474 [2019-11-28 02:46:14,796 INFO L226 Difference]: Without dead ends: 2474 [2019-11-28 02:46:14,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:14,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2019-11-28 02:46:14,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2472. [2019-11-28 02:46:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-11-28 02:46:14,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3910 transitions. [2019-11-28 02:46:14,862 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3910 transitions. Word has length 28 [2019-11-28 02:46:14,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:14,862 INFO L462 AbstractCegarLoop]: Abstraction has 2472 states and 3910 transitions. [2019-11-28 02:46:14,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3910 transitions. [2019-11-28 02:46:14,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 02:46:14,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:14,867 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:14,867 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:14,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:14,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1702016437, now seen corresponding path program 1 times [2019-11-28 02:46:14,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:14,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417307988] [2019-11-28 02:46:14,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:14,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417307988] [2019-11-28 02:46:14,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:14,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:14,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495621879] [2019-11-28 02:46:14,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:14,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:14,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:14,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:14,899 INFO L87 Difference]: Start difference. First operand 2472 states and 3910 transitions. Second operand 3 states. [2019-11-28 02:46:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:14,930 INFO L93 Difference]: Finished difference Result 2506 states and 3911 transitions. [2019-11-28 02:46:14,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:14,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 02:46:14,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:14,944 INFO L225 Difference]: With dead ends: 2506 [2019-11-28 02:46:14,945 INFO L226 Difference]: Without dead ends: 2506 [2019-11-28 02:46:14,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:14,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-11-28 02:46:14,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2019-11-28 02:46:14,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-11-28 02:46:15,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3910 transitions. [2019-11-28 02:46:15,039 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3910 transitions. Word has length 29 [2019-11-28 02:46:15,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:15,039 INFO L462 AbstractCegarLoop]: Abstraction has 2504 states and 3910 transitions. [2019-11-28 02:46:15,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:15,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3910 transitions. [2019-11-28 02:46:15,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 02:46:15,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:15,043 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:15,043 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:15,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:15,044 INFO L82 PathProgramCache]: Analyzing trace with hash 113668535, now seen corresponding path program 1 times [2019-11-28 02:46:15,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:15,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215079286] [2019-11-28 02:46:15,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:15,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215079286] [2019-11-28 02:46:15,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:15,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:15,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894148831] [2019-11-28 02:46:15,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:15,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:15,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:15,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:15,073 INFO L87 Difference]: Start difference. First operand 2504 states and 3910 transitions. Second operand 3 states. [2019-11-28 02:46:15,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:15,135 INFO L93 Difference]: Finished difference Result 4490 states and 7111 transitions. [2019-11-28 02:46:15,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:15,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 02:46:15,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:15,162 INFO L225 Difference]: With dead ends: 4490 [2019-11-28 02:46:15,163 INFO L226 Difference]: Without dead ends: 4490 [2019-11-28 02:46:15,163 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:15,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2019-11-28 02:46:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3592. [2019-11-28 02:46:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2019-11-28 02:46:15,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5446 transitions. [2019-11-28 02:46:15,274 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5446 transitions. Word has length 29 [2019-11-28 02:46:15,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:15,275 INFO L462 AbstractCegarLoop]: Abstraction has 3592 states and 5446 transitions. [2019-11-28 02:46:15,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5446 transitions. [2019-11-28 02:46:15,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 02:46:15,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:15,284 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:15,285 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:15,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:15,286 INFO L82 PathProgramCache]: Analyzing trace with hash -907399819, now seen corresponding path program 1 times [2019-11-28 02:46:15,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:15,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779427762] [2019-11-28 02:46:15,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:15,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:15,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779427762] [2019-11-28 02:46:15,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:15,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:15,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954663529] [2019-11-28 02:46:15,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:15,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:15,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:15,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:15,332 INFO L87 Difference]: Start difference. First operand 3592 states and 5446 transitions. Second operand 3 states. [2019-11-28 02:46:15,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:15,379 INFO L93 Difference]: Finished difference Result 4874 states and 7367 transitions. [2019-11-28 02:46:15,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:15,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 02:46:15,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:15,436 INFO L225 Difference]: With dead ends: 4874 [2019-11-28 02:46:15,437 INFO L226 Difference]: Without dead ends: 4874 [2019-11-28 02:46:15,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:15,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2019-11-28 02:46:15,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4872. [2019-11-28 02:46:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2019-11-28 02:46:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 7366 transitions. [2019-11-28 02:46:15,545 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 7366 transitions. Word has length 29 [2019-11-28 02:46:15,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:15,546 INFO L462 AbstractCegarLoop]: Abstraction has 4872 states and 7366 transitions. [2019-11-28 02:46:15,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:15,546 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 7366 transitions. [2019-11-28 02:46:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 02:46:15,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:15,554 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:15,555 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:15,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:15,557 INFO L82 PathProgramCache]: Analyzing trace with hash -771028257, now seen corresponding path program 1 times [2019-11-28 02:46:15,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:15,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559508797] [2019-11-28 02:46:15,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:15,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559508797] [2019-11-28 02:46:15,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:15,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:15,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938768329] [2019-11-28 02:46:15,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:15,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:15,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:15,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:15,587 INFO L87 Difference]: Start difference. First operand 4872 states and 7366 transitions. Second operand 3 states. [2019-11-28 02:46:15,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:15,622 INFO L93 Difference]: Finished difference Result 4938 states and 7367 transitions. [2019-11-28 02:46:15,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:15,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-28 02:46:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:15,635 INFO L225 Difference]: With dead ends: 4938 [2019-11-28 02:46:15,635 INFO L226 Difference]: Without dead ends: 4938 [2019-11-28 02:46:15,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:15,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2019-11-28 02:46:15,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4936. [2019-11-28 02:46:15,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4936 states. [2019-11-28 02:46:15,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4936 states to 4936 states and 7366 transitions. [2019-11-28 02:46:15,733 INFO L78 Accepts]: Start accepts. Automaton has 4936 states and 7366 transitions. Word has length 30 [2019-11-28 02:46:15,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:15,733 INFO L462 AbstractCegarLoop]: Abstraction has 4936 states and 7366 transitions. [2019-11-28 02:46:15,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:15,734 INFO L276 IsEmpty]: Start isEmpty. Operand 4936 states and 7366 transitions. [2019-11-28 02:46:15,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 02:46:15,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:15,741 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:15,741 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:15,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:15,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1935591137, now seen corresponding path program 1 times [2019-11-28 02:46:15,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:15,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689363838] [2019-11-28 02:46:15,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:15,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689363838] [2019-11-28 02:46:15,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:15,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:15,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949536390] [2019-11-28 02:46:15,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:15,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:15,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:15,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:15,766 INFO L87 Difference]: Start difference. First operand 4936 states and 7366 transitions. Second operand 3 states. [2019-11-28 02:46:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:15,821 INFO L93 Difference]: Finished difference Result 9610 states and 13959 transitions. [2019-11-28 02:46:15,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:15,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-28 02:46:15,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:15,846 INFO L225 Difference]: With dead ends: 9610 [2019-11-28 02:46:15,846 INFO L226 Difference]: Without dead ends: 9610 [2019-11-28 02:46:15,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:15,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2019-11-28 02:46:15,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 9608. [2019-11-28 02:46:15,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2019-11-28 02:46:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13958 transitions. [2019-11-28 02:46:15,998 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13958 transitions. Word has length 30 [2019-11-28 02:46:15,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:15,999 INFO L462 AbstractCegarLoop]: Abstraction has 9608 states and 13958 transitions. [2019-11-28 02:46:15,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13958 transitions. [2019-11-28 02:46:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 02:46:16,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:16,011 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:16,011 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:16,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:16,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1338307805, now seen corresponding path program 1 times [2019-11-28 02:46:16,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:16,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783945907] [2019-11-28 02:46:16,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:16,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783945907] [2019-11-28 02:46:16,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:16,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:16,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951199591] [2019-11-28 02:46:16,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:16,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:16,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:16,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:16,058 INFO L87 Difference]: Start difference. First operand 9608 states and 13958 transitions. Second operand 3 states. [2019-11-28 02:46:16,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:16,109 INFO L93 Difference]: Finished difference Result 11146 states and 16647 transitions. [2019-11-28 02:46:16,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:16,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-28 02:46:16,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:16,133 INFO L225 Difference]: With dead ends: 11146 [2019-11-28 02:46:16,133 INFO L226 Difference]: Without dead ends: 11146 [2019-11-28 02:46:16,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:16,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2019-11-28 02:46:16,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 9608. [2019-11-28 02:46:16,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2019-11-28 02:46:16,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13830 transitions. [2019-11-28 02:46:16,298 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13830 transitions. Word has length 30 [2019-11-28 02:46:16,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:16,299 INFO L462 AbstractCegarLoop]: Abstraction has 9608 states and 13830 transitions. [2019-11-28 02:46:16,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:16,300 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13830 transitions. [2019-11-28 02:46:16,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 02:46:16,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:16,316 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:16,317 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:16,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:16,318 INFO L82 PathProgramCache]: Analyzing trace with hash -126002102, now seen corresponding path program 1 times [2019-11-28 02:46:16,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:16,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710316343] [2019-11-28 02:46:16,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:16,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710316343] [2019-11-28 02:46:16,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:16,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:16,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081720397] [2019-11-28 02:46:16,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:16,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:16,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:16,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:16,350 INFO L87 Difference]: Start difference. First operand 9608 states and 13830 transitions. Second operand 3 states. [2019-11-28 02:46:16,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:16,417 INFO L93 Difference]: Finished difference Result 16778 states and 24455 transitions. [2019-11-28 02:46:16,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:16,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-28 02:46:16,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:16,451 INFO L225 Difference]: With dead ends: 16778 [2019-11-28 02:46:16,452 INFO L226 Difference]: Without dead ends: 16778 [2019-11-28 02:46:16,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:16,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16778 states. [2019-11-28 02:46:16,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16778 to 14216. [2019-11-28 02:46:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-11-28 02:46:16,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 19846 transitions. [2019-11-28 02:46:16,738 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 19846 transitions. Word has length 31 [2019-11-28 02:46:16,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:16,739 INFO L462 AbstractCegarLoop]: Abstraction has 14216 states and 19846 transitions. [2019-11-28 02:46:16,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:16,739 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 19846 transitions. [2019-11-28 02:46:16,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 02:46:16,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:16,759 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:16,759 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:16,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:16,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1147070456, now seen corresponding path program 1 times [2019-11-28 02:46:16,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:16,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461625332] [2019-11-28 02:46:16,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:16,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461625332] [2019-11-28 02:46:16,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:16,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:16,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077094584] [2019-11-28 02:46:16,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:16,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:16,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:16,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:16,782 INFO L87 Difference]: Start difference. First operand 14216 states and 19846 transitions. Second operand 3 states. [2019-11-28 02:46:16,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:16,841 INFO L93 Difference]: Finished difference Result 18826 states and 26119 transitions. [2019-11-28 02:46:16,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:16,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-28 02:46:16,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:16,876 INFO L225 Difference]: With dead ends: 18826 [2019-11-28 02:46:16,876 INFO L226 Difference]: Without dead ends: 18826 [2019-11-28 02:46:16,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:16,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18826 states. [2019-11-28 02:46:17,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18826 to 18824. [2019-11-28 02:46:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18824 states. [2019-11-28 02:46:17,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18824 states to 18824 states and 26118 transitions. [2019-11-28 02:46:17,102 INFO L78 Accepts]: Start accepts. Automaton has 18824 states and 26118 transitions. Word has length 31 [2019-11-28 02:46:17,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:17,102 INFO L462 AbstractCegarLoop]: Abstraction has 18824 states and 26118 transitions. [2019-11-28 02:46:17,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:17,103 INFO L276 IsEmpty]: Start isEmpty. Operand 18824 states and 26118 transitions. [2019-11-28 02:46:17,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 02:46:17,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:17,124 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:17,124 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:17,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:17,124 INFO L82 PathProgramCache]: Analyzing trace with hash 389117270, now seen corresponding path program 1 times [2019-11-28 02:46:17,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:17,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213322185] [2019-11-28 02:46:17,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:17,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213322185] [2019-11-28 02:46:17,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:17,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:17,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445061328] [2019-11-28 02:46:17,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:17,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:17,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:17,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:17,145 INFO L87 Difference]: Start difference. First operand 18824 states and 26118 transitions. Second operand 3 states. [2019-11-28 02:46:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:17,200 INFO L93 Difference]: Finished difference Result 19210 states and 26375 transitions. [2019-11-28 02:46:17,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:17,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-28 02:46:17,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:17,234 INFO L225 Difference]: With dead ends: 19210 [2019-11-28 02:46:17,234 INFO L226 Difference]: Without dead ends: 19210 [2019-11-28 02:46:17,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:17,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19210 states. [2019-11-28 02:46:17,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19210 to 19208. [2019-11-28 02:46:17,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19208 states. [2019-11-28 02:46:17,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19208 states to 19208 states and 26374 transitions. [2019-11-28 02:46:17,470 INFO L78 Accepts]: Start accepts. Automaton has 19208 states and 26374 transitions. Word has length 32 [2019-11-28 02:46:17,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:17,471 INFO L462 AbstractCegarLoop]: Abstraction has 19208 states and 26374 transitions. [2019-11-28 02:46:17,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:17,471 INFO L276 IsEmpty]: Start isEmpty. Operand 19208 states and 26374 transitions. [2019-11-28 02:46:17,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 02:46:17,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:17,500 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:17,500 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:17,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:17,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1199230632, now seen corresponding path program 1 times [2019-11-28 02:46:17,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:17,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339822111] [2019-11-28 02:46:17,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:17,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339822111] [2019-11-28 02:46:17,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:17,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:17,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321081954] [2019-11-28 02:46:17,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:17,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:17,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:17,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:17,527 INFO L87 Difference]: Start difference. First operand 19208 states and 26374 transitions. Second operand 3 states. [2019-11-28 02:46:17,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:17,621 INFO L93 Difference]: Finished difference Result 32778 states and 45319 transitions. [2019-11-28 02:46:17,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:17,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-28 02:46:17,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:17,703 INFO L225 Difference]: With dead ends: 32778 [2019-11-28 02:46:17,703 INFO L226 Difference]: Without dead ends: 32778 [2019-11-28 02:46:17,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:17,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32778 states. [2019-11-28 02:46:18,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32778 to 28680. [2019-11-28 02:46:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28680 states. [2019-11-28 02:46:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28680 states to 28680 states and 38150 transitions. [2019-11-28 02:46:18,196 INFO L78 Accepts]: Start accepts. Automaton has 28680 states and 38150 transitions. Word has length 32 [2019-11-28 02:46:18,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:18,197 INFO L462 AbstractCegarLoop]: Abstraction has 28680 states and 38150 transitions. [2019-11-28 02:46:18,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 28680 states and 38150 transitions. [2019-11-28 02:46:18,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 02:46:18,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:18,226 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:18,227 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:18,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:18,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2074668310, now seen corresponding path program 1 times [2019-11-28 02:46:18,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:18,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056375809] [2019-11-28 02:46:18,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:18,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:18,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056375809] [2019-11-28 02:46:18,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:18,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:18,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477363832] [2019-11-28 02:46:18,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:18,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:18,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:18,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:18,252 INFO L87 Difference]: Start difference. First operand 28680 states and 38150 transitions. Second operand 3 states. [2019-11-28 02:46:18,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:18,340 INFO L93 Difference]: Finished difference Result 37386 states and 49159 transitions. [2019-11-28 02:46:18,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:18,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-28 02:46:18,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:18,418 INFO L225 Difference]: With dead ends: 37386 [2019-11-28 02:46:18,418 INFO L226 Difference]: Without dead ends: 37386 [2019-11-28 02:46:18,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:18,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37386 states. [2019-11-28 02:46:19,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37386 to 37384. [2019-11-28 02:46:19,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37384 states. [2019-11-28 02:46:19,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37384 states to 37384 states and 49158 transitions. [2019-11-28 02:46:19,131 INFO L78 Accepts]: Start accepts. Automaton has 37384 states and 49158 transitions. Word has length 32 [2019-11-28 02:46:19,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:19,131 INFO L462 AbstractCegarLoop]: Abstraction has 37384 states and 49158 transitions. [2019-11-28 02:46:19,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:19,132 INFO L276 IsEmpty]: Start isEmpty. Operand 37384 states and 49158 transitions. [2019-11-28 02:46:19,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 02:46:19,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:19,157 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:19,157 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:19,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:19,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1478771549, now seen corresponding path program 1 times [2019-11-28 02:46:19,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:19,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997434309] [2019-11-28 02:46:19,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:19,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:19,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997434309] [2019-11-28 02:46:19,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:19,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:19,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991344418] [2019-11-28 02:46:19,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:19,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:19,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:19,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:19,190 INFO L87 Difference]: Start difference. First operand 37384 states and 49158 transitions. Second operand 3 states. [2019-11-28 02:46:19,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:19,288 INFO L93 Difference]: Finished difference Result 37898 states and 49159 transitions. [2019-11-28 02:46:19,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:19,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-28 02:46:19,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:19,335 INFO L225 Difference]: With dead ends: 37898 [2019-11-28 02:46:19,335 INFO L226 Difference]: Without dead ends: 37898 [2019-11-28 02:46:19,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:19,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37898 states. [2019-11-28 02:46:19,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37898 to 37896. [2019-11-28 02:46:19,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37896 states. [2019-11-28 02:46:19,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37896 states to 37896 states and 49158 transitions. [2019-11-28 02:46:19,797 INFO L78 Accepts]: Start accepts. Automaton has 37896 states and 49158 transitions. Word has length 33 [2019-11-28 02:46:19,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:19,798 INFO L462 AbstractCegarLoop]: Abstraction has 37896 states and 49158 transitions. [2019-11-28 02:46:19,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:19,798 INFO L276 IsEmpty]: Start isEmpty. Operand 37896 states and 49158 transitions. [2019-11-28 02:46:19,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 02:46:19,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:19,822 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:19,823 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:19,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:19,823 INFO L82 PathProgramCache]: Analyzing trace with hash -109576353, now seen corresponding path program 1 times [2019-11-28 02:46:19,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:19,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308477694] [2019-11-28 02:46:19,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:19,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:19,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308477694] [2019-11-28 02:46:19,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:19,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:19,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015608301] [2019-11-28 02:46:19,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:19,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:19,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:19,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:19,847 INFO L87 Difference]: Start difference. First operand 37896 states and 49158 transitions. Second operand 3 states. [2019-11-28 02:46:19,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:19,980 INFO L93 Difference]: Finished difference Result 63498 states and 82439 transitions. [2019-11-28 02:46:19,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:19,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-28 02:46:19,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:20,054 INFO L225 Difference]: With dead ends: 63498 [2019-11-28 02:46:20,055 INFO L226 Difference]: Without dead ends: 63498 [2019-11-28 02:46:20,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:20,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63498 states. [2019-11-28 02:46:21,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63498 to 57352. [2019-11-28 02:46:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57352 states. [2019-11-28 02:46:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57352 states to 57352 states and 72198 transitions. [2019-11-28 02:46:21,432 INFO L78 Accepts]: Start accepts. Automaton has 57352 states and 72198 transitions. Word has length 33 [2019-11-28 02:46:21,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:21,433 INFO L462 AbstractCegarLoop]: Abstraction has 57352 states and 72198 transitions. [2019-11-28 02:46:21,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:21,433 INFO L276 IsEmpty]: Start isEmpty. Operand 57352 states and 72198 transitions. [2019-11-28 02:46:21,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 02:46:21,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:21,491 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:21,491 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:21,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:21,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1130644707, now seen corresponding path program 1 times [2019-11-28 02:46:21,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:21,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412779087] [2019-11-28 02:46:21,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:21,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:21,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412779087] [2019-11-28 02:46:21,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:21,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:21,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249194573] [2019-11-28 02:46:21,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:21,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:21,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:21,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:21,551 INFO L87 Difference]: Start difference. First operand 57352 states and 72198 transitions. Second operand 3 states. [2019-11-28 02:46:21,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:21,799 INFO L93 Difference]: Finished difference Result 73738 states and 91143 transitions. [2019-11-28 02:46:21,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:21,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-28 02:46:21,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:21,898 INFO L225 Difference]: With dead ends: 73738 [2019-11-28 02:46:21,898 INFO L226 Difference]: Without dead ends: 73738 [2019-11-28 02:46:21,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:21,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73738 states. [2019-11-28 02:46:23,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73738 to 73736. [2019-11-28 02:46:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73736 states. [2019-11-28 02:46:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73736 states to 73736 states and 91142 transitions. [2019-11-28 02:46:23,222 INFO L78 Accepts]: Start accepts. Automaton has 73736 states and 91142 transitions. Word has length 33 [2019-11-28 02:46:23,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:23,223 INFO L462 AbstractCegarLoop]: Abstraction has 73736 states and 91142 transitions. [2019-11-28 02:46:23,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 73736 states and 91142 transitions. [2019-11-28 02:46:23,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 02:46:23,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:23,288 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:23,289 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:23,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:23,290 INFO L82 PathProgramCache]: Analyzing trace with hash 898316171, now seen corresponding path program 1 times [2019-11-28 02:46:23,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:23,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890015423] [2019-11-28 02:46:23,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:23,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890015423] [2019-11-28 02:46:23,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:23,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:23,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110160081] [2019-11-28 02:46:23,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:23,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:23,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:23,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:23,325 INFO L87 Difference]: Start difference. First operand 73736 states and 91142 transitions. Second operand 3 states. [2019-11-28 02:46:23,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:23,568 INFO L93 Difference]: Finished difference Result 74762 states and 91143 transitions. [2019-11-28 02:46:23,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:23,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-28 02:46:23,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:23,665 INFO L225 Difference]: With dead ends: 74762 [2019-11-28 02:46:23,665 INFO L226 Difference]: Without dead ends: 74762 [2019-11-28 02:46:23,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:23,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74762 states. [2019-11-28 02:46:24,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74762 to 74760. [2019-11-28 02:46:24,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74760 states. [2019-11-28 02:46:24,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74760 states to 74760 states and 91142 transitions. [2019-11-28 02:46:24,483 INFO L78 Accepts]: Start accepts. Automaton has 74760 states and 91142 transitions. Word has length 34 [2019-11-28 02:46:24,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:24,483 INFO L462 AbstractCegarLoop]: Abstraction has 74760 states and 91142 transitions. [2019-11-28 02:46:24,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:24,483 INFO L276 IsEmpty]: Start isEmpty. Operand 74760 states and 91142 transitions. [2019-11-28 02:46:24,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 02:46:24,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:24,522 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:24,522 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:24,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:24,523 INFO L82 PathProgramCache]: Analyzing trace with hash -690031731, now seen corresponding path program 1 times [2019-11-28 02:46:24,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:24,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30558072] [2019-11-28 02:46:24,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:24,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30558072] [2019-11-28 02:46:24,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:24,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:24,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893707059] [2019-11-28 02:46:24,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:24,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:24,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:24,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:24,544 INFO L87 Difference]: Start difference. First operand 74760 states and 91142 transitions. Second operand 3 states. [2019-11-28 02:46:24,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:24,813 INFO L93 Difference]: Finished difference Result 122890 states and 148487 transitions. [2019-11-28 02:46:24,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:24,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-28 02:46:24,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:24,942 INFO L225 Difference]: With dead ends: 122890 [2019-11-28 02:46:24,943 INFO L226 Difference]: Without dead ends: 122890 [2019-11-28 02:46:24,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:25,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122890 states. [2019-11-28 02:46:26,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122890 to 114696. [2019-11-28 02:46:26,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114696 states. [2019-11-28 02:46:26,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114696 states to 114696 states and 136198 transitions. [2019-11-28 02:46:26,882 INFO L78 Accepts]: Start accepts. Automaton has 114696 states and 136198 transitions. Word has length 34 [2019-11-28 02:46:26,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:26,883 INFO L462 AbstractCegarLoop]: Abstraction has 114696 states and 136198 transitions. [2019-11-28 02:46:26,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:26,883 INFO L276 IsEmpty]: Start isEmpty. Operand 114696 states and 136198 transitions. [2019-11-28 02:46:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 02:46:26,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:26,940 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:26,941 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:26,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:26,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1711100085, now seen corresponding path program 1 times [2019-11-28 02:46:26,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:26,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579404641] [2019-11-28 02:46:26,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:26,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579404641] [2019-11-28 02:46:26,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:26,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:26,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260085558] [2019-11-28 02:46:26,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:26,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:26,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:26,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,962 INFO L87 Difference]: Start difference. First operand 114696 states and 136198 transitions. Second operand 3 states. [2019-11-28 02:46:27,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:27,271 INFO L93 Difference]: Finished difference Result 145418 states and 167943 transitions. [2019-11-28 02:46:27,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:27,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-28 02:46:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:27,444 INFO L225 Difference]: With dead ends: 145418 [2019-11-28 02:46:27,444 INFO L226 Difference]: Without dead ends: 145418 [2019-11-28 02:46:27,444 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145418 states. [2019-11-28 02:46:30,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145418 to 145416. [2019-11-28 02:46:30,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145416 states. [2019-11-28 02:46:31,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145416 states to 145416 states and 167942 transitions. [2019-11-28 02:46:31,202 INFO L78 Accepts]: Start accepts. Automaton has 145416 states and 167942 transitions. Word has length 34 [2019-11-28 02:46:31,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:31,203 INFO L462 AbstractCegarLoop]: Abstraction has 145416 states and 167942 transitions. [2019-11-28 02:46:31,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:31,203 INFO L276 IsEmpty]: Start isEmpty. Operand 145416 states and 167942 transitions. [2019-11-28 02:46:31,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 02:46:31,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:31,262 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:31,262 INFO L410 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:31,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:31,262 INFO L82 PathProgramCache]: Analyzing trace with hash 84068978, now seen corresponding path program 1 times [2019-11-28 02:46:31,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:31,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188932398] [2019-11-28 02:46:31,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:31,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:31,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188932398] [2019-11-28 02:46:31,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:31,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:31,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255107790] [2019-11-28 02:46:31,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:31,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:31,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:31,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:31,287 INFO L87 Difference]: Start difference. First operand 145416 states and 167942 transitions. Second operand 3 states. [2019-11-28 02:46:31,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:31,664 INFO L93 Difference]: Finished difference Result 147466 states and 167943 transitions. [2019-11-28 02:46:31,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:31,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-28 02:46:31,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:31,810 INFO L225 Difference]: With dead ends: 147466 [2019-11-28 02:46:31,810 INFO L226 Difference]: Without dead ends: 147466 [2019-11-28 02:46:31,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:31,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2019-11-28 02:46:33,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 147464. [2019-11-28 02:46:33,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147464 states. [2019-11-28 02:46:33,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147464 states to 147464 states and 167942 transitions. [2019-11-28 02:46:33,628 INFO L78 Accepts]: Start accepts. Automaton has 147464 states and 167942 transitions. Word has length 35 [2019-11-28 02:46:33,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:33,628 INFO L462 AbstractCegarLoop]: Abstraction has 147464 states and 167942 transitions. [2019-11-28 02:46:33,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:33,629 INFO L276 IsEmpty]: Start isEmpty. Operand 147464 states and 167942 transitions. [2019-11-28 02:46:33,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 02:46:33,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:33,683 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:33,683 INFO L410 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:33,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:33,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1504278924, now seen corresponding path program 1 times [2019-11-28 02:46:33,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:33,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508079641] [2019-11-28 02:46:33,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:33,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:33,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508079641] [2019-11-28 02:46:33,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:33,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:33,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024693093] [2019-11-28 02:46:33,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:33,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:33,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:33,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:33,703 INFO L87 Difference]: Start difference. First operand 147464 states and 167942 transitions. Second operand 3 states. [2019-11-28 02:46:34,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:34,201 INFO L93 Difference]: Finished difference Result 237576 states and 264198 transitions. [2019-11-28 02:46:34,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:34,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-28 02:46:34,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:34,484 INFO L225 Difference]: With dead ends: 237576 [2019-11-28 02:46:34,484 INFO L226 Difference]: Without dead ends: 237576 [2019-11-28 02:46:34,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:34,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237576 states. [2019-11-28 02:46:37,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237576 to 229384. [2019-11-28 02:46:37,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229384 states. [2019-11-28 02:46:37,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229384 states to 229384 states and 256006 transitions. [2019-11-28 02:46:37,453 INFO L78 Accepts]: Start accepts. Automaton has 229384 states and 256006 transitions. Word has length 35 [2019-11-28 02:46:37,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:37,454 INFO L462 AbstractCegarLoop]: Abstraction has 229384 states and 256006 transitions. [2019-11-28 02:46:37,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:37,454 INFO L276 IsEmpty]: Start isEmpty. Operand 229384 states and 256006 transitions. [2019-11-28 02:46:37,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 02:46:37,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:37,601 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:37,601 INFO L410 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:37,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:37,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1769620018, now seen corresponding path program 1 times [2019-11-28 02:46:37,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:37,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913665018] [2019-11-28 02:46:37,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:37,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:37,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913665018] [2019-11-28 02:46:37,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:37,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:37,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656682957] [2019-11-28 02:46:37,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:37,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:37,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:37,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:37,628 INFO L87 Difference]: Start difference. First operand 229384 states and 256006 transitions. Second operand 3 states. [2019-11-28 02:46:38,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:38,168 INFO L93 Difference]: Finished difference Result 286726 states and 307205 transitions. [2019-11-28 02:46:38,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:38,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-28 02:46:38,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:38,169 INFO L225 Difference]: With dead ends: 286726 [2019-11-28 02:46:38,169 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:46:38,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:46:38,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:46:38,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:46:38,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:46:38,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:46:38,171 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-11-28 02:46:38,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:38,171 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:46:38,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:38,171 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:46:38,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:46:38,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:46:38 BoogieIcfgContainer [2019-11-28 02:46:38,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:46:38,177 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:46:38,177 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:46:38,178 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:46:38,178 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:12" (3/4) ... [2019-11-28 02:46:38,182 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:46:38,191 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 02:46:38,192 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 02:46:38,199 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 02:46:38,200 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:46:38,201 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:46:38,267 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:46:38,268 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:46:38,270 INFO L168 Benchmark]: Toolchain (without parser) took 26565.14 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.2 GB). Free memory was 951.0 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-11-28 02:46:38,271 INFO L168 Benchmark]: CDTParser took 1.60 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:46:38,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 414.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:38,272 INFO L168 Benchmark]: Boogie Preprocessor took 41.01 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:46:38,272 INFO L168 Benchmark]: RCFGBuilder took 436.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: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:38,273 INFO L168 Benchmark]: TraceAbstraction took 25577.16 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-11-28 02:46:38,273 INFO L168 Benchmark]: Witness Printer took 90.74 ms. Allocated memory is still 4.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:38,275 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.60 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 414.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.01 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 436.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: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25577.16 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 90.74 ms. Allocated memory is still 4.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 53 locations, 1 error locations. Result: SAFE, OverallTime: 25.5s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4001 SDtfs, 1984 SDslu, 2752 SDs, 0 SdLazy, 197 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229384occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.5s AutomataMinimizationTime, 37 MinimizatonAttempts, 32808 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1077 NumberOfCodeBlocks, 1077 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1040 ConstructedInterpolants, 0 QuantifiedInterpolants, 61562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...