./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_9.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_9.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 5107685577f81a5867811396b2c0a05eb5630c95 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:27,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:46:27,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:46:27,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:46:27,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:46:27,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:46:27,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:46:27,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:46:27,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:46:27,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:46:27,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:46:27,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:46:27,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:46:27,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:46:27,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:46:27,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:46:27,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:46:27,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:46:27,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:46:27,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:46:27,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:46:27,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:46:27,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:46:27,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:46:27,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:46:27,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:46:27,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:46:27,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:46:27,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:46:27,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:46:27,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:46:27,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:46:27,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:46:27,214 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:46:27,215 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:46:27,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:46:27,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:46:27,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:46:27,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:46:27,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:46:27,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:46:27,223 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:27,246 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:46:27,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:46:27,249 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:46:27,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:46:27,250 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:46:27,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:46:27,250 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:46:27,250 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:46:27,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:46:27,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:46:27,252 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:46:27,252 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:46:27,253 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:46:27,253 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:46:27,253 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:46:27,254 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:46:27,254 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:46:27,254 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:46:27,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:46:27,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:46:27,255 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:46:27,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:46:27,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:46:27,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:46:27,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:46:27,257 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:46:27,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:46:27,257 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 -> 5107685577f81a5867811396b2c0a05eb5630c95 [2019-11-28 02:46:27,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:46:27,565 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:46:27,568 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:46:27,570 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:46:27,570 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:46:27,571 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_9.c [2019-11-28 02:46:27,631 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bcefe684/1dae7fbd52eb4c77bbff1fe3513f0c5b/FLAGf625ad2a8 [2019-11-28 02:46:28,107 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:46:28,108 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2019-11-28 02:46:28,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bcefe684/1dae7fbd52eb4c77bbff1fe3513f0c5b/FLAGf625ad2a8 [2019-11-28 02:46:28,478 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bcefe684/1dae7fbd52eb4c77bbff1fe3513f0c5b [2019-11-28 02:46:28,481 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:46:28,483 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:46:28,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:28,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:46:28,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:46:28,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:28" (1/1) ... [2019-11-28 02:46:28,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e961de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:28, skipping insertion in model container [2019-11-28 02:46:28,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:28" (1/1) ... [2019-11-28 02:46:28,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:46:28,533 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:46:28,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:28,740 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:46:28,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:28,789 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:46:28,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:28 WrapperNode [2019-11-28 02:46:28,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:28,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:46:28,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:46:28,792 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:46:28,871 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:28" (1/1) ... [2019-11-28 02:46:28,871 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:28" (1/1) ... [2019-11-28 02:46:28,876 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:28" (1/1) ... [2019-11-28 02:46:28,877 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:28" (1/1) ... [2019-11-28 02:46:28,882 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:28" (1/1) ... [2019-11-28 02:46:28,893 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:28" (1/1) ... [2019-11-28 02:46:28,895 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:28" (1/1) ... [2019-11-28 02:46:28,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:46:28,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:46:28,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:46:28,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:46:28,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:28" (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:28,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:46:28,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:46:28,960 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:46:28,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 02:46:28,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:46:28,961 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:46:28,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:46:28,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:46:29,316 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:46:29,317 INFO L297 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 02:46:29,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:29 BoogieIcfgContainer [2019-11-28 02:46:29,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:46:29,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:46:29,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:46:29,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:46:29,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:46:28" (1/3) ... [2019-11-28 02:46:29,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f3bfc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:29, skipping insertion in model container [2019-11-28 02:46:29,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:28" (2/3) ... [2019-11-28 02:46:29,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f3bfc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:29, skipping insertion in model container [2019-11-28 02:46:29,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:29" (3/3) ... [2019-11-28 02:46:29,327 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2019-11-28 02:46:29,334 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:46:29,340 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 02:46:29,351 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 02:46:29,371 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:46:29,372 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:46:29,372 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:46:29,372 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:46:29,372 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:46:29,372 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:46:29,372 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:46:29,373 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:46:29,389 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-11-28 02:46:29,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:46:29,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:29,400 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:29,400 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:29,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:29,405 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2019-11-28 02:46:29,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:29,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392818765] [2019-11-28 02:46:29,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:29,595 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:29,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392818765] [2019-11-28 02:46:29,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:29,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:29,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071328148] [2019-11-28 02:46:29,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:29,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:29,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:29,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:29,626 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2019-11-28 02:46:29,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:29,707 INFO L93 Difference]: Finished difference Result 74 states and 125 transitions. [2019-11-28 02:46:29,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:29,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 02:46:29,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:29,731 INFO L225 Difference]: With dead ends: 74 [2019-11-28 02:46:29,731 INFO L226 Difference]: Without dead ends: 66 [2019-11-28 02:46:29,735 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:29,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-28 02:46:29,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-11-28 02:46:29,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 02:46:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2019-11-28 02:46:29,809 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2019-11-28 02:46:29,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:29,810 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2019-11-28 02:46:29,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:29,810 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2019-11-28 02:46:29,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:46:29,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:29,813 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:29,814 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:29,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:29,815 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2019-11-28 02:46:29,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:29,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377064140] [2019-11-28 02:46:29,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:29,899 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:29,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377064140] [2019-11-28 02:46:29,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:29,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:29,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056382305] [2019-11-28 02:46:29,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:29,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:29,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:29,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:29,904 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2019-11-28 02:46:29,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:29,952 INFO L93 Difference]: Finished difference Result 66 states and 114 transitions. [2019-11-28 02:46:29,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:29,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 02:46:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:29,955 INFO L225 Difference]: With dead ends: 66 [2019-11-28 02:46:29,955 INFO L226 Difference]: Without dead ends: 66 [2019-11-28 02:46:29,956 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:29,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-28 02:46:29,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-11-28 02:46:29,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 02:46:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2019-11-28 02:46:29,965 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2019-11-28 02:46:29,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:29,966 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2019-11-28 02:46:29,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:29,966 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2019-11-28 02:46:29,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:46:29,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:29,968 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:29,968 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:29,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:29,969 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2019-11-28 02:46:29,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:29,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210527610] [2019-11-28 02:46:29,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,035 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:30,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210527610] [2019-11-28 02:46:30,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:30,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:30,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431134376] [2019-11-28 02:46:30,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:30,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:30,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:30,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:30,038 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2019-11-28 02:46:30,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:30,073 INFO L93 Difference]: Finished difference Result 69 states and 116 transitions. [2019-11-28 02:46:30,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:30,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 02:46:30,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:30,077 INFO L225 Difference]: With dead ends: 69 [2019-11-28 02:46:30,077 INFO L226 Difference]: Without dead ends: 69 [2019-11-28 02:46:30,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:30,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-28 02:46:30,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-11-28 02:46:30,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-28 02:46:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2019-11-28 02:46:30,099 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2019-11-28 02:46:30,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:30,099 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2019-11-28 02:46:30,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:30,102 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2019-11-28 02:46:30,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:46:30,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:30,103 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:30,103 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:30,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:30,104 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2019-11-28 02:46:30,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:30,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444215344] [2019-11-28 02:46:30,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,184 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:30,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444215344] [2019-11-28 02:46:30,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:30,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:30,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769049098] [2019-11-28 02:46:30,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:30,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:30,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:30,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:30,194 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2019-11-28 02:46:30,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:30,217 INFO L93 Difference]: Finished difference Result 122 states and 213 transitions. [2019-11-28 02:46:30,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:30,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 02:46:30,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:30,220 INFO L225 Difference]: With dead ends: 122 [2019-11-28 02:46:30,220 INFO L226 Difference]: Without dead ends: 122 [2019-11-28 02:46:30,221 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:30,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-28 02:46:30,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2019-11-28 02:46:30,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-28 02:46:30,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2019-11-28 02:46:30,232 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2019-11-28 02:46:30,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:30,233 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2019-11-28 02:46:30,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:30,233 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2019-11-28 02:46:30,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:46:30,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:30,235 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:30,235 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:30,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:30,236 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2019-11-28 02:46:30,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:30,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307296895] [2019-11-28 02:46:30,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,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:30,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307296895] [2019-11-28 02:46:30,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:30,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:30,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468133054] [2019-11-28 02:46:30,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:30,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:30,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:30,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:30,286 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2019-11-28 02:46:30,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:30,304 INFO L93 Difference]: Finished difference Result 124 states and 211 transitions. [2019-11-28 02:46:30,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:30,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 02:46:30,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:30,306 INFO L225 Difference]: With dead ends: 124 [2019-11-28 02:46:30,306 INFO L226 Difference]: Without dead ends: 124 [2019-11-28 02:46:30,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:30,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-28 02:46:30,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-11-28 02:46:30,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-28 02:46:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2019-11-28 02:46:30,316 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2019-11-28 02:46:30,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:30,317 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2019-11-28 02:46:30,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2019-11-28 02:46:30,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:46:30,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:30,318 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:30,318 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:30,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:30,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2019-11-28 02:46:30,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:30,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001407724] [2019-11-28 02:46:30,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,360 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:30,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001407724] [2019-11-28 02:46:30,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:30,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:30,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280537141] [2019-11-28 02:46:30,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:30,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:30,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:30,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:30,364 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2019-11-28 02:46:30,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:30,393 INFO L93 Difference]: Finished difference Result 126 states and 211 transitions. [2019-11-28 02:46:30,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:30,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 02:46:30,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:30,396 INFO L225 Difference]: With dead ends: 126 [2019-11-28 02:46:30,397 INFO L226 Difference]: Without dead ends: 126 [2019-11-28 02:46:30,397 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:30,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-28 02:46:30,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-11-28 02:46:30,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-28 02:46:30,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2019-11-28 02:46:30,416 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2019-11-28 02:46:30,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:30,417 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2019-11-28 02:46:30,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:30,417 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2019-11-28 02:46:30,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:46:30,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:30,419 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:30,419 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:30,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:30,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2019-11-28 02:46:30,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:30,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646877898] [2019-11-28 02:46:30,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:30,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646877898] [2019-11-28 02:46:30,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:30,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:30,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084866380] [2019-11-28 02:46:30,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:30,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:30,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:30,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:30,471 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2019-11-28 02:46:30,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:30,496 INFO L93 Difference]: Finished difference Result 226 states and 387 transitions. [2019-11-28 02:46:30,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:30,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 02:46:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:30,500 INFO L225 Difference]: With dead ends: 226 [2019-11-28 02:46:30,500 INFO L226 Difference]: Without dead ends: 226 [2019-11-28 02:46:30,501 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:30,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-28 02:46:30,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2019-11-28 02:46:30,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-28 02:46:30,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2019-11-28 02:46:30,513 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2019-11-28 02:46:30,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:30,513 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2019-11-28 02:46:30,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:30,514 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2019-11-28 02:46:30,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:46:30,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:30,515 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:30,516 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:30,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:30,516 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2019-11-28 02:46:30,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:30,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748174350] [2019-11-28 02:46:30,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,553 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:30,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748174350] [2019-11-28 02:46:30,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:30,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:30,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146805845] [2019-11-28 02:46:30,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:30,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:30,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:30,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:30,556 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2019-11-28 02:46:30,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:30,571 INFO L93 Difference]: Finished difference Result 234 states and 387 transitions. [2019-11-28 02:46:30,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:30,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 02:46:30,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:30,574 INFO L225 Difference]: With dead ends: 234 [2019-11-28 02:46:30,574 INFO L226 Difference]: Without dead ends: 234 [2019-11-28 02:46:30,574 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:30,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-11-28 02:46:30,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2019-11-28 02:46:30,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-28 02:46:30,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2019-11-28 02:46:30,585 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2019-11-28 02:46:30,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:30,585 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2019-11-28 02:46:30,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:30,585 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2019-11-28 02:46:30,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:46:30,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:30,587 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:30,588 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:30,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:30,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2019-11-28 02:46:30,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:30,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061316514] [2019-11-28 02:46:30,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,620 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:30,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061316514] [2019-11-28 02:46:30,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:30,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:30,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816175177] [2019-11-28 02:46:30,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:30,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:30,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:30,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:30,622 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2019-11-28 02:46:30,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:30,635 INFO L93 Difference]: Finished difference Result 238 states and 387 transitions. [2019-11-28 02:46:30,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:30,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 02:46:30,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:30,637 INFO L225 Difference]: With dead ends: 238 [2019-11-28 02:46:30,638 INFO L226 Difference]: Without dead ends: 238 [2019-11-28 02:46:30,638 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:30,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-11-28 02:46:30,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2019-11-28 02:46:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-28 02:46:30,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2019-11-28 02:46:30,646 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2019-11-28 02:46:30,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:30,647 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2019-11-28 02:46:30,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:30,647 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2019-11-28 02:46:30,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:46:30,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:30,649 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:30,649 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:30,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:30,650 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2019-11-28 02:46:30,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:30,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690153638] [2019-11-28 02:46:30,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:30,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690153638] [2019-11-28 02:46:30,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:30,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:30,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15177883] [2019-11-28 02:46:30,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:30,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:30,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:30,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:30,692 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2019-11-28 02:46:30,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:30,716 INFO L93 Difference]: Finished difference Result 426 states and 703 transitions. [2019-11-28 02:46:30,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:30,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 02:46:30,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:30,719 INFO L225 Difference]: With dead ends: 426 [2019-11-28 02:46:30,720 INFO L226 Difference]: Without dead ends: 426 [2019-11-28 02:46:30,720 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:30,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-11-28 02:46:30,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2019-11-28 02:46:30,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-11-28 02:46:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2019-11-28 02:46:30,731 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2019-11-28 02:46:30,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:30,732 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2019-11-28 02:46:30,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:30,732 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2019-11-28 02:46:30,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:46:30,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:30,734 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:30,734 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:30,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:30,735 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2019-11-28 02:46:30,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:30,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733127633] [2019-11-28 02:46:30,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,770 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:30,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733127633] [2019-11-28 02:46:30,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:30,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:30,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079484500] [2019-11-28 02:46:30,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:30,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:30,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:30,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:30,776 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2019-11-28 02:46:30,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:30,799 INFO L93 Difference]: Finished difference Result 450 states and 711 transitions. [2019-11-28 02:46:30,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:30,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 02:46:30,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:30,802 INFO L225 Difference]: With dead ends: 450 [2019-11-28 02:46:30,802 INFO L226 Difference]: Without dead ends: 450 [2019-11-28 02:46:30,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:30,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-28 02:46:30,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2019-11-28 02:46:30,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-11-28 02:46:30,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2019-11-28 02:46:30,817 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2019-11-28 02:46:30,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:30,817 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2019-11-28 02:46:30,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:30,818 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2019-11-28 02:46:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:46:30,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:30,819 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:30,820 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:30,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:30,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2019-11-28 02:46:30,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:30,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906513697] [2019-11-28 02:46:30,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,855 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:30,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906513697] [2019-11-28 02:46:30,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:30,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:30,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615368423] [2019-11-28 02:46:30,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:30,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:30,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:30,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:30,858 INFO L87 Difference]: Start difference. First operand 448 states and 710 transitions. Second operand 3 states. [2019-11-28 02:46:30,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:30,873 INFO L93 Difference]: Finished difference Result 458 states and 711 transitions. [2019-11-28 02:46:30,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:30,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 02:46:30,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:30,876 INFO L225 Difference]: With dead ends: 458 [2019-11-28 02:46:30,877 INFO L226 Difference]: Without dead ends: 458 [2019-11-28 02:46:30,877 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:30,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-11-28 02:46:30,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2019-11-28 02:46:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-11-28 02:46:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2019-11-28 02:46:30,891 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2019-11-28 02:46:30,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:30,892 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2019-11-28 02:46:30,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2019-11-28 02:46:30,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:46:30,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:30,893 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:30,894 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:30,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:30,894 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2019-11-28 02:46:30,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:30,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435859771] [2019-11-28 02:46:30,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:30,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435859771] [2019-11-28 02:46:30,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:30,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:30,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026255210] [2019-11-28 02:46:30,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:30,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:30,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:30,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:30,922 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2019-11-28 02:46:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:30,943 INFO L93 Difference]: Finished difference Result 810 states and 1271 transitions. [2019-11-28 02:46:30,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:30,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 02:46:30,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:30,949 INFO L225 Difference]: With dead ends: 810 [2019-11-28 02:46:30,949 INFO L226 Difference]: Without dead ends: 810 [2019-11-28 02:46:30,949 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:30,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2019-11-28 02:46:30,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2019-11-28 02:46:30,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-11-28 02:46:30,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2019-11-28 02:46:30,969 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2019-11-28 02:46:30,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:30,970 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2019-11-28 02:46:30,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:30,970 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2019-11-28 02:46:30,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:46:30,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:30,972 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:30,972 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:30,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:30,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2019-11-28 02:46:30,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:30,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388615773] [2019-11-28 02:46:30,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:31,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388615773] [2019-11-28 02:46:31,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:31,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:31,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706238709] [2019-11-28 02:46:31,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:31,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:31,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:31,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:31,005 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2019-11-28 02:46:31,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:31,025 INFO L93 Difference]: Finished difference Result 874 states and 1303 transitions. [2019-11-28 02:46:31,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:31,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 02:46:31,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:31,030 INFO L225 Difference]: With dead ends: 874 [2019-11-28 02:46:31,030 INFO L226 Difference]: Without dead ends: 874 [2019-11-28 02:46:31,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:31,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-11-28 02:46:31,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2019-11-28 02:46:31,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-11-28 02:46:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2019-11-28 02:46:31,056 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2019-11-28 02:46:31,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:31,058 INFO L462 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2019-11-28 02:46:31,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:31,058 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2019-11-28 02:46:31,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:46:31,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:31,060 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:31,060 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:31,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:31,061 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2019-11-28 02:46:31,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:31,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678968531] [2019-11-28 02:46:31,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:31,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678968531] [2019-11-28 02:46:31,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:31,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:31,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580257829] [2019-11-28 02:46:31,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:31,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:31,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:31,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:31,097 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2019-11-28 02:46:31,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:31,116 INFO L93 Difference]: Finished difference Result 890 states and 1303 transitions. [2019-11-28 02:46:31,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:31,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 02:46:31,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:31,121 INFO L225 Difference]: With dead ends: 890 [2019-11-28 02:46:31,121 INFO L226 Difference]: Without dead ends: 890 [2019-11-28 02:46:31,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:31,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-11-28 02:46:31,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2019-11-28 02:46:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-11-28 02:46:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2019-11-28 02:46:31,146 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2019-11-28 02:46:31,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:31,147 INFO L462 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2019-11-28 02:46:31,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2019-11-28 02:46:31,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:46:31,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:31,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, 1, 1, 1] [2019-11-28 02:46:31,149 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:31,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:31,150 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2019-11-28 02:46:31,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:31,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770393882] [2019-11-28 02:46:31,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:31,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770393882] [2019-11-28 02:46:31,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:31,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:31,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486606914] [2019-11-28 02:46:31,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:31,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:31,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:31,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:31,173 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2019-11-28 02:46:31,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:31,203 INFO L93 Difference]: Finished difference Result 1546 states and 2279 transitions. [2019-11-28 02:46:31,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:31,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 02:46:31,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:31,212 INFO L225 Difference]: With dead ends: 1546 [2019-11-28 02:46:31,212 INFO L226 Difference]: Without dead ends: 1546 [2019-11-28 02:46:31,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:31,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2019-11-28 02:46:31,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2019-11-28 02:46:31,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2019-11-28 02:46:31,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2019-11-28 02:46:31,252 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2019-11-28 02:46:31,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:31,253 INFO L462 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2019-11-28 02:46:31,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2019-11-28 02:46:31,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:46:31,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:31,258 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:31,258 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:31,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:31,259 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2019-11-28 02:46:31,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:31,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251392252] [2019-11-28 02:46:31,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:31,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:31,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251392252] [2019-11-28 02:46:31,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:31,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:31,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536256778] [2019-11-28 02:46:31,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:31,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:31,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:31,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:31,294 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2019-11-28 02:46:31,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:31,318 INFO L93 Difference]: Finished difference Result 1706 states and 2375 transitions. [2019-11-28 02:46:31,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:31,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 02:46:31,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:31,328 INFO L225 Difference]: With dead ends: 1706 [2019-11-28 02:46:31,328 INFO L226 Difference]: Without dead ends: 1706 [2019-11-28 02:46:31,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:31,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-11-28 02:46:31,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2019-11-28 02:46:31,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-11-28 02:46:31,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2019-11-28 02:46:31,377 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2019-11-28 02:46:31,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:31,378 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2019-11-28 02:46:31,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:31,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2019-11-28 02:46:31,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:46:31,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:31,383 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:31,384 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:31,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:31,385 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2019-11-28 02:46:31,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:31,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850430605] [2019-11-28 02:46:31,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:31,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:31,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850430605] [2019-11-28 02:46:31,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:31,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:31,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364746857] [2019-11-28 02:46:31,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:31,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:31,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:31,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:31,424 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2019-11-28 02:46:31,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:31,448 INFO L93 Difference]: Finished difference Result 1738 states and 2375 transitions. [2019-11-28 02:46:31,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:31,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 02:46:31,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:31,458 INFO L225 Difference]: With dead ends: 1738 [2019-11-28 02:46:31,458 INFO L226 Difference]: Without dead ends: 1738 [2019-11-28 02:46:31,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-11-28 02:46:31,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2019-11-28 02:46:31,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2019-11-28 02:46:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2019-11-28 02:46:31,521 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2019-11-28 02:46:31,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:31,522 INFO L462 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2019-11-28 02:46:31,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:31,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2019-11-28 02:46:31,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:46:31,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:31,527 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:31,528 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:31,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:31,528 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2019-11-28 02:46:31,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:31,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6113821] [2019-11-28 02:46:31,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:31,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:31,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6113821] [2019-11-28 02:46:31,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:31,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:31,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605881267] [2019-11-28 02:46:31,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:31,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:31,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:31,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:31,573 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2019-11-28 02:46:31,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:31,610 INFO L93 Difference]: Finished difference Result 2954 states and 4039 transitions. [2019-11-28 02:46:31,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:31,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 02:46:31,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:31,626 INFO L225 Difference]: With dead ends: 2954 [2019-11-28 02:46:31,627 INFO L226 Difference]: Without dead ends: 2954 [2019-11-28 02:46:31,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:31,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-11-28 02:46:31,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2019-11-28 02:46:31,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2019-11-28 02:46:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2019-11-28 02:46:31,722 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2019-11-28 02:46:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:31,723 INFO L462 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2019-11-28 02:46:31,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:31,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2019-11-28 02:46:31,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:46:31,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:31,732 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:31,733 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:31,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:31,734 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2019-11-28 02:46:31,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:31,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877059281] [2019-11-28 02:46:31,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:31,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877059281] [2019-11-28 02:46:31,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:31,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:31,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360516884] [2019-11-28 02:46:31,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:31,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:31,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:31,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:31,769 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2019-11-28 02:46:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:31,813 INFO L93 Difference]: Finished difference Result 3338 states and 4295 transitions. [2019-11-28 02:46:31,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:31,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 02:46:31,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:31,835 INFO L225 Difference]: With dead ends: 3338 [2019-11-28 02:46:31,836 INFO L226 Difference]: Without dead ends: 3338 [2019-11-28 02:46:31,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:31,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-11-28 02:46:31,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2019-11-28 02:46:31,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2019-11-28 02:46:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2019-11-28 02:46:31,978 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2019-11-28 02:46:31,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:31,978 INFO L462 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2019-11-28 02:46:31,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:31,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2019-11-28 02:46:31,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:46:31,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:31,984 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:31,984 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:31,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:31,985 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2019-11-28 02:46:31,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:31,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632126977] [2019-11-28 02:46:31,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:32,024 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:32,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632126977] [2019-11-28 02:46:32,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:32,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:32,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114355051] [2019-11-28 02:46:32,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:32,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:32,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:32,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:32,031 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2019-11-28 02:46:32,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:32,062 INFO L93 Difference]: Finished difference Result 3402 states and 4295 transitions. [2019-11-28 02:46:32,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:32,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 02:46:32,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:32,080 INFO L225 Difference]: With dead ends: 3402 [2019-11-28 02:46:32,080 INFO L226 Difference]: Without dead ends: 3402 [2019-11-28 02:46:32,081 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:32,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2019-11-28 02:46:32,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2019-11-28 02:46:32,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2019-11-28 02:46:32,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2019-11-28 02:46:32,157 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2019-11-28 02:46:32,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:32,158 INFO L462 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2019-11-28 02:46:32,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:32,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2019-11-28 02:46:32,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:46:32,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:32,164 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:32,164 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:32,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:32,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2019-11-28 02:46:32,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:32,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63638015] [2019-11-28 02:46:32,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:32,189 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:32,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63638015] [2019-11-28 02:46:32,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:32,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:32,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197604194] [2019-11-28 02:46:32,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:32,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:32,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:32,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:32,192 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2019-11-28 02:46:32,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:32,234 INFO L93 Difference]: Finished difference Result 6538 states and 7815 transitions. [2019-11-28 02:46:32,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:32,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 02:46:32,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:32,283 INFO L225 Difference]: With dead ends: 6538 [2019-11-28 02:46:32,284 INFO L226 Difference]: Without dead ends: 6538 [2019-11-28 02:46:32,284 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:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2019-11-28 02:46:32,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2019-11-28 02:46:32,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-11-28 02:46:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2019-11-28 02:46:32,413 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2019-11-28 02:46:32,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:32,413 INFO L462 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2019-11-28 02:46:32,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:32,414 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2019-11-28 02:46:32,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:46:32,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:32,423 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:32,424 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:32,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:32,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2019-11-28 02:46:32,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:32,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197533447] [2019-11-28 02:46:32,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:32,463 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:32,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197533447] [2019-11-28 02:46:32,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:32,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:32,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010889715] [2019-11-28 02:46:32,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:32,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:32,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:32,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:32,467 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2019-11-28 02:46:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:32,505 INFO L93 Difference]: Finished difference Result 7050 states and 8455 transitions. [2019-11-28 02:46:32,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:32,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 02:46:32,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:32,524 INFO L225 Difference]: With dead ends: 7050 [2019-11-28 02:46:32,525 INFO L226 Difference]: Without dead ends: 7050 [2019-11-28 02:46:32,526 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:32,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-11-28 02:46:32,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2019-11-28 02:46:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-11-28 02:46:32,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2019-11-28 02:46:32,668 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2019-11-28 02:46:32,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:32,669 INFO L462 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2019-11-28 02:46:32,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:32,669 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2019-11-28 02:46:32,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:46:32,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:32,680 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:32,680 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:32,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:32,680 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2019-11-28 02:46:32,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:32,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968381982] [2019-11-28 02:46:32,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:32,705 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:32,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968381982] [2019-11-28 02:46:32,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:32,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:32,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796337838] [2019-11-28 02:46:32,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:32,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:32,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:32,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:32,708 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2019-11-28 02:46:32,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:32,753 INFO L93 Difference]: Finished difference Result 10632 states and 12166 transitions. [2019-11-28 02:46:32,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:32,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 02:46:32,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:32,773 INFO L225 Difference]: With dead ends: 10632 [2019-11-28 02:46:32,773 INFO L226 Difference]: Without dead ends: 10632 [2019-11-28 02:46:32,775 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:32,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2019-11-28 02:46:32,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2019-11-28 02:46:32,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2019-11-28 02:46:32,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2019-11-28 02:46:32,959 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2019-11-28 02:46:32,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:32,959 INFO L462 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2019-11-28 02:46:32,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:32,960 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2019-11-28 02:46:32,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:46:32,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:32,980 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:32,980 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:32,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:32,981 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2019-11-28 02:46:32,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:32,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52174473] [2019-11-28 02:46:32,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:33,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:33,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52174473] [2019-11-28 02:46:33,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:33,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:33,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335910151] [2019-11-28 02:46:33,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:33,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:33,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:33,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:33,014 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2019-11-28 02:46:33,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:33,063 INFO L93 Difference]: Finished difference Result 12678 states and 13829 transitions. [2019-11-28 02:46:33,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:33,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 02:46:33,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:33,064 INFO L225 Difference]: With dead ends: 12678 [2019-11-28 02:46:33,064 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:46:33,065 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:33,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:46:33,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:46:33,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:46:33,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:46:33,066 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-11-28 02:46:33,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:33,066 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:46:33,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:33,066 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:46:33,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:46:33,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:46:33 BoogieIcfgContainer [2019-11-28 02:46:33,074 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:46:33,074 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:46:33,075 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:46:33,075 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:46:33,076 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:29" (3/4) ... [2019-11-28 02:46:33,080 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:46:33,088 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 02:46:33,089 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 02:46:33,098 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 02:46:33,099 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:46:33,099 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:46:33,210 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:46:33,210 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:46:33,212 INFO L168 Benchmark]: Toolchain (without parser) took 4728.93 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 238.0 MB). Free memory was 961.7 MB in the beginning and 914.7 MB in the end (delta: 47.0 MB). Peak memory consumption was 285.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:33,213 INFO L168 Benchmark]: CDTParser took 0.26 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:33,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.48 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:33,214 INFO L168 Benchmark]: Boogie Preprocessor took 106.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -187.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:33,214 INFO L168 Benchmark]: RCFGBuilder took 420.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:33,215 INFO L168 Benchmark]: TraceAbstraction took 3754.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 89.7 MB). Free memory was 1.1 GB in the beginning and 922.7 MB in the end (delta: 195.6 MB). Peak memory consumption was 285.3 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:33,215 INFO L168 Benchmark]: Witness Printer took 135.74 ms. Allocated memory is still 1.3 GB. Free memory was 922.7 MB in the beginning and 914.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:33,219 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 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 307.48 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 106.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -187.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 420.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3754.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 89.7 MB). Free memory was 1.1 GB in the beginning and 922.7 MB in the end (delta: 195.6 MB). Peak memory consumption was 285.3 MB. Max. memory is 11.5 GB. * Witness Printer took 135.74 ms. Allocated memory is still 1.3 GB. Free memory was 922.7 MB in the beginning and 914.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: 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, 41 locations, 1 error locations. Result: SAFE, OverallTime: 3.6s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1937 SDtfs, 926 SDslu, 1314 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10120occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 23930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...