./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_11.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_11.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 56f043bec3037ec37b4a132611abd4a337934428 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:46:04,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:46:04,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:46:04,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:46:04,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:46:04,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:46:04,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:46:04,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:46:04,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:46:04,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:46:04,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:46:04,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:46:04,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:46:04,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:46:04,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:46:04,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:46:04,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:46:04,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:46:04,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:46:04,991 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:46:04,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:46:04,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:46:04,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:46:04,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:46:04,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:46:04,998 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:46:04,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:46:04,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:46:05,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:46:05,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:46:05,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:46:05,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:46:05,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:46:05,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:46:05,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:46:05,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:46:05,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:46:05,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:46:05,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:46:05,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:46:05,010 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:05,036 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:46:05,037 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:46:05,040 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:46:05,040 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:46:05,040 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:46:05,040 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:46:05,041 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:46:05,043 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:46:05,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:46:05,043 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:46:05,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:46:05,044 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:46:05,044 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:46:05,044 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:46:05,044 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:46:05,044 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:46:05,045 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:46:05,045 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:46:05,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:46:05,045 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:46:05,046 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:46:05,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:46:05,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:46:05,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:46:05,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:46:05,050 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:46:05,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:46:05,051 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 -> 56f043bec3037ec37b4a132611abd4a337934428 [2019-11-28 02:46:05,349 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:46:05,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:46:05,375 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:46:05,377 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:46:05,377 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:46:05,378 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_11.c [2019-11-28 02:46:05,453 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34e4c7bf0/b2fbc0a865464ad3a92fba550223fd94/FLAG6d17858ee [2019-11-28 02:46:05,923 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:46:05,924 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2019-11-28 02:46:05,936 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34e4c7bf0/b2fbc0a865464ad3a92fba550223fd94/FLAG6d17858ee [2019-11-28 02:46:06,283 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34e4c7bf0/b2fbc0a865464ad3a92fba550223fd94 [2019-11-28 02:46:06,287 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:46:06,292 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:46:06,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:06,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:46:06,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:46:06,297 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,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a4f9cb 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,301 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,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:46:06,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:46:06,511 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:06,516 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:46:06,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:06,560 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:46:06,560 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,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:06,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:46:06,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:46:06,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:46:06,632 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,632 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,639 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,639 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,645 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,658 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,660 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,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:46:06,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:46:06,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:46:06,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:46:06,670 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,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:46:06,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:46:06,728 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:46:06,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 02:46:06,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:46:06,729 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:46:06,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:46:06,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:46:07,066 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:46:07,066 INFO L297 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 02:46:07,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:07 BoogieIcfgContainer [2019-11-28 02:46:07,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:46:07,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:46:07,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:46:07,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:46:07,072 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:07,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69799c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:07, skipping insertion in model container [2019-11-28 02:46:07,073 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:07,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69799c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:07, skipping insertion in model container [2019-11-28 02:46:07,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:07" (3/3) ... [2019-11-28 02:46:07,075 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2019-11-28 02:46:07,085 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:46:07,091 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 02:46:07,100 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 02:46:07,118 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:46:07,119 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:46:07,119 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:46:07,119 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:46:07,119 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:46:07,119 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:46:07,120 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:46:07,120 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:46:07,137 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-28 02:46:07,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:46:07,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:07,149 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,149 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:07,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:07,156 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2019-11-28 02:46:07,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:07,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081787946] [2019-11-28 02:46:07,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,355 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,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081787946] [2019-11-28 02:46:07,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:07,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:07,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805953600] [2019-11-28 02:46:07,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:07,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:07,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:07,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:07,383 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2019-11-28 02:46:07,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:07,449 INFO L93 Difference]: Finished difference Result 86 states and 149 transitions. [2019-11-28 02:46:07,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:07,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 02:46:07,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:07,467 INFO L225 Difference]: With dead ends: 86 [2019-11-28 02:46:07,468 INFO L226 Difference]: Without dead ends: 78 [2019-11-28 02:46:07,469 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,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-28 02:46:07,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2019-11-28 02:46:07,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 02:46:07,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2019-11-28 02:46:07,514 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2019-11-28 02:46:07,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:07,515 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2019-11-28 02:46:07,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2019-11-28 02:46:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:46:07,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:07,516 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,517 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:07,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:07,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2019-11-28 02:46:07,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:07,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758754279] [2019-11-28 02:46:07,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,592 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,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758754279] [2019-11-28 02:46:07,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:07,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:07,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751647848] [2019-11-28 02:46:07,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:07,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:07,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:07,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:07,596 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2019-11-28 02:46:07,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:07,645 INFO L93 Difference]: Finished difference Result 78 states and 138 transitions. [2019-11-28 02:46:07,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:07,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 02:46:07,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:07,650 INFO L225 Difference]: With dead ends: 78 [2019-11-28 02:46:07,650 INFO L226 Difference]: Without dead ends: 78 [2019-11-28 02:46:07,651 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,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-28 02:46:07,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-28 02:46:07,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 02:46:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2019-11-28 02:46:07,665 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2019-11-28 02:46:07,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:07,669 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2019-11-28 02:46:07,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2019-11-28 02:46:07,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:46:07,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:07,670 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:07,671 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:07,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:07,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2019-11-28 02:46:07,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:07,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33948103] [2019-11-28 02:46:07,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,768 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,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33948103] [2019-11-28 02:46:07,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:07,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:07,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767988386] [2019-11-28 02:46:07,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:07,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:07,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:07,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:07,771 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2019-11-28 02:46:07,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:07,805 INFO L93 Difference]: Finished difference Result 81 states and 140 transitions. [2019-11-28 02:46:07,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:07,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 02:46:07,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:07,808 INFO L225 Difference]: With dead ends: 81 [2019-11-28 02:46:07,808 INFO L226 Difference]: Without dead ends: 81 [2019-11-28 02:46:07,809 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,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-28 02:46:07,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-11-28 02:46:07,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-28 02:46:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2019-11-28 02:46:07,834 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2019-11-28 02:46:07,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:07,834 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2019-11-28 02:46:07,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:07,835 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2019-11-28 02:46:07,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:46:07,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:07,838 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:07,838 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:07,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:07,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2019-11-28 02:46:07,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:07,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637788944] [2019-11-28 02:46:07,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,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:07,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637788944] [2019-11-28 02:46:07,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:07,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:07,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41544781] [2019-11-28 02:46:07,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:07,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:07,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:07,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:07,923 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2019-11-28 02:46:07,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:07,946 INFO L93 Difference]: Finished difference Result 146 states and 261 transitions. [2019-11-28 02:46:07,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:07,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 02:46:07,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:07,949 INFO L225 Difference]: With dead ends: 146 [2019-11-28 02:46:07,950 INFO L226 Difference]: Without dead ends: 146 [2019-11-28 02:46:07,950 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,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-28 02:46:07,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2019-11-28 02:46:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 02:46:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2019-11-28 02:46:07,963 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2019-11-28 02:46:07,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:07,963 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2019-11-28 02:46:07,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:07,963 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2019-11-28 02:46:07,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:46:07,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:07,965 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:07,965 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:07,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:07,965 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2019-11-28 02:46:07,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:07,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149910013] [2019-11-28 02:46:07,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,016 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,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149910013] [2019-11-28 02:46:08,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:08,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683990025] [2019-11-28 02:46:08,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:08,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:08,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,019 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2019-11-28 02:46:08,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,038 INFO L93 Difference]: Finished difference Result 148 states and 259 transitions. [2019-11-28 02:46:08,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:08,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 02:46:08,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,040 INFO L225 Difference]: With dead ends: 148 [2019-11-28 02:46:08,041 INFO L226 Difference]: Without dead ends: 148 [2019-11-28 02:46:08,041 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,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-28 02:46:08,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2019-11-28 02:46:08,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-28 02:46:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2019-11-28 02:46:08,052 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2019-11-28 02:46:08,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,052 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2019-11-28 02:46:08,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:08,053 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2019-11-28 02:46:08,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:46:08,054 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,054 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,054 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,055 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2019-11-28 02:46:08,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147153942] [2019-11-28 02:46:08,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,117 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,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147153942] [2019-11-28 02:46:08,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:08,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365767074] [2019-11-28 02:46:08,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:08,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:08,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,121 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2019-11-28 02:46:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,145 INFO L93 Difference]: Finished difference Result 150 states and 259 transitions. [2019-11-28 02:46:08,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:08,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 02:46:08,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,147 INFO L225 Difference]: With dead ends: 150 [2019-11-28 02:46:08,148 INFO L226 Difference]: Without dead ends: 150 [2019-11-28 02:46:08,148 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,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-28 02:46:08,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-11-28 02:46:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-28 02:46:08,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2019-11-28 02:46:08,162 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2019-11-28 02:46:08,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,165 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2019-11-28 02:46:08,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:08,165 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2019-11-28 02:46:08,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:46:08,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,169 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:08,169 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2019-11-28 02:46:08,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648931787] [2019-11-28 02:46:08,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,209 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,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648931787] [2019-11-28 02:46:08,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:08,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915096148] [2019-11-28 02:46:08,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:08,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:08,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,212 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2019-11-28 02:46:08,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,232 INFO L93 Difference]: Finished difference Result 274 states and 483 transitions. [2019-11-28 02:46:08,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:08,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 02:46:08,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,235 INFO L225 Difference]: With dead ends: 274 [2019-11-28 02:46:08,235 INFO L226 Difference]: Without dead ends: 274 [2019-11-28 02:46:08,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-11-28 02:46:08,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2019-11-28 02:46:08,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-28 02:46:08,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2019-11-28 02:46:08,247 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2019-11-28 02:46:08,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,248 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2019-11-28 02:46:08,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:08,248 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2019-11-28 02:46:08,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:46:08,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,250 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,250 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2019-11-28 02:46:08,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169287835] [2019-11-28 02:46:08,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,260 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,278 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,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169287835] [2019-11-28 02:46:08,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:08,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793324769] [2019-11-28 02:46:08,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:08,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:08,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,280 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2019-11-28 02:46:08,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,303 INFO L93 Difference]: Finished difference Result 282 states and 483 transitions. [2019-11-28 02:46:08,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:08,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 02:46:08,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,306 INFO L225 Difference]: With dead ends: 282 [2019-11-28 02:46:08,306 INFO L226 Difference]: Without dead ends: 282 [2019-11-28 02:46:08,307 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,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-28 02:46:08,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2019-11-28 02:46:08,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-11-28 02:46:08,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2019-11-28 02:46:08,323 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2019-11-28 02:46:08,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,324 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2019-11-28 02:46:08,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:08,324 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2019-11-28 02:46:08,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:46:08,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,332 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,332 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2019-11-28 02:46:08,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364477325] [2019-11-28 02:46:08,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,376 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,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364477325] [2019-11-28 02:46:08,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:08,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735594191] [2019-11-28 02:46:08,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:08,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:08,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,380 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2019-11-28 02:46:08,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,397 INFO L93 Difference]: Finished difference Result 286 states and 483 transitions. [2019-11-28 02:46:08,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:08,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 02:46:08,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,400 INFO L225 Difference]: With dead ends: 286 [2019-11-28 02:46:08,400 INFO L226 Difference]: Without dead ends: 286 [2019-11-28 02:46:08,400 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,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-11-28 02:46:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2019-11-28 02:46:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-28 02:46:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2019-11-28 02:46:08,410 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2019-11-28 02:46:08,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,411 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2019-11-28 02:46:08,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2019-11-28 02:46:08,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:46:08,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,418 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,418 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,419 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2019-11-28 02:46:08,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051741332] [2019-11-28 02:46:08,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,476 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,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051741332] [2019-11-28 02:46:08,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:08,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033002162] [2019-11-28 02:46:08,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:08,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:08,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,479 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2019-11-28 02:46:08,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,501 INFO L93 Difference]: Finished difference Result 522 states and 895 transitions. [2019-11-28 02:46:08,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:08,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 02:46:08,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,506 INFO L225 Difference]: With dead ends: 522 [2019-11-28 02:46:08,506 INFO L226 Difference]: Without dead ends: 522 [2019-11-28 02:46:08,507 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,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-11-28 02:46:08,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2019-11-28 02:46:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-11-28 02:46:08,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2019-11-28 02:46:08,521 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2019-11-28 02:46:08,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,521 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2019-11-28 02:46:08,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:08,521 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2019-11-28 02:46:08,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:46:08,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,523 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,523 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,524 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2019-11-28 02:46:08,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777067384] [2019-11-28 02:46:08,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,555 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,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777067384] [2019-11-28 02:46:08,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:08,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500264711] [2019-11-28 02:46:08,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:08,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:08,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,558 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2019-11-28 02:46:08,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,580 INFO L93 Difference]: Finished difference Result 546 states and 903 transitions. [2019-11-28 02:46:08,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:08,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 02:46:08,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,584 INFO L225 Difference]: With dead ends: 546 [2019-11-28 02:46:08,585 INFO L226 Difference]: Without dead ends: 546 [2019-11-28 02:46:08,586 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,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-11-28 02:46:08,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2019-11-28 02:46:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-11-28 02:46:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2019-11-28 02:46:08,603 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2019-11-28 02:46:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,604 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2019-11-28 02:46:08,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2019-11-28 02:46:08,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:46:08,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,608 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,608 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,608 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2019-11-28 02:46:08,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541656938] [2019-11-28 02:46:08,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,641 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,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541656938] [2019-11-28 02:46:08,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:08,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421693412] [2019-11-28 02:46:08,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:08,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:08,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,645 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2019-11-28 02:46:08,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,662 INFO L93 Difference]: Finished difference Result 554 states and 903 transitions. [2019-11-28 02:46:08,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:08,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 02:46:08,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,667 INFO L225 Difference]: With dead ends: 554 [2019-11-28 02:46:08,667 INFO L226 Difference]: Without dead ends: 554 [2019-11-28 02:46:08,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-11-28 02:46:08,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2019-11-28 02:46:08,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-11-28 02:46:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2019-11-28 02:46:08,684 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2019-11-28 02:46:08,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,685 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2019-11-28 02:46:08,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2019-11-28 02:46:08,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:46:08,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,687 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,687 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2019-11-28 02:46:08,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540007567] [2019-11-28 02:46:08,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,730 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,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540007567] [2019-11-28 02:46:08,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:08,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264583176] [2019-11-28 02:46:08,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:08,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:08,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,734 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2019-11-28 02:46:08,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,755 INFO L93 Difference]: Finished difference Result 1002 states and 1655 transitions. [2019-11-28 02:46:08,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:08,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 02:46:08,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,762 INFO L225 Difference]: With dead ends: 1002 [2019-11-28 02:46:08,762 INFO L226 Difference]: Without dead ends: 1002 [2019-11-28 02:46:08,762 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,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-11-28 02:46:08,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2019-11-28 02:46:08,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-28 02:46:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2019-11-28 02:46:08,785 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2019-11-28 02:46:08,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,786 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2019-11-28 02:46:08,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2019-11-28 02:46:08,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:46:08,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,790 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,790 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2019-11-28 02:46:08,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720734847] [2019-11-28 02:46:08,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,821 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,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720734847] [2019-11-28 02:46:08,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:08,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119077933] [2019-11-28 02:46:08,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:08,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:08,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,825 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2019-11-28 02:46:08,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,850 INFO L93 Difference]: Finished difference Result 1066 states and 1687 transitions. [2019-11-28 02:46:08,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:08,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 02:46:08,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,856 INFO L225 Difference]: With dead ends: 1066 [2019-11-28 02:46:08,856 INFO L226 Difference]: Without dead ends: 1066 [2019-11-28 02:46:08,858 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,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-11-28 02:46:08,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2019-11-28 02:46:08,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2019-11-28 02:46:08,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2019-11-28 02:46:08,888 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2019-11-28 02:46:08,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,888 INFO L462 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2019-11-28 02:46:08,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:08,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2019-11-28 02:46:08,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:46:08,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,892 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:08,892 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,892 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2019-11-28 02:46:08,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350089892] [2019-11-28 02:46:08,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,917 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,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350089892] [2019-11-28 02:46:08,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:08,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:08,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938037405] [2019-11-28 02:46:08,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:08,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:08,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:08,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:08,922 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2019-11-28 02:46:08,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,942 INFO L93 Difference]: Finished difference Result 1082 states and 1687 transitions. [2019-11-28 02:46:08,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:08,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 02:46:08,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,948 INFO L225 Difference]: With dead ends: 1082 [2019-11-28 02:46:08,949 INFO L226 Difference]: Without dead ends: 1082 [2019-11-28 02:46:08,951 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,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-11-28 02:46:08,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2019-11-28 02:46:08,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2019-11-28 02:46:08,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2019-11-28 02:46:08,979 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2019-11-28 02:46:08,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,981 INFO L462 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2019-11-28 02:46:08,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:08,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2019-11-28 02:46:08,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:46:08,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,983 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:08,984 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,984 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2019-11-28 02:46:08,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063621890] [2019-11-28 02:46:08,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,017 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,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063621890] [2019-11-28 02:46:09,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:09,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:09,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449721698] [2019-11-28 02:46:09,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:09,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:09,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:09,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:09,019 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2019-11-28 02:46:09,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:09,046 INFO L93 Difference]: Finished difference Result 1930 states and 3047 transitions. [2019-11-28 02:46:09,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:09,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 02:46:09,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:09,057 INFO L225 Difference]: With dead ends: 1930 [2019-11-28 02:46:09,057 INFO L226 Difference]: Without dead ends: 1930 [2019-11-28 02:46:09,058 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,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-11-28 02:46:09,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2019-11-28 02:46:09,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-11-28 02:46:09,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2019-11-28 02:46:09,104 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2019-11-28 02:46:09,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:09,104 INFO L462 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2019-11-28 02:46:09,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:09,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2019-11-28 02:46:09,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:46:09,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:09,108 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,109 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:09,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:09,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2019-11-28 02:46:09,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:09,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879772643] [2019-11-28 02:46:09,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,140 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,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879772643] [2019-11-28 02:46:09,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:09,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:09,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050803191] [2019-11-28 02:46:09,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:09,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:09,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:09,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:09,142 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2019-11-28 02:46:09,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:09,169 INFO L93 Difference]: Finished difference Result 2090 states and 3143 transitions. [2019-11-28 02:46:09,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:09,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 02:46:09,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:09,179 INFO L225 Difference]: With dead ends: 2090 [2019-11-28 02:46:09,180 INFO L226 Difference]: Without dead ends: 2090 [2019-11-28 02:46:09,180 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,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2019-11-28 02:46:09,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2019-11-28 02:46:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2019-11-28 02:46:09,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2019-11-28 02:46:09,229 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2019-11-28 02:46:09,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:09,229 INFO L462 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2019-11-28 02:46:09,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:09,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2019-11-28 02:46:09,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:46:09,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:09,233 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,233 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:09,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:09,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2019-11-28 02:46:09,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:09,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391266778] [2019-11-28 02:46:09,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,257 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,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391266778] [2019-11-28 02:46:09,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:09,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:09,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125354794] [2019-11-28 02:46:09,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:09,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:09,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:09,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:09,262 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2019-11-28 02:46:09,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:09,287 INFO L93 Difference]: Finished difference Result 2122 states and 3143 transitions. [2019-11-28 02:46:09,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:09,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 02:46:09,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:09,298 INFO L225 Difference]: With dead ends: 2122 [2019-11-28 02:46:09,298 INFO L226 Difference]: Without dead ends: 2122 [2019-11-28 02:46:09,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:09,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-11-28 02:46:09,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2019-11-28 02:46:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2019-11-28 02:46:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2019-11-28 02:46:09,352 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2019-11-28 02:46:09,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:09,352 INFO L462 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2019-11-28 02:46:09,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2019-11-28 02:46:09,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:46:09,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:09,356 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,357 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:09,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:09,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2019-11-28 02:46:09,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:09,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108537814] [2019-11-28 02:46:09,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,390 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,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108537814] [2019-11-28 02:46:09,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:09,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:09,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405861929] [2019-11-28 02:46:09,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:09,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:09,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:09,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:09,395 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2019-11-28 02:46:09,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:09,439 INFO L93 Difference]: Finished difference Result 3722 states and 5575 transitions. [2019-11-28 02:46:09,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:09,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 02:46:09,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:09,465 INFO L225 Difference]: With dead ends: 3722 [2019-11-28 02:46:09,465 INFO L226 Difference]: Without dead ends: 3722 [2019-11-28 02:46:09,466 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,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-11-28 02:46:09,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2019-11-28 02:46:09,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2019-11-28 02:46:09,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2019-11-28 02:46:09,634 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2019-11-28 02:46:09,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:09,635 INFO L462 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2019-11-28 02:46:09,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:09,635 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2019-11-28 02:46:09,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:46:09,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:09,641 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,642 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:09,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:09,643 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2019-11-28 02:46:09,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:09,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381597079] [2019-11-28 02:46:09,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,684 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,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381597079] [2019-11-28 02:46:09,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:09,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:09,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291341728] [2019-11-28 02:46:09,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:09,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:09,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:09,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:09,688 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2019-11-28 02:46:09,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:09,731 INFO L93 Difference]: Finished difference Result 4106 states and 5831 transitions. [2019-11-28 02:46:09,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:09,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 02:46:09,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:09,757 INFO L225 Difference]: With dead ends: 4106 [2019-11-28 02:46:09,757 INFO L226 Difference]: Without dead ends: 4106 [2019-11-28 02:46:09,758 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,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-11-28 02:46:09,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2019-11-28 02:46:09,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2019-11-28 02:46:09,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2019-11-28 02:46:09,846 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2019-11-28 02:46:09,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:09,847 INFO L462 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2019-11-28 02:46:09,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:09,847 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2019-11-28 02:46:09,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 02:46:09,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:09,854 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:09,854 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:09,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:09,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2019-11-28 02:46:09,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:09,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459081825] [2019-11-28 02:46:09,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,882 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,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459081825] [2019-11-28 02:46:09,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:09,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:09,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720716515] [2019-11-28 02:46:09,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:09,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:09,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:09,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:09,883 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2019-11-28 02:46:09,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:09,914 INFO L93 Difference]: Finished difference Result 4170 states and 5831 transitions. [2019-11-28 02:46:09,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:09,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-28 02:46:09,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:09,949 INFO L225 Difference]: With dead ends: 4170 [2019-11-28 02:46:09,955 INFO L226 Difference]: Without dead ends: 4170 [2019-11-28 02:46:09,957 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,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2019-11-28 02:46:10,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2019-11-28 02:46:10,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2019-11-28 02:46:10,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2019-11-28 02:46:10,043 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2019-11-28 02:46:10,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:10,043 INFO L462 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2019-11-28 02:46:10,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:10,043 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2019-11-28 02:46:10,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 02:46:10,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:10,050 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,050 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:10,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:10,051 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2019-11-28 02:46:10,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:10,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512382656] [2019-11-28 02:46:10,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,070 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,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512382656] [2019-11-28 02:46:10,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:10,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:10,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629542475] [2019-11-28 02:46:10,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:10,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:10,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:10,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:10,073 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2019-11-28 02:46:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:10,124 INFO L93 Difference]: Finished difference Result 8074 states and 10887 transitions. [2019-11-28 02:46:10,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:10,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-28 02:46:10,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:10,143 INFO L225 Difference]: With dead ends: 8074 [2019-11-28 02:46:10,143 INFO L226 Difference]: Without dead ends: 8074 [2019-11-28 02:46:10,143 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,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2019-11-28 02:46:10,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2019-11-28 02:46:10,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-11-28 02:46:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2019-11-28 02:46:10,288 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2019-11-28 02:46:10,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:10,289 INFO L462 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2019-11-28 02:46:10,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:10,290 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2019-11-28 02:46:10,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 02:46:10,305 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:10,305 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,305 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:10,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:10,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2019-11-28 02:46:10,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:10,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206193002] [2019-11-28 02:46:10,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,330 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,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206193002] [2019-11-28 02:46:10,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:10,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:10,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981421317] [2019-11-28 02:46:10,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:10,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:10,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:10,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:10,333 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2019-11-28 02:46:10,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:10,379 INFO L93 Difference]: Finished difference Result 9098 states and 12551 transitions. [2019-11-28 02:46:10,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:10,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-28 02:46:10,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:10,409 INFO L225 Difference]: With dead ends: 9098 [2019-11-28 02:46:10,410 INFO L226 Difference]: Without dead ends: 9098 [2019-11-28 02:46:10,410 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,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2019-11-28 02:46:10,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2019-11-28 02:46:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-11-28 02:46:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2019-11-28 02:46:10,631 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2019-11-28 02:46:10,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:10,632 INFO L462 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2019-11-28 02:46:10,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:10,632 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2019-11-28 02:46:10,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 02:46:10,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:10,650 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:10,650 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:10,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:10,651 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2019-11-28 02:46:10,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:10,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511281236] [2019-11-28 02:46:10,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,673 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,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511281236] [2019-11-28 02:46:10,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:10,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:10,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655379280] [2019-11-28 02:46:10,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:10,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:10,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:10,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:10,675 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2019-11-28 02:46:10,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:10,736 INFO L93 Difference]: Finished difference Result 13706 states and 18311 transitions. [2019-11-28 02:46:10,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:10,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 02:46:10,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:10,770 INFO L225 Difference]: With dead ends: 13706 [2019-11-28 02:46:10,770 INFO L226 Difference]: Without dead ends: 13706 [2019-11-28 02:46:10,771 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,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2019-11-28 02:46:10,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2019-11-28 02:46:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2019-11-28 02:46:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2019-11-28 02:46:11,016 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2019-11-28 02:46:11,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:11,016 INFO L462 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2019-11-28 02:46:11,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2019-11-28 02:46:11,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 02:46:11,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:11,041 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:11,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:11,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2019-11-28 02:46:11,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:11,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350656435] [2019-11-28 02:46:11,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,062 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,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350656435] [2019-11-28 02:46:11,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:11,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:11,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834129117] [2019-11-28 02:46:11,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:11,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:11,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:11,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:11,065 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states. [2019-11-28 02:46:11,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:11,138 INFO L93 Difference]: Finished difference Result 15754 states and 19975 transitions. [2019-11-28 02:46:11,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:11,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 02:46:11,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:11,178 INFO L225 Difference]: With dead ends: 15754 [2019-11-28 02:46:11,178 INFO L226 Difference]: Without dead ends: 15754 [2019-11-28 02:46:11,179 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,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2019-11-28 02:46:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15752. [2019-11-28 02:46:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2019-11-28 02:46:11,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 19974 transitions. [2019-11-28 02:46:11,534 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 19974 transitions. Word has length 29 [2019-11-28 02:46:11,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:11,535 INFO L462 AbstractCegarLoop]: Abstraction has 15752 states and 19974 transitions. [2019-11-28 02:46:11,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:11,535 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 19974 transitions. [2019-11-28 02:46:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 02:46:11,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:11,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, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:11,557 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:11,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:11,558 INFO L82 PathProgramCache]: Analyzing trace with hash 2071172156, now seen corresponding path program 1 times [2019-11-28 02:46:11,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:11,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39911385] [2019-11-28 02:46:11,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,579 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,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39911385] [2019-11-28 02:46:11,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:11,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:11,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204462855] [2019-11-28 02:46:11,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:11,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:11,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:11,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:11,581 INFO L87 Difference]: Start difference. First operand 15752 states and 19974 transitions. Second operand 3 states. [2019-11-28 02:46:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:11,640 INFO L93 Difference]: Finished difference Result 16138 states and 20231 transitions. [2019-11-28 02:46:11,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:11,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-28 02:46:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:11,673 INFO L225 Difference]: With dead ends: 16138 [2019-11-28 02:46:11,673 INFO L226 Difference]: Without dead ends: 16138 [2019-11-28 02:46:11,673 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,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2019-11-28 02:46:11,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 16136. [2019-11-28 02:46:11,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2019-11-28 02:46:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 20230 transitions. [2019-11-28 02:46:11,899 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 20230 transitions. Word has length 30 [2019-11-28 02:46:11,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:11,899 INFO L462 AbstractCegarLoop]: Abstraction has 16136 states and 20230 transitions. [2019-11-28 02:46:11,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:11,900 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 20230 transitions. [2019-11-28 02:46:11,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 02:46:11,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:11,921 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:11,921 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:11,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:11,922 INFO L82 PathProgramCache]: Analyzing trace with hash 791308478, now seen corresponding path program 1 times [2019-11-28 02:46:11,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:11,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469382567] [2019-11-28 02:46:11,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,944 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,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469382567] [2019-11-28 02:46:11,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:11,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:11,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792850378] [2019-11-28 02:46:11,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:11,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:11,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:11,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:11,946 INFO L87 Difference]: Start difference. First operand 16136 states and 20230 transitions. Second operand 3 states. [2019-11-28 02:46:12,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:12,022 INFO L93 Difference]: Finished difference Result 26634 states and 33031 transitions. [2019-11-28 02:46:12,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:12,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-28 02:46:12,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:12,073 INFO L225 Difference]: With dead ends: 26634 [2019-11-28 02:46:12,073 INFO L226 Difference]: Without dead ends: 26634 [2019-11-28 02:46:12,074 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,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2019-11-28 02:46:12,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 24584. [2019-11-28 02:46:12,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2019-11-28 02:46:12,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 29958 transitions. [2019-11-28 02:46:12,390 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 29958 transitions. Word has length 30 [2019-11-28 02:46:12,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:12,390 INFO L462 AbstractCegarLoop]: Abstraction has 24584 states and 29958 transitions. [2019-11-28 02:46:12,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:12,391 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 29958 transitions. [2019-11-28 02:46:12,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 02:46:12,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:12,434 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:12,434 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:12,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:12,435 INFO L82 PathProgramCache]: Analyzing trace with hash -219808772, now seen corresponding path program 1 times [2019-11-28 02:46:12,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:12,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010806473] [2019-11-28 02:46:12,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:12,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010806473] [2019-11-28 02:46:12,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:12,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:12,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583421865] [2019-11-28 02:46:12,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:12,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:12,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:12,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:12,458 INFO L87 Difference]: Start difference. First operand 24584 states and 29958 transitions. Second operand 3 states. [2019-11-28 02:46:12,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:12,656 INFO L93 Difference]: Finished difference Result 31242 states and 36871 transitions. [2019-11-28 02:46:12,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:12,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-28 02:46:12,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:12,707 INFO L225 Difference]: With dead ends: 31242 [2019-11-28 02:46:12,707 INFO L226 Difference]: Without dead ends: 31242 [2019-11-28 02:46:12,708 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,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31242 states. [2019-11-28 02:46:13,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31242 to 31240. [2019-11-28 02:46:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31240 states. [2019-11-28 02:46:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31240 states to 31240 states and 36870 transitions. [2019-11-28 02:46:13,071 INFO L78 Accepts]: Start accepts. Automaton has 31240 states and 36870 transitions. Word has length 30 [2019-11-28 02:46:13,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:13,071 INFO L462 AbstractCegarLoop]: Abstraction has 31240 states and 36870 transitions. [2019-11-28 02:46:13,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:13,071 INFO L276 IsEmpty]: Start isEmpty. Operand 31240 states and 36870 transitions. [2019-11-28 02:46:13,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 02:46:13,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:13,101 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:13,101 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:13,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:13,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1239024833, now seen corresponding path program 1 times [2019-11-28 02:46:13,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:13,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186906787] [2019-11-28 02:46:13,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:13,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186906787] [2019-11-28 02:46:13,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:13,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:13,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273957025] [2019-11-28 02:46:13,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:13,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:13,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:13,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:13,125 INFO L87 Difference]: Start difference. First operand 31240 states and 36870 transitions. Second operand 3 states. [2019-11-28 02:46:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:13,202 INFO L93 Difference]: Finished difference Result 31754 states and 36871 transitions. [2019-11-28 02:46:13,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:13,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-28 02:46:13,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:13,256 INFO L225 Difference]: With dead ends: 31754 [2019-11-28 02:46:13,256 INFO L226 Difference]: Without dead ends: 31754 [2019-11-28 02:46:13,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:13,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31754 states. [2019-11-28 02:46:13,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31754 to 31752. [2019-11-28 02:46:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31752 states. [2019-11-28 02:46:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31752 states to 31752 states and 36870 transitions. [2019-11-28 02:46:13,784 INFO L78 Accepts]: Start accepts. Automaton has 31752 states and 36870 transitions. Word has length 31 [2019-11-28 02:46:13,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:13,784 INFO L462 AbstractCegarLoop]: Abstraction has 31752 states and 36870 transitions. [2019-11-28 02:46:13,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 31752 states and 36870 transitions. [2019-11-28 02:46:13,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 02:46:13,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:13,804 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:13,805 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:13,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:13,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1776078785, now seen corresponding path program 1 times [2019-11-28 02:46:13,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:13,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729992951] [2019-11-28 02:46:13,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:13,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729992951] [2019-11-28 02:46:13,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:13,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:13,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992086384] [2019-11-28 02:46:13,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:13,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:13,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:13,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:13,828 INFO L87 Difference]: Start difference. First operand 31752 states and 36870 transitions. Second operand 3 states. [2019-11-28 02:46:13,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:13,930 INFO L93 Difference]: Finished difference Result 51208 states and 57862 transitions. [2019-11-28 02:46:13,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:13,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-28 02:46:13,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:14,010 INFO L225 Difference]: With dead ends: 51208 [2019-11-28 02:46:14,010 INFO L226 Difference]: Without dead ends: 51208 [2019-11-28 02:46:14,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51208 states. [2019-11-28 02:46:14,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51208 to 49160. [2019-11-28 02:46:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49160 states. [2019-11-28 02:46:14,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49160 states to 49160 states and 55814 transitions. [2019-11-28 02:46:14,556 INFO L78 Accepts]: Start accepts. Automaton has 49160 states and 55814 transitions. Word has length 31 [2019-11-28 02:46:14,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:14,557 INFO L462 AbstractCegarLoop]: Abstraction has 49160 states and 55814 transitions. [2019-11-28 02:46:14,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:14,557 INFO L276 IsEmpty]: Start isEmpty. Operand 49160 states and 55814 transitions. [2019-11-28 02:46:14,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 02:46:14,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:14,591 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:14,591 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:14,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:14,591 INFO L82 PathProgramCache]: Analyzing trace with hash 764961535, now seen corresponding path program 1 times [2019-11-28 02:46:14,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:14,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818945022] [2019-11-28 02:46:14,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:14,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818945022] [2019-11-28 02:46:14,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:14,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:14,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747267502] [2019-11-28 02:46:14,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:14,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:14,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:14,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:14,624 INFO L87 Difference]: Start difference. First operand 49160 states and 55814 transitions. Second operand 3 states. [2019-11-28 02:46:14,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:14,761 INFO L93 Difference]: Finished difference Result 61446 states and 66565 transitions. [2019-11-28 02:46:14,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:14,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-28 02:46:14,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:14,763 INFO L225 Difference]: With dead ends: 61446 [2019-11-28 02:46:14,763 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:46:14,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:14,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:46:14,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:46:14,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:46:14,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:46:14,764 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-11-28 02:46:14,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:14,765 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:46:14,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:14,765 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:46:14,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:46:14,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:46:14 BoogieIcfgContainer [2019-11-28 02:46:14,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:46:14,772 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:46:14,772 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:46:14,772 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:46:14,773 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:07" (3/4) ... [2019-11-28 02:46:14,777 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:46:14,786 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 02:46:14,787 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 02:46:14,794 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 02:46:14,795 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:46:14,795 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:46:14,921 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:46:14,921 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:46:14,923 INFO L168 Benchmark]: Toolchain (without parser) took 8634.15 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 522.2 MB). Free memory was 957.7 MB in the beginning and 855.9 MB in the end (delta: 101.7 MB). Peak memory consumption was 623.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:14,924 INFO L168 Benchmark]: CDTParser took 1.58 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:14,924 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.14 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:14,924 INFO L168 Benchmark]: Boogie Preprocessor took 103.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:14,925 INFO L168 Benchmark]: RCFGBuilder took 399.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:14,925 INFO L168 Benchmark]: TraceAbstraction took 7702.25 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 409.5 MB). Free memory was 1.1 GB in the beginning and 855.9 MB in the end (delta: 226.7 MB). Peak memory consumption was 636.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:14,925 INFO L168 Benchmark]: Witness Printer took 149.40 ms. Allocated memory is still 1.6 GB. Free memory is still 855.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:46:14,927 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.58 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 268.14 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 103.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 399.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7702.25 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 409.5 MB). Free memory was 1.1 GB in the beginning and 855.9 MB in the end (delta: 226.7 MB). Peak memory consumption was 636.2 MB. Max. memory is 11.5 GB. * Witness Printer took 149.40 ms. Allocated memory is still 1.6 GB. Free memory is still 855.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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, 47 locations, 1 error locations. Result: SAFE, OverallTime: 7.6s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2877 SDtfs, 1405 SDslu, 1967 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49160occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 8224 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 39912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...