./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_10.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_10.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 0f7b0b589689413087c164ce10eb80c902ee4046 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:04,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:46:04,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:46:04,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:46:04,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:46:04,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:46:04,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:46:04,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:46:04,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:46:04,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:46:04,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:46:04,735 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:46:04,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:46:04,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:46:04,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:46:04,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:46:04,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:46:04,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:46:04,748 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:46:04,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:46:04,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:46:04,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:46:04,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:46:04,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:46:04,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:46:04,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:46:04,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:46:04,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:46:04,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:46:04,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:46:04,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:46:04,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:46:04,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:46:04,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:46:04,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:46:04,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:46:04,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:46:04,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:46:04,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:46:04,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:46:04,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:46:04,784 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:04,817 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:46:04,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:46:04,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:46:04,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:46:04,820 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:46:04,820 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:46:04,820 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:46:04,821 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:46:04,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:46:04,821 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:46:04,821 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:46:04,822 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:46:04,822 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:46:04,822 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:46:04,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:46:04,823 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:46:04,823 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:46:04,823 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:46:04,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:46:04,824 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:46:04,824 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:46:04,824 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:46:04,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:46:04,825 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:46:04,825 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:46:04,825 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:46:04,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:46:04,826 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 -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2019-11-28 02:46:05,153 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:46:05,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:46:05,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:46:05,179 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:46:05,180 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:46:05,180 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_10.c [2019-11-28 02:46:05,254 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3ebf2f51/300ab939fa3f42ac90953fe5b6d986b9/FLAGf8c537740 [2019-11-28 02:46:05,768 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:46:05,769 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2019-11-28 02:46:05,777 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3ebf2f51/300ab939fa3f42ac90953fe5b6d986b9/FLAGf8c537740 [2019-11-28 02:46:06,119 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3ebf2f51/300ab939fa3f42ac90953fe5b6d986b9 [2019-11-28 02:46:06,122 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:46:06,124 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:46:06,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:06,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:46:06,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:46:06,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:06" (1/1) ... [2019-11-28 02:46:06,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68a60da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:06, skipping insertion in model container [2019-11-28 02:46:06,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:06" (1/1) ... [2019-11-28 02:46:06,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:46:06,179 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:46:06,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:06,385 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:46:06,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:06,506 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:46:06,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:06 WrapperNode [2019-11-28 02:46:06,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:06,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:46:06,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:46:06,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:46:06,521 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:06" (1/1) ... [2019-11-28 02:46:06,521 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:06" (1/1) ... [2019-11-28 02:46:06,528 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:06" (1/1) ... [2019-11-28 02:46:06,528 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:06" (1/1) ... [2019-11-28 02:46:06,534 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:06" (1/1) ... [2019-11-28 02:46:06,545 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:06" (1/1) ... [2019-11-28 02:46:06,546 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:06" (1/1) ... [2019-11-28 02:46:06,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:46:06,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:46:06,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:46:06,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:46:06,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:06" (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:06,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:46:06,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:46:06,609 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:46:06,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 02:46:06,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:46:06,610 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:46:06,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:46:06,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:46:06,918 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:46:06,919 INFO L297 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 02:46:06,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:06 BoogieIcfgContainer [2019-11-28 02:46:06,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:46:06,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:46:06,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:46:06,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:46:06,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:46:06" (1/3) ... [2019-11-28 02:46:06,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b6b73b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:06, skipping insertion in model container [2019-11-28 02:46:06,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:06" (2/3) ... [2019-11-28 02:46:06,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b6b73b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:06, skipping insertion in model container [2019-11-28 02:46:06,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:06" (3/3) ... [2019-11-28 02:46:06,932 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2019-11-28 02:46:06,945 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:46:06,957 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 02:46:06,975 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 02:46:07,010 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:46:07,011 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:46:07,011 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:46:07,011 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:46:07,012 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:46:07,012 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:46:07,012 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:46:07,012 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:46:07,031 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-11-28 02:46:07,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:46:07,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:07,041 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:07,042 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:07,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:07,048 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2019-11-28 02:46:07,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:07,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525199788] [2019-11-28 02:46:07,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,238 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:07,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525199788] [2019-11-28 02:46:07,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:07,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:07,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657157742] [2019-11-28 02:46:07,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:07,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:07,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:07,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:07,261 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-11-28 02:46:07,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:07,315 INFO L93 Difference]: Finished difference Result 80 states and 137 transitions. [2019-11-28 02:46:07,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:07,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 02:46:07,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:07,329 INFO L225 Difference]: With dead ends: 80 [2019-11-28 02:46:07,330 INFO L226 Difference]: Without dead ends: 72 [2019-11-28 02:46:07,331 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:07,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-28 02:46:07,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-11-28 02:46:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 02:46:07,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2019-11-28 02:46:07,396 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2019-11-28 02:46:07,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:07,397 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2019-11-28 02:46:07,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:07,398 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2019-11-28 02:46:07,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:46:07,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:07,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:07,401 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:07,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:07,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2019-11-28 02:46:07,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:07,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825935318] [2019-11-28 02:46:07,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,544 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:07,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825935318] [2019-11-28 02:46:07,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:07,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:07,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400417745] [2019-11-28 02:46:07,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:07,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:07,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:07,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:07,550 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2019-11-28 02:46:07,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:07,599 INFO L93 Difference]: Finished difference Result 72 states and 126 transitions. [2019-11-28 02:46:07,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:07,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 02:46:07,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:07,602 INFO L225 Difference]: With dead ends: 72 [2019-11-28 02:46:07,602 INFO L226 Difference]: Without dead ends: 72 [2019-11-28 02:46:07,603 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:07,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-28 02:46:07,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-11-28 02:46:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-28 02:46:07,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2019-11-28 02:46:07,623 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2019-11-28 02:46:07,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:07,623 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2019-11-28 02:46:07,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:07,624 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2019-11-28 02:46:07,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:46:07,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:07,627 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] [2019-11-28 02:46:07,628 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:07,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:07,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2019-11-28 02:46:07,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:07,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320749506] [2019-11-28 02:46:07,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,701 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:07,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320749506] [2019-11-28 02:46:07,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:07,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:07,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017479458] [2019-11-28 02:46:07,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:07,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:07,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:07,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:07,705 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2019-11-28 02:46:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:07,743 INFO L93 Difference]: Finished difference Result 75 states and 128 transitions. [2019-11-28 02:46:07,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:07,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 02:46:07,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:07,747 INFO L225 Difference]: With dead ends: 75 [2019-11-28 02:46:07,747 INFO L226 Difference]: Without dead ends: 75 [2019-11-28 02:46:07,747 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:07,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-28 02:46:07,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-11-28 02:46:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 02:46:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2019-11-28 02:46:07,762 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2019-11-28 02:46:07,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:07,763 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2019-11-28 02:46:07,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:07,763 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2019-11-28 02:46:07,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:46:07,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:07,767 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] [2019-11-28 02:46:07,768 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:07,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:07,769 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2019-11-28 02:46:07,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:07,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114165509] [2019-11-28 02:46:07,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,866 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:07,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114165509] [2019-11-28 02:46:07,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:07,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:07,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777608653] [2019-11-28 02:46:07,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:07,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:07,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:07,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:07,868 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2019-11-28 02:46:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:07,890 INFO L93 Difference]: Finished difference Result 134 states and 237 transitions. [2019-11-28 02:46:07,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:07,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 02:46:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:07,893 INFO L225 Difference]: With dead ends: 134 [2019-11-28 02:46:07,893 INFO L226 Difference]: Without dead ends: 134 [2019-11-28 02:46:07,894 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:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-28 02:46:07,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2019-11-28 02:46:07,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 02:46:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2019-11-28 02:46:07,906 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2019-11-28 02:46:07,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:07,907 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2019-11-28 02:46:07,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:07,907 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2019-11-28 02:46:07,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:46:07,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:07,909 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] [2019-11-28 02:46:07,909 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:07,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:07,910 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2019-11-28 02:46:07,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:07,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315378917] [2019-11-28 02:46:07,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,951 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:07,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315378917] [2019-11-28 02:46:07,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:07,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:07,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785720495] [2019-11-28 02:46:07,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:07,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:07,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:07,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:07,953 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2019-11-28 02:46:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:07,982 INFO L93 Difference]: Finished difference Result 136 states and 235 transitions. [2019-11-28 02:46:07,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:07,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 02:46:07,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:07,985 INFO L225 Difference]: With dead ends: 136 [2019-11-28 02:46:07,985 INFO L226 Difference]: Without dead ends: 136 [2019-11-28 02:46:07,985 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:07,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-28 02:46:07,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-11-28 02:46:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-28 02:46:08,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2019-11-28 02:46:08,001 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2019-11-28 02:46:08,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,002 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2019-11-28 02:46:08,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:08,002 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2019-11-28 02:46:08,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:46:08,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,004 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] [2019-11-28 02:46:08,004 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2019-11-28 02:46:08,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681091997] [2019-11-28 02:46:08,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,049 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:08,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681091997] [2019-11-28 02:46:08,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:08,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756658244] [2019-11-28 02:46:08,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:08,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:08,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,052 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2019-11-28 02:46:08,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,075 INFO L93 Difference]: Finished difference Result 138 states and 235 transitions. [2019-11-28 02:46:08,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:08,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 02:46:08,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,077 INFO L225 Difference]: With dead ends: 138 [2019-11-28 02:46:08,077 INFO L226 Difference]: Without dead ends: 138 [2019-11-28 02:46:08,078 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:08,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-28 02:46:08,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-11-28 02:46:08,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-28 02:46:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2019-11-28 02:46:08,089 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2019-11-28 02:46:08,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,090 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2019-11-28 02:46:08,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:08,091 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2019-11-28 02:46:08,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:46:08,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,098 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] [2019-11-28 02:46:08,098 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,099 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2019-11-28 02:46:08,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88451792] [2019-11-28 02:46:08,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,158 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:08,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88451792] [2019-11-28 02:46:08,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:08,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612692212] [2019-11-28 02:46:08,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:08,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:08,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,161 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2019-11-28 02:46:08,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,188 INFO L93 Difference]: Finished difference Result 250 states and 435 transitions. [2019-11-28 02:46:08,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:08,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 02:46:08,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,191 INFO L225 Difference]: With dead ends: 250 [2019-11-28 02:46:08,192 INFO L226 Difference]: Without dead ends: 250 [2019-11-28 02:46:08,194 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:08,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-28 02:46:08,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2019-11-28 02:46:08,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-28 02:46:08,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2019-11-28 02:46:08,222 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2019-11-28 02:46:08,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,223 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2019-11-28 02:46:08,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:08,223 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2019-11-28 02:46:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:46:08,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,225 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] [2019-11-28 02:46:08,225 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,226 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2019-11-28 02:46:08,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247445066] [2019-11-28 02:46:08,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,280 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:08,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247445066] [2019-11-28 02:46:08,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:08,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683517924] [2019-11-28 02:46:08,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:08,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:08,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,284 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2019-11-28 02:46:08,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,305 INFO L93 Difference]: Finished difference Result 258 states and 435 transitions. [2019-11-28 02:46:08,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:08,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 02:46:08,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,308 INFO L225 Difference]: With dead ends: 258 [2019-11-28 02:46:08,308 INFO L226 Difference]: Without dead ends: 258 [2019-11-28 02:46:08,309 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:08,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-28 02:46:08,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-11-28 02:46:08,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-28 02:46:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2019-11-28 02:46:08,320 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2019-11-28 02:46:08,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,321 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2019-11-28 02:46:08,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:08,321 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2019-11-28 02:46:08,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:46:08,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,323 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:08,324 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2019-11-28 02:46:08,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340209569] [2019-11-28 02:46:08,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,351 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:08,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340209569] [2019-11-28 02:46:08,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:08,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666820854] [2019-11-28 02:46:08,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:08,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:08,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,354 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2019-11-28 02:46:08,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,369 INFO L93 Difference]: Finished difference Result 262 states and 435 transitions. [2019-11-28 02:46:08,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:08,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 02:46:08,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,372 INFO L225 Difference]: With dead ends: 262 [2019-11-28 02:46:08,372 INFO L226 Difference]: Without dead ends: 262 [2019-11-28 02:46:08,373 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:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-28 02:46:08,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-11-28 02:46:08,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-28 02:46:08,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2019-11-28 02:46:08,382 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2019-11-28 02:46:08,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,382 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2019-11-28 02:46:08,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:08,382 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2019-11-28 02:46:08,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:46:08,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,384 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:08,385 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2019-11-28 02:46:08,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57339305] [2019-11-28 02:46:08,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,412 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:08,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57339305] [2019-11-28 02:46:08,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:08,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505417314] [2019-11-28 02:46:08,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:08,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:08,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,415 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2019-11-28 02:46:08,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,443 INFO L93 Difference]: Finished difference Result 474 states and 799 transitions. [2019-11-28 02:46:08,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:08,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 02:46:08,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,453 INFO L225 Difference]: With dead ends: 474 [2019-11-28 02:46:08,454 INFO L226 Difference]: Without dead ends: 474 [2019-11-28 02:46:08,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:08,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-11-28 02:46:08,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2019-11-28 02:46:08,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-11-28 02:46:08,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2019-11-28 02:46:08,470 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2019-11-28 02:46:08,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,470 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2019-11-28 02:46:08,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2019-11-28 02:46:08,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:46:08,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,473 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:08,474 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,474 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2019-11-28 02:46:08,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212863056] [2019-11-28 02:46:08,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,515 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:08,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212863056] [2019-11-28 02:46:08,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:08,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72751722] [2019-11-28 02:46:08,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:08,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:08,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,518 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2019-11-28 02:46:08,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,534 INFO L93 Difference]: Finished difference Result 498 states and 807 transitions. [2019-11-28 02:46:08,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:08,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 02:46:08,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,538 INFO L225 Difference]: With dead ends: 498 [2019-11-28 02:46:08,538 INFO L226 Difference]: Without dead ends: 498 [2019-11-28 02:46:08,538 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:08,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-11-28 02:46:08,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2019-11-28 02:46:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-11-28 02:46:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2019-11-28 02:46:08,554 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2019-11-28 02:46:08,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,555 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2019-11-28 02:46:08,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:08,555 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2019-11-28 02:46:08,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:46:08,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,557 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:08,557 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,558 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2019-11-28 02:46:08,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173929736] [2019-11-28 02:46:08,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,604 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:08,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173929736] [2019-11-28 02:46:08,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:08,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337144917] [2019-11-28 02:46:08,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:08,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:08,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,611 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2019-11-28 02:46:08,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,630 INFO L93 Difference]: Finished difference Result 506 states and 807 transitions. [2019-11-28 02:46:08,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:08,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 02:46:08,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,634 INFO L225 Difference]: With dead ends: 506 [2019-11-28 02:46:08,634 INFO L226 Difference]: Without dead ends: 506 [2019-11-28 02:46:08,635 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:08,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-11-28 02:46:08,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2019-11-28 02:46:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-11-28 02:46:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2019-11-28 02:46:08,652 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2019-11-28 02:46:08,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,652 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2019-11-28 02:46:08,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:08,652 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2019-11-28 02:46:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:46:08,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,654 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:08,655 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2019-11-28 02:46:08,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493240723] [2019-11-28 02:46:08,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,685 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:08,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493240723] [2019-11-28 02:46:08,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:08,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412168868] [2019-11-28 02:46:08,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:08,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:08,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,688 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2019-11-28 02:46:08,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,707 INFO L93 Difference]: Finished difference Result 906 states and 1463 transitions. [2019-11-28 02:46:08,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:08,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 02:46:08,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,714 INFO L225 Difference]: With dead ends: 906 [2019-11-28 02:46:08,715 INFO L226 Difference]: Without dead ends: 906 [2019-11-28 02:46:08,716 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:08,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-11-28 02:46:08,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2019-11-28 02:46:08,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-11-28 02:46:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2019-11-28 02:46:08,738 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2019-11-28 02:46:08,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,739 INFO L462 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2019-11-28 02:46:08,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:08,739 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2019-11-28 02:46:08,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:46:08,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,744 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:08,744 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2019-11-28 02:46:08,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486131718] [2019-11-28 02:46:08,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:08,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486131718] [2019-11-28 02:46:08,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:08,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356854486] [2019-11-28 02:46:08,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:08,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:08,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,779 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2019-11-28 02:46:08,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,800 INFO L93 Difference]: Finished difference Result 970 states and 1495 transitions. [2019-11-28 02:46:08,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:08,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 02:46:08,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,806 INFO L225 Difference]: With dead ends: 970 [2019-11-28 02:46:08,807 INFO L226 Difference]: Without dead ends: 970 [2019-11-28 02:46:08,807 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:08,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-11-28 02:46:08,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2019-11-28 02:46:08,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-11-28 02:46:08,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2019-11-28 02:46:08,835 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2019-11-28 02:46:08,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,835 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2019-11-28 02:46:08,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:08,835 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2019-11-28 02:46:08,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:46:08,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,837 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:08,838 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2019-11-28 02:46:08,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628631199] [2019-11-28 02:46:08,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,863 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:08,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628631199] [2019-11-28 02:46:08,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:08,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095948182] [2019-11-28 02:46:08,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:08,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:08,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,867 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2019-11-28 02:46:08,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,887 INFO L93 Difference]: Finished difference Result 986 states and 1495 transitions. [2019-11-28 02:46:08,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:08,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 02:46:08,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,893 INFO L225 Difference]: With dead ends: 986 [2019-11-28 02:46:08,893 INFO L226 Difference]: Without dead ends: 986 [2019-11-28 02:46:08,894 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:08,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2019-11-28 02:46:08,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2019-11-28 02:46:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-11-28 02:46:08,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2019-11-28 02:46:08,922 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2019-11-28 02:46:08,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,922 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2019-11-28 02:46:08,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:08,923 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2019-11-28 02:46:08,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:46:08,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,925 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:08,925 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,926 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2019-11-28 02:46:08,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955511823] [2019-11-28 02:46:08,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,948 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:08,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955511823] [2019-11-28 02:46:08,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:08,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178710291] [2019-11-28 02:46:08,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:08,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:08,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,951 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2019-11-28 02:46:08,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,974 INFO L93 Difference]: Finished difference Result 1738 states and 2663 transitions. [2019-11-28 02:46:08,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:08,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 02:46:08,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,985 INFO L225 Difference]: With dead ends: 1738 [2019-11-28 02:46:08,986 INFO L226 Difference]: Without dead ends: 1738 [2019-11-28 02:46:08,986 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:08,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-11-28 02:46:09,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2019-11-28 02:46:09,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-11-28 02:46:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2019-11-28 02:46:09,030 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2019-11-28 02:46:09,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:09,030 INFO L462 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2019-11-28 02:46:09,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:09,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2019-11-28 02:46:09,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:46:09,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:09,034 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:09,035 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:09,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:09,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2019-11-28 02:46:09,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:09,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049210742] [2019-11-28 02:46:09,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,059 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:09,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049210742] [2019-11-28 02:46:09,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:09,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:09,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519120846] [2019-11-28 02:46:09,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:09,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:09,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:09,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:09,062 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2019-11-28 02:46:09,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:09,086 INFO L93 Difference]: Finished difference Result 1898 states and 2759 transitions. [2019-11-28 02:46:09,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:09,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 02:46:09,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:09,097 INFO L225 Difference]: With dead ends: 1898 [2019-11-28 02:46:09,097 INFO L226 Difference]: Without dead ends: 1898 [2019-11-28 02:46:09,098 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:09,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2019-11-28 02:46:09,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2019-11-28 02:46:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-11-28 02:46:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2019-11-28 02:46:09,150 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2019-11-28 02:46:09,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:09,150 INFO L462 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2019-11-28 02:46:09,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:09,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2019-11-28 02:46:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:46:09,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:09,155 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:09,155 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:09,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:09,156 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2019-11-28 02:46:09,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:09,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186220384] [2019-11-28 02:46:09,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,176 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:09,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186220384] [2019-11-28 02:46:09,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:09,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:09,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614900897] [2019-11-28 02:46:09,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:09,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:09,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:09,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:09,179 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2019-11-28 02:46:09,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:09,201 INFO L93 Difference]: Finished difference Result 1930 states and 2759 transitions. [2019-11-28 02:46:09,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:09,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 02:46:09,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:09,211 INFO L225 Difference]: With dead ends: 1930 [2019-11-28 02:46:09,212 INFO L226 Difference]: Without dead ends: 1930 [2019-11-28 02:46:09,212 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:09,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-11-28 02:46:09,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2019-11-28 02:46:09,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-11-28 02:46:09,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2019-11-28 02:46:09,264 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2019-11-28 02:46:09,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:09,264 INFO L462 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2019-11-28 02:46:09,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:09,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2019-11-28 02:46:09,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:46:09,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:09,269 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:09,270 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:09,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:09,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2019-11-28 02:46:09,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:09,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799058379] [2019-11-28 02:46:09,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,294 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:09,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799058379] [2019-11-28 02:46:09,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:09,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:09,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2349950] [2019-11-28 02:46:09,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:09,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:09,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:09,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:09,298 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2019-11-28 02:46:09,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:09,337 INFO L93 Difference]: Finished difference Result 3338 states and 4807 transitions. [2019-11-28 02:46:09,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:09,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 02:46:09,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:09,359 INFO L225 Difference]: With dead ends: 3338 [2019-11-28 02:46:09,360 INFO L226 Difference]: Without dead ends: 3338 [2019-11-28 02:46:09,360 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:09,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-11-28 02:46:09,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2019-11-28 02:46:09,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2019-11-28 02:46:09,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2019-11-28 02:46:09,460 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2019-11-28 02:46:09,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:09,461 INFO L462 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2019-11-28 02:46:09,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:09,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2019-11-28 02:46:09,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:46:09,470 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:09,470 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:09,470 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:09,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:09,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2019-11-28 02:46:09,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:09,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845678922] [2019-11-28 02:46:09,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,494 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:09,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845678922] [2019-11-28 02:46:09,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:09,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:09,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340106449] [2019-11-28 02:46:09,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:09,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:09,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:09,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:09,498 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2019-11-28 02:46:09,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:09,546 INFO L93 Difference]: Finished difference Result 3722 states and 5063 transitions. [2019-11-28 02:46:09,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:09,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 02:46:09,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:09,569 INFO L225 Difference]: With dead ends: 3722 [2019-11-28 02:46:09,569 INFO L226 Difference]: Without dead ends: 3722 [2019-11-28 02:46:09,570 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:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-11-28 02:46:09,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2019-11-28 02:46:09,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2019-11-28 02:46:09,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2019-11-28 02:46:09,697 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2019-11-28 02:46:09,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:09,698 INFO L462 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2019-11-28 02:46:09,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:09,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2019-11-28 02:46:09,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:46:09,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:09,705 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:09,705 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:09,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:09,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2019-11-28 02:46:09,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:09,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7113148] [2019-11-28 02:46:09,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,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:09,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7113148] [2019-11-28 02:46:09,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:09,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:09,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071888857] [2019-11-28 02:46:09,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:09,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:09,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:09,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:09,750 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2019-11-28 02:46:09,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:09,782 INFO L93 Difference]: Finished difference Result 3786 states and 5063 transitions. [2019-11-28 02:46:09,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:09,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 02:46:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:09,801 INFO L225 Difference]: With dead ends: 3786 [2019-11-28 02:46:09,801 INFO L226 Difference]: Without dead ends: 3786 [2019-11-28 02:46:09,803 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:09,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-11-28 02:46:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-11-28 02:46:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-28 02:46:09,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2019-11-28 02:46:09,884 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2019-11-28 02:46:09,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:09,884 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2019-11-28 02:46:09,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:09,884 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2019-11-28 02:46:09,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:46:09,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:09,890 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:09,891 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:09,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:09,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2019-11-28 02:46:09,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:09,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523529114] [2019-11-28 02:46:09,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,916 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:09,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523529114] [2019-11-28 02:46:09,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:09,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:09,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939048424] [2019-11-28 02:46:09,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:09,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:09,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:09,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:09,918 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2019-11-28 02:46:09,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:09,951 INFO L93 Difference]: Finished difference Result 7306 states and 9351 transitions. [2019-11-28 02:46:09,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:09,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 02:46:09,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:09,980 INFO L225 Difference]: With dead ends: 7306 [2019-11-28 02:46:09,980 INFO L226 Difference]: Without dead ends: 7306 [2019-11-28 02:46:09,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:09,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2019-11-28 02:46:10,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2019-11-28 02:46:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-11-28 02:46:10,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2019-11-28 02:46:10,121 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2019-11-28 02:46:10,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:10,121 INFO L462 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2019-11-28 02:46:10,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:10,121 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2019-11-28 02:46:10,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:46:10,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:10,132 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:10,133 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:10,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:10,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2019-11-28 02:46:10,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:10,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39843621] [2019-11-28 02:46:10,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,171 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:10,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39843621] [2019-11-28 02:46:10,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:10,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:10,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661272798] [2019-11-28 02:46:10,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:10,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:10,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:10,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:10,177 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2019-11-28 02:46:10,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:10,217 INFO L93 Difference]: Finished difference Result 8074 states and 10503 transitions. [2019-11-28 02:46:10,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:10,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 02:46:10,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:10,254 INFO L225 Difference]: With dead ends: 8074 [2019-11-28 02:46:10,255 INFO L226 Difference]: Without dead ends: 8074 [2019-11-28 02:46:10,255 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:10,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2019-11-28 02:46:10,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2019-11-28 02:46:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-11-28 02:46:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2019-11-28 02:46:10,391 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2019-11-28 02:46:10,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:10,392 INFO L462 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2019-11-28 02:46:10,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:10,392 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2019-11-28 02:46:10,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 02:46:10,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:10,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, 1] [2019-11-28 02:46:10,403 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:10,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:10,404 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2019-11-28 02:46:10,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:10,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203535877] [2019-11-28 02:46:10,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,424 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:10,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203535877] [2019-11-28 02:46:10,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:10,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:10,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027023787] [2019-11-28 02:46:10,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:10,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:10,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:10,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:10,427 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2019-11-28 02:46:10,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:10,474 INFO L93 Difference]: Finished difference Result 12170 states and 15239 transitions. [2019-11-28 02:46:10,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:10,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-28 02:46:10,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:10,499 INFO L225 Difference]: With dead ends: 12170 [2019-11-28 02:46:10,500 INFO L226 Difference]: Without dead ends: 12170 [2019-11-28 02:46:10,502 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:10,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-11-28 02:46:10,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2019-11-28 02:46:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2019-11-28 02:46:10,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2019-11-28 02:46:10,694 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2019-11-28 02:46:10,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:10,695 INFO L462 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2019-11-28 02:46:10,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2019-11-28 02:46:10,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 02:46:10,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:10,714 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:10,714 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:10,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:10,715 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2019-11-28 02:46:10,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:10,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280817914] [2019-11-28 02:46:10,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,743 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:10,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280817914] [2019-11-28 02:46:10,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:10,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:10,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664596347] [2019-11-28 02:46:10,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:10,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:10,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:10,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:10,745 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2019-11-28 02:46:10,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:10,809 INFO L93 Difference]: Finished difference Result 14218 states and 16903 transitions. [2019-11-28 02:46:10,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:10,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-28 02:46:10,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:10,840 INFO L225 Difference]: With dead ends: 14218 [2019-11-28 02:46:10,841 INFO L226 Difference]: Without dead ends: 14218 [2019-11-28 02:46:10,841 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:10,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2019-11-28 02:46:11,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2019-11-28 02:46:11,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-11-28 02:46:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2019-11-28 02:46:11,135 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2019-11-28 02:46:11,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:11,135 INFO L462 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2019-11-28 02:46:11,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:11,135 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2019-11-28 02:46:11,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 02:46:11,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:11,152 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:11,152 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:11,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:11,153 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2019-11-28 02:46:11,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:11,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222432125] [2019-11-28 02:46:11,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,169 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:11,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222432125] [2019-11-28 02:46:11,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:11,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:11,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571775279] [2019-11-28 02:46:11,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:11,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:11,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:11,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:11,171 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2019-11-28 02:46:11,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:11,219 INFO L93 Difference]: Finished difference Result 14602 states and 17159 transitions. [2019-11-28 02:46:11,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:11,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 02:46:11,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:11,246 INFO L225 Difference]: With dead ends: 14602 [2019-11-28 02:46:11,246 INFO L226 Difference]: Without dead ends: 14602 [2019-11-28 02:46:11,246 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:11,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2019-11-28 02:46:11,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2019-11-28 02:46:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2019-11-28 02:46:11,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2019-11-28 02:46:11,435 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2019-11-28 02:46:11,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:11,435 INFO L462 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2019-11-28 02:46:11,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:11,435 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2019-11-28 02:46:11,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 02:46:11,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:11,452 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:11,453 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:11,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:11,453 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2019-11-28 02:46:11,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:11,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954743136] [2019-11-28 02:46:11,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,472 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:11,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954743136] [2019-11-28 02:46:11,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:11,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:11,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299050672] [2019-11-28 02:46:11,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:11,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:11,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:11,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:11,475 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2019-11-28 02:46:11,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:11,535 INFO L93 Difference]: Finished difference Result 23560 states and 26886 transitions. [2019-11-28 02:46:11,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:11,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 02:46:11,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:11,579 INFO L225 Difference]: With dead ends: 23560 [2019-11-28 02:46:11,580 INFO L226 Difference]: Without dead ends: 23560 [2019-11-28 02:46:11,580 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:11,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2019-11-28 02:46:11,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2019-11-28 02:46:11,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2019-11-28 02:46:11,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2019-11-28 02:46:11,889 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2019-11-28 02:46:11,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:11,889 INFO L462 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2019-11-28 02:46:11,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:11,890 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2019-11-28 02:46:11,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 02:46:11,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:11,926 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:11,927 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:11,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:11,927 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2019-11-28 02:46:11,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:11,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008472093] [2019-11-28 02:46:11,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,948 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:11,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008472093] [2019-11-28 02:46:11,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:11,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:11,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178484211] [2019-11-28 02:46:11,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:11,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:11,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:11,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:11,950 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2019-11-28 02:46:12,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:12,041 INFO L93 Difference]: Finished difference Result 28166 states and 30725 transitions. [2019-11-28 02:46:12,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:12,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 02:46:12,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:12,042 INFO L225 Difference]: With dead ends: 28166 [2019-11-28 02:46:12,042 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:46:12,043 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:12,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:46:12,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:46:12,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:46:12,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:46:12,044 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-11-28 02:46:12,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:12,044 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:46:12,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:12,045 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:46:12,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:46:12,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:46:12 BoogieIcfgContainer [2019-11-28 02:46:12,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:46:12,052 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:46:12,052 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:46:12,053 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:46:12,053 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:06" (3/4) ... [2019-11-28 02:46:12,058 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:46:12,066 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 02:46:12,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 02:46:12,074 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 02:46:12,074 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:46:12,075 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:46:12,139 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:46:12,140 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:46:12,142 INFO L168 Benchmark]: Toolchain (without parser) took 6018.05 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 343.9 MB). Free memory was 961.7 MB in the beginning and 890.8 MB in the end (delta: 70.9 MB). Peak memory consumption was 414.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:12,143 INFO L168 Benchmark]: CDTParser took 1.56 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:46:12,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:12,144 INFO L168 Benchmark]: Boogie Preprocessor took 42.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:12,144 INFO L168 Benchmark]: RCFGBuilder took 371.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:12,145 INFO L168 Benchmark]: TraceAbstraction took 5128.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.1 MB). Free memory was 1.1 GB in the beginning and 890.8 MB in the end (delta: 219.3 MB). Peak memory consumption was 416.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:12,145 INFO L168 Benchmark]: Witness Printer took 87.91 ms. Allocated memory is still 1.4 GB. Free memory was 890.8 MB in the beginning and 890.8 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-28 02:46:12,147 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.56 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 381.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 371.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5128.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.1 MB). Free memory was 1.1 GB in the beginning and 890.8 MB in the end (delta: 219.3 MB). Peak memory consumption was 416.4 MB. Max. memory is 11.5 GB. * Witness Printer took 87.91 ms. Allocated memory is still 1.4 GB. Free memory was 890.8 MB in the beginning and 890.8 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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, 44 locations, 1 error locations. Result: SAFE, OverallTime: 5.0s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...