/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:57:09,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:57:09,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:57:09,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:57:09,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:57:09,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:57:09,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:57:09,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:57:09,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:57:09,073 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:57:09,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:57:09,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:57:09,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:57:09,079 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:57:09,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:57:09,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:57:09,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:57:09,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:57:09,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:57:09,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:57:09,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:57:09,102 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:57:09,104 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:57:09,104 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:57:09,106 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:57:09,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:57:09,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:57:09,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:57:09,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:57:09,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:57:09,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:57:09,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:57:09,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:57:09,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:57:09,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:57:09,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:57:09,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:57:09,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:57:09,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:57:09,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:57:09,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:57:09,122 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:57:09,141 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:57:09,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:57:09,144 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:57:09,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:57:09,144 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:57:09,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:57:09,145 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:57:09,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:57:09,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:57:09,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:57:09,147 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:57:09,147 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:57:09,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:57:09,147 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:57:09,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:57:09,148 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:57:09,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:57:09,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:57:09,148 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:57:09,149 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:57:09,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:57:09,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:57:09,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:57:09,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:57:09,150 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:57:09,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:57:09,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:57:09,150 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:57:09,150 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:57:09,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:57:09,460 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:57:09,463 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:57:09,464 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:57:09,465 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:57:09,465 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_rmo.oepc.i [2019-12-27 01:57:09,527 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/361e50292/9814959a9a564bb880e953336417d3c9/FLAG1cf4cccf6 [2019-12-27 01:57:10,119 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:57:10,120 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_rmo.oepc.i [2019-12-27 01:57:10,147 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/361e50292/9814959a9a564bb880e953336417d3c9/FLAG1cf4cccf6 [2019-12-27 01:57:10,365 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/361e50292/9814959a9a564bb880e953336417d3c9 [2019-12-27 01:57:10,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:57:10,375 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:57:10,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:57:10,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:57:10,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:57:10,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:57:10" (1/1) ... [2019-12-27 01:57:10,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4da409ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:10, skipping insertion in model container [2019-12-27 01:57:10,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:57:10" (1/1) ... [2019-12-27 01:57:10,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:57:10,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:57:11,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:57:11,019 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:57:11,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:57:11,184 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:57:11,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:11 WrapperNode [2019-12-27 01:57:11,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:57:11,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:57:11,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:57:11,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:57:11,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:11" (1/1) ... [2019-12-27 01:57:11,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:11" (1/1) ... [2019-12-27 01:57:11,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:57:11,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:57:11,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:57:11,257 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:57:11,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:11" (1/1) ... [2019-12-27 01:57:11,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:11" (1/1) ... [2019-12-27 01:57:11,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:11" (1/1) ... [2019-12-27 01:57:11,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:11" (1/1) ... [2019-12-27 01:57:11,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:11" (1/1) ... [2019-12-27 01:57:11,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:11" (1/1) ... [2019-12-27 01:57:11,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:11" (1/1) ... [2019-12-27 01:57:11,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:57:11,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:57:11,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:57:11,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:57:11,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:11" (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-12-27 01:57:11,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:57:11,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:57:11,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:57:11,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:57:11,378 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:57:11,378 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:57:11,379 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:57:11,379 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:57:11,379 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:57:11,379 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:57:11,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:57:11,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:57:11,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:57:11,382 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:57:12,146 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:57:12,146 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:57:12,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:57:12 BoogieIcfgContainer [2019-12-27 01:57:12,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:57:12,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:57:12,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:57:12,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:57:12,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:57:10" (1/3) ... [2019-12-27 01:57:12,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2955d62c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:57:12, skipping insertion in model container [2019-12-27 01:57:12,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:11" (2/3) ... [2019-12-27 01:57:12,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2955d62c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:57:12, skipping insertion in model container [2019-12-27 01:57:12,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:57:12" (3/3) ... [2019-12-27 01:57:12,157 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_rmo.oepc.i [2019-12-27 01:57:12,167 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:57:12,168 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:57:12,176 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:57:12,177 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:57:12,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,235 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,235 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,236 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,236 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,236 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,243 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,243 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,251 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,251 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,279 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,281 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,289 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,290 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,290 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,292 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,292 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:12,312 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:57:12,333 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:57:12,333 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:57:12,333 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:57:12,333 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:57:12,333 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:57:12,334 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:57:12,334 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:57:12,334 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:57:12,351 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 01:57:12,353 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 01:57:12,461 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 01:57:12,461 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:57:12,478 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:57:12,505 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 01:57:12,559 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 01:57:12,559 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:57:12,567 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:57:12,589 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 01:57:12,591 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:57:17,780 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 01:57:17,913 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 01:57:18,200 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-27 01:57:18,201 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 01:57:18,205 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-27 01:57:40,154 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-27 01:57:40,156 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-27 01:57:40,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:57:40,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:40,162 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:57:40,163 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:40,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:40,169 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-27 01:57:40,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:40,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838334334] [2019-12-27 01:57:40,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:40,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:40,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838334334] [2019-12-27 01:57:40,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:40,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:57:40,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669191639] [2019-12-27 01:57:40,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:57:40,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:40,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:57:40,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:57:40,425 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-27 01:57:44,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:44,557 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-27 01:57:44,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:57:44,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:57:44,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:45,589 INFO L225 Difference]: With dead ends: 121140 [2019-12-27 01:57:45,589 INFO L226 Difference]: Without dead ends: 107958 [2019-12-27 01:57:45,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-27 01:57:50,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-27 01:57:52,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-27 01:57:52,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-27 01:57:56,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-27 01:57:56,454 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-27 01:57:56,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:56,455 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-27 01:57:56,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:57:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-27 01:57:56,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:57:56,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:56,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:56,459 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:56,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:56,460 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-27 01:57:56,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:56,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606954204] [2019-12-27 01:57:56,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:56,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:56,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606954204] [2019-12-27 01:57:56,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:56,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:57:56,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642213710] [2019-12-27 01:57:56,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:57:56,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:56,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:57:56,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:57:56,563 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-27 01:58:02,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:02,194 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-27 01:58:02,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:58:02,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:58:02,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:02,756 INFO L225 Difference]: With dead ends: 172022 [2019-12-27 01:58:02,756 INFO L226 Difference]: Without dead ends: 171924 [2019-12-27 01:58:02,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:58:07,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-27 01:58:11,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-27 01:58:11,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-27 01:58:12,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-27 01:58:12,210 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-27 01:58:12,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:12,211 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-27 01:58:12,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:58:12,211 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-27 01:58:12,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:58:12,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:12,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:58:12,218 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:12,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:12,218 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-27 01:58:12,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:12,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624384398] [2019-12-27 01:58:12,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:12,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624384398] [2019-12-27 01:58:12,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:12,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:58:12,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368724903] [2019-12-27 01:58:12,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:58:12,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:12,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:58:12,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:58:12,290 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-27 01:58:12,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:12,418 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-27 01:58:12,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:58:12,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:58:12,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:12,510 INFO L225 Difference]: With dead ends: 33388 [2019-12-27 01:58:12,510 INFO L226 Difference]: Without dead ends: 33388 [2019-12-27 01:58:12,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 01:58:12,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-27 01:58:17,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-27 01:58:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-27 01:58:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-27 01:58:17,845 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-27 01:58:17,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:17,845 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-27 01:58:17,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:58:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-27 01:58:17,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:58:17,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:17,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:58:17,849 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:17,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:17,850 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-27 01:58:17,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:17,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823848104] [2019-12-27 01:58:17,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:17,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:17,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823848104] [2019-12-27 01:58:17,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:17,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:58:17,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577624041] [2019-12-27 01:58:17,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:58:17,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:17,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:58:17,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:58:17,946 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-27 01:58:18,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:18,136 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-27 01:58:18,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:58:18,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 01:58:18,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:18,261 INFO L225 Difference]: With dead ends: 52822 [2019-12-27 01:58:18,262 INFO L226 Difference]: Without dead ends: 52822 [2019-12-27 01:58:18,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:58:18,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-27 01:58:18,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-27 01:58:18,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-27 01:58:19,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-27 01:58:19,073 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-27 01:58:19,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:19,075 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-27 01:58:19,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:58:19,075 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-27 01:58:19,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:58:19,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:19,079 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:58:19,079 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:19,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:19,079 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-27 01:58:19,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:19,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118278820] [2019-12-27 01:58:19,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:19,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118278820] [2019-12-27 01:58:19,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:19,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:58:19,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340756788] [2019-12-27 01:58:19,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:58:19,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:19,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:58:19,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:58:19,454 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-27 01:58:19,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:19,810 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-27 01:58:19,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:58:19,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:58:19,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:19,919 INFO L225 Difference]: With dead ends: 46903 [2019-12-27 01:58:19,919 INFO L226 Difference]: Without dead ends: 46903 [2019-12-27 01:58:19,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:58:20,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-27 01:58:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-27 01:58:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-27 01:58:20,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-27 01:58:20,687 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-27 01:58:20,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:20,688 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-27 01:58:20,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:58:20,688 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-27 01:58:20,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:58:20,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:20,691 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:58:20,692 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:20,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:20,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-27 01:58:20,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:20,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726898188] [2019-12-27 01:58:20,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:20,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:20,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726898188] [2019-12-27 01:58:20,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:20,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:58:20,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22351989] [2019-12-27 01:58:20,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:58:20,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:20,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:58:20,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:58:20,750 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-27 01:58:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:21,146 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-27 01:58:21,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:58:21,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:58:21,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:21,233 INFO L225 Difference]: With dead ends: 51478 [2019-12-27 01:58:21,234 INFO L226 Difference]: Without dead ends: 51478 [2019-12-27 01:58:21,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:58:21,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-27 01:58:22,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-27 01:58:22,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-27 01:58:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-27 01:58:22,412 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-27 01:58:22,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:22,413 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-27 01:58:22,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:58:22,413 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-27 01:58:22,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:58:22,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:22,424 INFO L411 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-12-27 01:58:22,424 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:22,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:22,424 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-27 01:58:22,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:22,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579701422] [2019-12-27 01:58:22,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:22,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:22,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579701422] [2019-12-27 01:58:22,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:22,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:58:22,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808763114] [2019-12-27 01:58:22,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:58:22,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:22,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:58:22,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:58:22,500 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-27 01:58:23,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:23,222 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-27 01:58:23,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:58:23,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:58:23,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:23,330 INFO L225 Difference]: With dead ends: 61264 [2019-12-27 01:58:23,330 INFO L226 Difference]: Without dead ends: 61250 [2019-12-27 01:58:23,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:58:23,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-27 01:58:24,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-27 01:58:24,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-27 01:58:24,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-27 01:58:24,634 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-27 01:58:24,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:24,635 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-27 01:58:24,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:58:24,635 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-27 01:58:24,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:58:24,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:24,646 INFO L411 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-12-27 01:58:24,646 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:24,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:24,646 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-27 01:58:24,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:24,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526574929] [2019-12-27 01:58:24,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:24,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526574929] [2019-12-27 01:58:24,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:24,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:58:24,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004177849] [2019-12-27 01:58:24,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:58:24,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:24,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:58:24,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:58:24,714 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-27 01:58:25,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:25,372 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-27 01:58:25,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:58:25,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:58:25,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:25,487 INFO L225 Difference]: With dead ends: 63752 [2019-12-27 01:58:25,487 INFO L226 Difference]: Without dead ends: 63738 [2019-12-27 01:58:25,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:58:25,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-27 01:58:26,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-27 01:58:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-27 01:58:26,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-27 01:58:26,763 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-27 01:58:26,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:26,763 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-27 01:58:26,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:58:26,763 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-27 01:58:26,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:58:26,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:26,776 INFO L411 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-12-27 01:58:26,777 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:26,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:26,777 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-27 01:58:26,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:26,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216361419] [2019-12-27 01:58:26,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:26,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216361419] [2019-12-27 01:58:26,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:26,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:58:26,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195165616] [2019-12-27 01:58:26,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:58:26,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:26,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:58:26,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:58:26,830 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 4 states. [2019-12-27 01:58:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:26,910 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-27 01:58:26,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:58:26,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:58:26,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:26,941 INFO L225 Difference]: With dead ends: 17193 [2019-12-27 01:58:26,941 INFO L226 Difference]: Without dead ends: 17193 [2019-12-27 01:58:26,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:58:27,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-27 01:58:27,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-27 01:58:27,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-27 01:58:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-27 01:58:27,184 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-27 01:58:27,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:27,184 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-27 01:58:27,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:58:27,184 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-27 01:58:27,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 01:58:27,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:27,196 INFO L411 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-12-27 01:58:27,197 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:27,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:27,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-27 01:58:27,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:27,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295205656] [2019-12-27 01:58:27,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:27,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295205656] [2019-12-27 01:58:27,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:27,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:58:27,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952744368] [2019-12-27 01:58:27,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:58:27,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:27,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:58:27,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:58:27,268 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-27 01:58:27,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:27,586 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-27 01:58:27,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:58:27,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 01:58:27,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:27,617 INFO L225 Difference]: With dead ends: 21613 [2019-12-27 01:58:27,617 INFO L226 Difference]: Without dead ends: 21613 [2019-12-27 01:58:27,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:58:27,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-27 01:58:27,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-27 01:58:27,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-27 01:58:27,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-27 01:58:27,908 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-27 01:58:27,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:27,908 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-27 01:58:27,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:58:27,908 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-27 01:58:27,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 01:58:27,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:27,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:58:27,925 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:27,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:27,926 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-27 01:58:27,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:27,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584474270] [2019-12-27 01:58:27,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:27,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:27,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584474270] [2019-12-27 01:58:27,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:27,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:58:27,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095806938] [2019-12-27 01:58:27,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:58:27,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:27,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:58:27,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:58:27,990 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-27 01:58:28,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:28,340 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-27 01:58:28,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:58:28,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 01:58:28,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:28,372 INFO L225 Difference]: With dead ends: 23624 [2019-12-27 01:58:28,372 INFO L226 Difference]: Without dead ends: 23624 [2019-12-27 01:58:28,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:58:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-27 01:58:28,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-27 01:58:28,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-27 01:58:28,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-27 01:58:28,896 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-27 01:58:28,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:28,896 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-27 01:58:28,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:58:28,897 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-27 01:58:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 01:58:28,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:28,915 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:58:28,916 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:28,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:28,916 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-27 01:58:28,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:28,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647491649] [2019-12-27 01:58:28,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:29,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:29,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647491649] [2019-12-27 01:58:29,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:29,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:58:29,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762618264] [2019-12-27 01:58:29,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:58:29,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:29,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:58:29,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:58:29,010 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 6 states. [2019-12-27 01:58:29,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:29,676 INFO L93 Difference]: Finished difference Result 27031 states and 80502 transitions. [2019-12-27 01:58:29,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:58:29,677 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 01:58:29,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:29,716 INFO L225 Difference]: With dead ends: 27031 [2019-12-27 01:58:29,716 INFO L226 Difference]: Without dead ends: 27031 [2019-12-27 01:58:29,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:58:29,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-27 01:58:30,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 20764. [2019-12-27 01:58:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20764 states. [2019-12-27 01:58:30,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20764 states to 20764 states and 63071 transitions. [2019-12-27 01:58:30,051 INFO L78 Accepts]: Start accepts. Automaton has 20764 states and 63071 transitions. Word has length 32 [2019-12-27 01:58:30,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:30,051 INFO L462 AbstractCegarLoop]: Abstraction has 20764 states and 63071 transitions. [2019-12-27 01:58:30,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:58:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 20764 states and 63071 transitions. [2019-12-27 01:58:30,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:58:30,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:30,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:58:30,073 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:30,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:30,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-27 01:58:30,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:30,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249785194] [2019-12-27 01:58:30,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:30,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249785194] [2019-12-27 01:58:30,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:30,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:58:30,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485251927] [2019-12-27 01:58:30,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:58:30,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:30,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:58:30,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:58:30,161 INFO L87 Difference]: Start difference. First operand 20764 states and 63071 transitions. Second operand 6 states. [2019-12-27 01:58:30,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:30,820 INFO L93 Difference]: Finished difference Result 26334 states and 78684 transitions. [2019-12-27 01:58:30,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:58:30,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 01:58:30,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:30,860 INFO L225 Difference]: With dead ends: 26334 [2019-12-27 01:58:30,860 INFO L226 Difference]: Without dead ends: 26334 [2019-12-27 01:58:30,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:58:30,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26334 states. [2019-12-27 01:58:31,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26334 to 17642. [2019-12-27 01:58:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17642 states. [2019-12-27 01:58:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17642 states to 17642 states and 53957 transitions. [2019-12-27 01:58:31,179 INFO L78 Accepts]: Start accepts. Automaton has 17642 states and 53957 transitions. Word has length 34 [2019-12-27 01:58:31,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:31,179 INFO L462 AbstractCegarLoop]: Abstraction has 17642 states and 53957 transitions. [2019-12-27 01:58:31,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:58:31,180 INFO L276 IsEmpty]: Start isEmpty. Operand 17642 states and 53957 transitions. [2019-12-27 01:58:31,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:58:31,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:31,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:58:31,197 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:31,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:31,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-27 01:58:31,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:31,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284970086] [2019-12-27 01:58:31,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:31,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284970086] [2019-12-27 01:58:31,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:31,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:58:31,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036886377] [2019-12-27 01:58:31,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:58:31,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:31,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:58:31,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:58:31,257 INFO L87 Difference]: Start difference. First operand 17642 states and 53957 transitions. Second operand 3 states. [2019-12-27 01:58:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:31,332 INFO L93 Difference]: Finished difference Result 17641 states and 53955 transitions. [2019-12-27 01:58:31,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:58:31,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:58:31,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:31,376 INFO L225 Difference]: With dead ends: 17641 [2019-12-27 01:58:31,376 INFO L226 Difference]: Without dead ends: 17641 [2019-12-27 01:58:31,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-27 01:58:31,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17641 states. [2019-12-27 01:58:32,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17641 to 17641. [2019-12-27 01:58:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17641 states. [2019-12-27 01:58:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17641 states to 17641 states and 53955 transitions. [2019-12-27 01:58:32,135 INFO L78 Accepts]: Start accepts. Automaton has 17641 states and 53955 transitions. Word has length 39 [2019-12-27 01:58:32,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:32,136 INFO L462 AbstractCegarLoop]: Abstraction has 17641 states and 53955 transitions. [2019-12-27 01:58:32,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:58:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 17641 states and 53955 transitions. [2019-12-27 01:58:32,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:58:32,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:32,162 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:58:32,162 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:32,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:32,163 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-27 01:58:32,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:32,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083720494] [2019-12-27 01:58:32,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:32,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083720494] [2019-12-27 01:58:32,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:32,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:58:32,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311703768] [2019-12-27 01:58:32,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:58:32,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:32,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:58:32,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:58:32,270 INFO L87 Difference]: Start difference. First operand 17641 states and 53955 transitions. Second operand 5 states. [2019-12-27 01:58:32,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:32,925 INFO L93 Difference]: Finished difference Result 25346 states and 76639 transitions. [2019-12-27 01:58:32,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:58:32,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:58:32,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:32,980 INFO L225 Difference]: With dead ends: 25346 [2019-12-27 01:58:32,980 INFO L226 Difference]: Without dead ends: 25346 [2019-12-27 01:58:32,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:58:33,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25346 states. [2019-12-27 01:58:33,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25346 to 23560. [2019-12-27 01:58:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23560 states. [2019-12-27 01:58:33,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23560 states to 23560 states and 71751 transitions. [2019-12-27 01:58:33,355 INFO L78 Accepts]: Start accepts. Automaton has 23560 states and 71751 transitions. Word has length 40 [2019-12-27 01:58:33,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:33,355 INFO L462 AbstractCegarLoop]: Abstraction has 23560 states and 71751 transitions. [2019-12-27 01:58:33,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:58:33,355 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 71751 transitions. [2019-12-27 01:58:33,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:58:33,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:33,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:58:33,383 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:33,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:33,384 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-27 01:58:33,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:33,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622297858] [2019-12-27 01:58:33,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:33,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:33,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622297858] [2019-12-27 01:58:33,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:33,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:58:33,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094936014] [2019-12-27 01:58:33,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:58:33,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:33,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:58:33,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:58:33,440 INFO L87 Difference]: Start difference. First operand 23560 states and 71751 transitions. Second operand 5 states. [2019-12-27 01:58:33,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:33,547 INFO L93 Difference]: Finished difference Result 22175 states and 68518 transitions. [2019-12-27 01:58:33,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:58:33,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:58:33,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:33,589 INFO L225 Difference]: With dead ends: 22175 [2019-12-27 01:58:33,589 INFO L226 Difference]: Without dead ends: 22175 [2019-12-27 01:58:33,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:58:33,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22175 states. [2019-12-27 01:58:33,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22175 to 21251. [2019-12-27 01:58:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21251 states. [2019-12-27 01:58:33,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21251 states to 21251 states and 66025 transitions. [2019-12-27 01:58:33,939 INFO L78 Accepts]: Start accepts. Automaton has 21251 states and 66025 transitions. Word has length 40 [2019-12-27 01:58:33,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:33,939 INFO L462 AbstractCegarLoop]: Abstraction has 21251 states and 66025 transitions. [2019-12-27 01:58:33,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:58:33,940 INFO L276 IsEmpty]: Start isEmpty. Operand 21251 states and 66025 transitions. [2019-12-27 01:58:33,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:58:33,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:33,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:58:33,970 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:33,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:33,971 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-27 01:58:33,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:33,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197592190] [2019-12-27 01:58:33,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:34,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:34,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197592190] [2019-12-27 01:58:34,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:34,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:58:34,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967644757] [2019-12-27 01:58:34,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:58:34,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:34,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:58:34,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:58:34,064 INFO L87 Difference]: Start difference. First operand 21251 states and 66025 transitions. Second operand 7 states. [2019-12-27 01:58:34,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:34,603 INFO L93 Difference]: Finished difference Result 62478 states and 192933 transitions. [2019-12-27 01:58:34,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 01:58:34,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:58:34,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:34,672 INFO L225 Difference]: With dead ends: 62478 [2019-12-27 01:58:34,672 INFO L226 Difference]: Without dead ends: 47634 [2019-12-27 01:58:34,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:58:34,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47634 states. [2019-12-27 01:58:35,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47634 to 25007. [2019-12-27 01:58:35,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25007 states. [2019-12-27 01:58:35,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25007 states to 25007 states and 78146 transitions. [2019-12-27 01:58:35,557 INFO L78 Accepts]: Start accepts. Automaton has 25007 states and 78146 transitions. Word has length 63 [2019-12-27 01:58:35,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:35,557 INFO L462 AbstractCegarLoop]: Abstraction has 25007 states and 78146 transitions. [2019-12-27 01:58:35,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:58:35,557 INFO L276 IsEmpty]: Start isEmpty. Operand 25007 states and 78146 transitions. [2019-12-27 01:58:35,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:58:35,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:35,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:58:35,588 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:35,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:35,588 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-27 01:58:35,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:35,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19601879] [2019-12-27 01:58:35,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:35,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19601879] [2019-12-27 01:58:35,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:35,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:58:35,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345580813] [2019-12-27 01:58:35,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:58:35,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:35,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:58:35,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:58:35,683 INFO L87 Difference]: Start difference. First operand 25007 states and 78146 transitions. Second operand 7 states. [2019-12-27 01:58:36,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:36,223 INFO L93 Difference]: Finished difference Result 68433 states and 210070 transitions. [2019-12-27 01:58:36,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:58:36,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:58:36,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:36,295 INFO L225 Difference]: With dead ends: 68433 [2019-12-27 01:58:36,295 INFO L226 Difference]: Without dead ends: 48478 [2019-12-27 01:58:36,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:58:36,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48478 states. [2019-12-27 01:58:36,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48478 to 28798. [2019-12-27 01:58:36,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28798 states. [2019-12-27 01:58:36,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28798 states to 28798 states and 89643 transitions. [2019-12-27 01:58:36,907 INFO L78 Accepts]: Start accepts. Automaton has 28798 states and 89643 transitions. Word has length 63 [2019-12-27 01:58:36,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:36,908 INFO L462 AbstractCegarLoop]: Abstraction has 28798 states and 89643 transitions. [2019-12-27 01:58:36,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:58:36,908 INFO L276 IsEmpty]: Start isEmpty. Operand 28798 states and 89643 transitions. [2019-12-27 01:58:36,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:58:36,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:36,956 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:58:36,956 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:36,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:36,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-27 01:58:36,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:36,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483753193] [2019-12-27 01:58:36,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:37,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483753193] [2019-12-27 01:58:37,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:37,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:58:37,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222982105] [2019-12-27 01:58:37,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:58:37,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:37,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:58:37,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:58:37,042 INFO L87 Difference]: Start difference. First operand 28798 states and 89643 transitions. Second operand 7 states. [2019-12-27 01:58:37,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:37,613 INFO L93 Difference]: Finished difference Result 59843 states and 183697 transitions. [2019-12-27 01:58:37,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:58:37,613 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:58:37,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:38,063 INFO L225 Difference]: With dead ends: 59843 [2019-12-27 01:58:38,063 INFO L226 Difference]: Without dead ends: 52762 [2019-12-27 01:58:38,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:58:38,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52762 states. [2019-12-27 01:58:38,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52762 to 29106. [2019-12-27 01:58:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29106 states. [2019-12-27 01:58:38,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29106 states to 29106 states and 90594 transitions. [2019-12-27 01:58:38,654 INFO L78 Accepts]: Start accepts. Automaton has 29106 states and 90594 transitions. Word has length 63 [2019-12-27 01:58:38,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:38,655 INFO L462 AbstractCegarLoop]: Abstraction has 29106 states and 90594 transitions. [2019-12-27 01:58:38,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:58:38,655 INFO L276 IsEmpty]: Start isEmpty. Operand 29106 states and 90594 transitions. [2019-12-27 01:58:38,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:58:38,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:38,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:58:38,687 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:38,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:38,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-27 01:58:38,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:38,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086893109] [2019-12-27 01:58:38,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:38,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:38,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086893109] [2019-12-27 01:58:38,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:38,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:58:38,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155413749] [2019-12-27 01:58:38,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:58:38,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:38,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:58:38,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:58:38,819 INFO L87 Difference]: Start difference. First operand 29106 states and 90594 transitions. Second operand 8 states. [2019-12-27 01:58:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:40,086 INFO L93 Difference]: Finished difference Result 38094 states and 116230 transitions. [2019-12-27 01:58:40,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 01:58:40,087 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 01:58:40,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:40,144 INFO L225 Difference]: With dead ends: 38094 [2019-12-27 01:58:40,145 INFO L226 Difference]: Without dead ends: 37870 [2019-12-27 01:58:40,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:58:40,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37870 states. [2019-12-27 01:58:40,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37870 to 31894. [2019-12-27 01:58:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31894 states. [2019-12-27 01:58:40,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31894 states to 31894 states and 98893 transitions. [2019-12-27 01:58:40,690 INFO L78 Accepts]: Start accepts. Automaton has 31894 states and 98893 transitions. Word has length 63 [2019-12-27 01:58:40,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:40,690 INFO L462 AbstractCegarLoop]: Abstraction has 31894 states and 98893 transitions. [2019-12-27 01:58:40,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:58:40,690 INFO L276 IsEmpty]: Start isEmpty. Operand 31894 states and 98893 transitions. [2019-12-27 01:58:40,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:58:40,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:40,726 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:58:40,726 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:40,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:40,727 INFO L82 PathProgramCache]: Analyzing trace with hash 232911163, now seen corresponding path program 5 times [2019-12-27 01:58:40,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:40,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085562837] [2019-12-27 01:58:40,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:40,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:40,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085562837] [2019-12-27 01:58:40,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:40,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:58:40,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606846635] [2019-12-27 01:58:40,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:58:40,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:40,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:58:40,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:58:40,853 INFO L87 Difference]: Start difference. First operand 31894 states and 98893 transitions. Second operand 7 states. [2019-12-27 01:58:43,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:43,070 INFO L93 Difference]: Finished difference Result 54976 states and 166682 transitions. [2019-12-27 01:58:43,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 01:58:43,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:58:43,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:43,192 INFO L225 Difference]: With dead ends: 54976 [2019-12-27 01:58:43,192 INFO L226 Difference]: Without dead ends: 54653 [2019-12-27 01:58:43,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-12-27 01:58:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54653 states. [2019-12-27 01:58:43,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54653 to 34658. [2019-12-27 01:58:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34658 states. [2019-12-27 01:58:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34658 states to 34658 states and 107721 transitions. [2019-12-27 01:58:43,930 INFO L78 Accepts]: Start accepts. Automaton has 34658 states and 107721 transitions. Word has length 63 [2019-12-27 01:58:43,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:43,931 INFO L462 AbstractCegarLoop]: Abstraction has 34658 states and 107721 transitions. [2019-12-27 01:58:43,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:58:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 34658 states and 107721 transitions. [2019-12-27 01:58:43,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:58:43,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:43,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:58:43,971 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:43,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:43,972 INFO L82 PathProgramCache]: Analyzing trace with hash 908177687, now seen corresponding path program 6 times [2019-12-27 01:58:43,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:43,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110920037] [2019-12-27 01:58:43,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:44,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:44,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110920037] [2019-12-27 01:58:44,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:44,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:58:44,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537049898] [2019-12-27 01:58:44,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:58:44,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:44,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:58:44,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:58:44,089 INFO L87 Difference]: Start difference. First operand 34658 states and 107721 transitions. Second operand 7 states. [2019-12-27 01:58:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:45,073 INFO L93 Difference]: Finished difference Result 57288 states and 175480 transitions. [2019-12-27 01:58:45,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 01:58:45,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:58:45,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:45,158 INFO L225 Difference]: With dead ends: 57288 [2019-12-27 01:58:45,159 INFO L226 Difference]: Without dead ends: 57068 [2019-12-27 01:58:45,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:58:45,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57068 states. [2019-12-27 01:58:46,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57068 to 40390. [2019-12-27 01:58:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40390 states. [2019-12-27 01:58:46,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40390 states to 40390 states and 125252 transitions. [2019-12-27 01:58:46,302 INFO L78 Accepts]: Start accepts. Automaton has 40390 states and 125252 transitions. Word has length 63 [2019-12-27 01:58:46,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:46,302 INFO L462 AbstractCegarLoop]: Abstraction has 40390 states and 125252 transitions. [2019-12-27 01:58:46,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:58:46,302 INFO L276 IsEmpty]: Start isEmpty. Operand 40390 states and 125252 transitions. [2019-12-27 01:58:46,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:58:46,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:46,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:58:46,354 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:46,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:46,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1577046585, now seen corresponding path program 7 times [2019-12-27 01:58:46,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:46,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330594648] [2019-12-27 01:58:46,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:46,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:46,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330594648] [2019-12-27 01:58:46,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:46,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:58:46,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562535763] [2019-12-27 01:58:46,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:58:46,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:46,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:58:46,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:58:46,525 INFO L87 Difference]: Start difference. First operand 40390 states and 125252 transitions. Second operand 9 states. [2019-12-27 01:58:47,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:47,813 INFO L93 Difference]: Finished difference Result 60008 states and 183321 transitions. [2019-12-27 01:58:47,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 01:58:47,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-27 01:58:47,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:47,906 INFO L225 Difference]: With dead ends: 60008 [2019-12-27 01:58:47,906 INFO L226 Difference]: Without dead ends: 59756 [2019-12-27 01:58:47,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-27 01:58:48,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59756 states. [2019-12-27 01:58:48,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59756 to 40339. [2019-12-27 01:58:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40339 states. [2019-12-27 01:58:48,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40339 states to 40339 states and 125109 transitions. [2019-12-27 01:58:48,704 INFO L78 Accepts]: Start accepts. Automaton has 40339 states and 125109 transitions. Word has length 63 [2019-12-27 01:58:48,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:48,704 INFO L462 AbstractCegarLoop]: Abstraction has 40339 states and 125109 transitions. [2019-12-27 01:58:48,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:58:48,704 INFO L276 IsEmpty]: Start isEmpty. Operand 40339 states and 125109 transitions. [2019-12-27 01:58:48,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:58:48,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:48,754 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:58:48,754 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:48,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:48,754 INFO L82 PathProgramCache]: Analyzing trace with hash 593914995, now seen corresponding path program 8 times [2019-12-27 01:58:48,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:48,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396566326] [2019-12-27 01:58:48,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:48,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:48,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396566326] [2019-12-27 01:58:48,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:48,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:58:48,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410400016] [2019-12-27 01:58:48,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:58:48,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:48,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:58:48,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:58:48,862 INFO L87 Difference]: Start difference. First operand 40339 states and 125109 transitions. Second operand 8 states. [2019-12-27 01:58:51,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:51,079 INFO L93 Difference]: Finished difference Result 58458 states and 177165 transitions. [2019-12-27 01:58:51,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:58:51,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 01:58:51,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:51,165 INFO L225 Difference]: With dead ends: 58458 [2019-12-27 01:58:51,165 INFO L226 Difference]: Without dead ends: 58458 [2019-12-27 01:58:51,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2019-12-27 01:58:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58458 states. [2019-12-27 01:58:51,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58458 to 39692. [2019-12-27 01:58:51,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39692 states. [2019-12-27 01:58:51,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39692 states to 39692 states and 123217 transitions. [2019-12-27 01:58:51,924 INFO L78 Accepts]: Start accepts. Automaton has 39692 states and 123217 transitions. Word has length 63 [2019-12-27 01:58:51,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:51,924 INFO L462 AbstractCegarLoop]: Abstraction has 39692 states and 123217 transitions. [2019-12-27 01:58:51,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:58:51,924 INFO L276 IsEmpty]: Start isEmpty. Operand 39692 states and 123217 transitions. [2019-12-27 01:58:51,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:58:51,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:51,974 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:58:51,974 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:51,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:51,974 INFO L82 PathProgramCache]: Analyzing trace with hash 194134925, now seen corresponding path program 9 times [2019-12-27 01:58:51,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:51,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312884544] [2019-12-27 01:58:51,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:52,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:52,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312884544] [2019-12-27 01:58:52,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:52,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:58:52,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572292659] [2019-12-27 01:58:52,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:58:52,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:52,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:58:52,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:58:52,082 INFO L87 Difference]: Start difference. First operand 39692 states and 123217 transitions. Second operand 8 states. [2019-12-27 01:58:53,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:53,229 INFO L93 Difference]: Finished difference Result 55159 states and 169085 transitions. [2019-12-27 01:58:53,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 01:58:53,229 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 01:58:53,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:53,314 INFO L225 Difference]: With dead ends: 55159 [2019-12-27 01:58:53,315 INFO L226 Difference]: Without dead ends: 55159 [2019-12-27 01:58:53,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:58:53,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55159 states. [2019-12-27 01:58:54,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55159 to 38889. [2019-12-27 01:58:54,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38889 states. [2019-12-27 01:58:54,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38889 states to 38889 states and 120766 transitions. [2019-12-27 01:58:54,586 INFO L78 Accepts]: Start accepts. Automaton has 38889 states and 120766 transitions. Word has length 63 [2019-12-27 01:58:54,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:54,586 INFO L462 AbstractCegarLoop]: Abstraction has 38889 states and 120766 transitions. [2019-12-27 01:58:54,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:58:54,586 INFO L276 IsEmpty]: Start isEmpty. Operand 38889 states and 120766 transitions. [2019-12-27 01:58:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:58:54,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:54,632 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:58:54,633 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:54,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:54,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1930988027, now seen corresponding path program 10 times [2019-12-27 01:58:54,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:54,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439768232] [2019-12-27 01:58:54,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:54,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:54,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439768232] [2019-12-27 01:58:54,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:54,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:58:54,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237562880] [2019-12-27 01:58:54,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:58:54,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:54,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:58:54,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:58:54,760 INFO L87 Difference]: Start difference. First operand 38889 states and 120766 transitions. Second operand 9 states. [2019-12-27 01:58:56,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:56,227 INFO L93 Difference]: Finished difference Result 56103 states and 171957 transitions. [2019-12-27 01:58:56,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:58:56,228 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-27 01:58:56,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:56,311 INFO L225 Difference]: With dead ends: 56103 [2019-12-27 01:58:56,311 INFO L226 Difference]: Without dead ends: 56103 [2019-12-27 01:58:56,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2019-12-27 01:58:56,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56103 states. [2019-12-27 01:58:56,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56103 to 36616. [2019-12-27 01:58:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36616 states. [2019-12-27 01:58:57,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36616 states to 36616 states and 113998 transitions. [2019-12-27 01:58:57,041 INFO L78 Accepts]: Start accepts. Automaton has 36616 states and 113998 transitions. Word has length 63 [2019-12-27 01:58:57,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:57,041 INFO L462 AbstractCegarLoop]: Abstraction has 36616 states and 113998 transitions. [2019-12-27 01:58:57,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:58:57,042 INFO L276 IsEmpty]: Start isEmpty. Operand 36616 states and 113998 transitions. [2019-12-27 01:58:57,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:58:57,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:57,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:58:57,082 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:57,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:57,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1638823163, now seen corresponding path program 11 times [2019-12-27 01:58:57,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:57,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549831025] [2019-12-27 01:58:57,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:57,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549831025] [2019-12-27 01:58:57,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:57,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:58:57,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420678425] [2019-12-27 01:58:57,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:58:57,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:57,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:58:57,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:58:57,179 INFO L87 Difference]: Start difference. First operand 36616 states and 113998 transitions. Second operand 7 states. [2019-12-27 01:58:58,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:58,050 INFO L93 Difference]: Finished difference Result 57418 states and 175676 transitions. [2019-12-27 01:58:58,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:58:58,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:58:58,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:58,137 INFO L225 Difference]: With dead ends: 57418 [2019-12-27 01:58:58,138 INFO L226 Difference]: Without dead ends: 57418 [2019-12-27 01:58:58,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:58:58,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57418 states. [2019-12-27 01:58:59,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57418 to 39035. [2019-12-27 01:58:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39035 states. [2019-12-27 01:58:59,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39035 states to 39035 states and 121312 transitions. [2019-12-27 01:58:59,226 INFO L78 Accepts]: Start accepts. Automaton has 39035 states and 121312 transitions. Word has length 63 [2019-12-27 01:58:59,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:59,227 INFO L462 AbstractCegarLoop]: Abstraction has 39035 states and 121312 transitions. [2019-12-27 01:58:59,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:58:59,227 INFO L276 IsEmpty]: Start isEmpty. Operand 39035 states and 121312 transitions. [2019-12-27 01:58:59,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:58:59,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:59,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:58:59,271 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:59,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:59,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1952090881, now seen corresponding path program 12 times [2019-12-27 01:58:59,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:59,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766555309] [2019-12-27 01:58:59,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:59,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766555309] [2019-12-27 01:58:59,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:59,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:58:59,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189959954] [2019-12-27 01:58:59,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:58:59,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:59,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:58:59,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:58:59,399 INFO L87 Difference]: Start difference. First operand 39035 states and 121312 transitions. Second operand 8 states. [2019-12-27 01:59:00,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:00,503 INFO L93 Difference]: Finished difference Result 54712 states and 167584 transitions. [2019-12-27 01:59:00,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:59:00,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 01:59:00,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:00,584 INFO L225 Difference]: With dead ends: 54712 [2019-12-27 01:59:00,584 INFO L226 Difference]: Without dead ends: 54656 [2019-12-27 01:59:00,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:59:00,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54656 states. [2019-12-27 01:59:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54656 to 38782. [2019-12-27 01:59:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38782 states. [2019-12-27 01:59:01,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38782 states to 38782 states and 119649 transitions. [2019-12-27 01:59:01,295 INFO L78 Accepts]: Start accepts. Automaton has 38782 states and 119649 transitions. Word has length 63 [2019-12-27 01:59:01,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:01,295 INFO L462 AbstractCegarLoop]: Abstraction has 38782 states and 119649 transitions. [2019-12-27 01:59:01,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:59:01,295 INFO L276 IsEmpty]: Start isEmpty. Operand 38782 states and 119649 transitions. [2019-12-27 01:59:01,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:01,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:01,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:59:01,339 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:01,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:01,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1981956519, now seen corresponding path program 13 times [2019-12-27 01:59:01,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:01,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930484633] [2019-12-27 01:59:01,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:01,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930484633] [2019-12-27 01:59:01,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:01,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:59:01,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151769882] [2019-12-27 01:59:01,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:59:01,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:01,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:59:01,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:59:01,451 INFO L87 Difference]: Start difference. First operand 38782 states and 119649 transitions. Second operand 8 states. [2019-12-27 01:59:03,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:03,191 INFO L93 Difference]: Finished difference Result 67452 states and 202956 transitions. [2019-12-27 01:59:03,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:59:03,191 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 01:59:03,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:03,703 INFO L225 Difference]: With dead ends: 67452 [2019-12-27 01:59:03,703 INFO L226 Difference]: Without dead ends: 67452 [2019-12-27 01:59:03,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-12-27 01:59:03,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67452 states. [2019-12-27 01:59:04,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67452 to 38529. [2019-12-27 01:59:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38529 states. [2019-12-27 01:59:04,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38529 states to 38529 states and 119032 transitions. [2019-12-27 01:59:04,453 INFO L78 Accepts]: Start accepts. Automaton has 38529 states and 119032 transitions. Word has length 63 [2019-12-27 01:59:04,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:04,453 INFO L462 AbstractCegarLoop]: Abstraction has 38529 states and 119032 transitions. [2019-12-27 01:59:04,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:59:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 38529 states and 119032 transitions. [2019-12-27 01:59:04,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:04,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:04,494 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:59:04,494 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:04,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:04,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1727739179, now seen corresponding path program 14 times [2019-12-27 01:59:04,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:04,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713442786] [2019-12-27 01:59:04,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:04,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:04,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713442786] [2019-12-27 01:59:04,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:04,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:59:04,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139274646] [2019-12-27 01:59:04,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:59:04,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:04,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:59:04,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:59:04,592 INFO L87 Difference]: Start difference. First operand 38529 states and 119032 transitions. Second operand 8 states. [2019-12-27 01:59:05,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:05,633 INFO L93 Difference]: Finished difference Result 57559 states and 175436 transitions. [2019-12-27 01:59:05,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:59:05,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 01:59:05,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:05,719 INFO L225 Difference]: With dead ends: 57559 [2019-12-27 01:59:05,719 INFO L226 Difference]: Without dead ends: 57559 [2019-12-27 01:59:05,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:59:05,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57559 states. [2019-12-27 01:59:06,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57559 to 37418. [2019-12-27 01:59:06,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37418 states. [2019-12-27 01:59:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37418 states to 37418 states and 115770 transitions. [2019-12-27 01:59:06,407 INFO L78 Accepts]: Start accepts. Automaton has 37418 states and 115770 transitions. Word has length 63 [2019-12-27 01:59:06,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:06,407 INFO L462 AbstractCegarLoop]: Abstraction has 37418 states and 115770 transitions. [2019-12-27 01:59:06,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:59:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 37418 states and 115770 transitions. [2019-12-27 01:59:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:06,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:06,449 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:59:06,449 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:06,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:06,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1876409601, now seen corresponding path program 15 times [2019-12-27 01:59:06,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:06,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076908364] [2019-12-27 01:59:06,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:06,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076908364] [2019-12-27 01:59:06,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:06,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:59:06,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840705923] [2019-12-27 01:59:06,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:59:06,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:06,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:59:06,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:59:06,559 INFO L87 Difference]: Start difference. First operand 37418 states and 115770 transitions. Second operand 7 states. [2019-12-27 01:59:08,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:08,009 INFO L93 Difference]: Finished difference Result 52477 states and 162527 transitions. [2019-12-27 01:59:08,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 01:59:08,010 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:59:08,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:08,087 INFO L225 Difference]: With dead ends: 52477 [2019-12-27 01:59:08,087 INFO L226 Difference]: Without dead ends: 52477 [2019-12-27 01:59:08,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:59:08,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52477 states. [2019-12-27 01:59:08,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52477 to 39873. [2019-12-27 01:59:08,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39873 states. [2019-12-27 01:59:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39873 states to 39873 states and 123742 transitions. [2019-12-27 01:59:08,771 INFO L78 Accepts]: Start accepts. Automaton has 39873 states and 123742 transitions. Word has length 63 [2019-12-27 01:59:08,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:08,772 INFO L462 AbstractCegarLoop]: Abstraction has 39873 states and 123742 transitions. [2019-12-27 01:59:08,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:59:08,772 INFO L276 IsEmpty]: Start isEmpty. Operand 39873 states and 123742 transitions. [2019-12-27 01:59:08,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:08,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:08,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:59:08,814 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:08,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:08,814 INFO L82 PathProgramCache]: Analyzing trace with hash 817035097, now seen corresponding path program 16 times [2019-12-27 01:59:08,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:08,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500416719] [2019-12-27 01:59:08,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:08,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:08,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500416719] [2019-12-27 01:59:08,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:08,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:59:08,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993308447] [2019-12-27 01:59:08,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:59:08,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:08,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:59:08,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:59:08,968 INFO L87 Difference]: Start difference. First operand 39873 states and 123742 transitions. Second operand 8 states. [2019-12-27 01:59:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:10,138 INFO L93 Difference]: Finished difference Result 55891 states and 171563 transitions. [2019-12-27 01:59:10,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:59:10,139 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 01:59:10,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:10,223 INFO L225 Difference]: With dead ends: 55891 [2019-12-27 01:59:10,223 INFO L226 Difference]: Without dead ends: 55891 [2019-12-27 01:59:10,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:59:10,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55891 states. [2019-12-27 01:59:10,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55891 to 39999. [2019-12-27 01:59:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39999 states. [2019-12-27 01:59:10,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39999 states to 39999 states and 123988 transitions. [2019-12-27 01:59:10,925 INFO L78 Accepts]: Start accepts. Automaton has 39999 states and 123988 transitions. Word has length 63 [2019-12-27 01:59:10,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:10,925 INFO L462 AbstractCegarLoop]: Abstraction has 39999 states and 123988 transitions. [2019-12-27 01:59:10,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:59:10,925 INFO L276 IsEmpty]: Start isEmpty. Operand 39999 states and 123988 transitions. [2019-12-27 01:59:10,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:10,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:10,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:59:10,969 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:10,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:10,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1937295543, now seen corresponding path program 17 times [2019-12-27 01:59:10,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:10,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602894338] [2019-12-27 01:59:10,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:11,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602894338] [2019-12-27 01:59:11,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:11,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:59:11,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983281032] [2019-12-27 01:59:11,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:59:11,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:11,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:59:11,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:59:11,101 INFO L87 Difference]: Start difference. First operand 39999 states and 123988 transitions. Second operand 9 states. [2019-12-27 01:59:12,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:12,474 INFO L93 Difference]: Finished difference Result 61056 states and 186419 transitions. [2019-12-27 01:59:12,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:59:12,474 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-27 01:59:12,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:12,565 INFO L225 Difference]: With dead ends: 61056 [2019-12-27 01:59:12,566 INFO L226 Difference]: Without dead ends: 61056 [2019-12-27 01:59:12,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:59:12,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61056 states. [2019-12-27 01:59:13,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61056 to 40797. [2019-12-27 01:59:13,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40797 states. [2019-12-27 01:59:13,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40797 states to 40797 states and 126265 transitions. [2019-12-27 01:59:13,335 INFO L78 Accepts]: Start accepts. Automaton has 40797 states and 126265 transitions. Word has length 63 [2019-12-27 01:59:13,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:13,336 INFO L462 AbstractCegarLoop]: Abstraction has 40797 states and 126265 transitions. [2019-12-27 01:59:13,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:59:13,336 INFO L276 IsEmpty]: Start isEmpty. Operand 40797 states and 126265 transitions. [2019-12-27 01:59:13,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:13,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:13,381 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:59:13,381 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:13,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:13,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1351537083, now seen corresponding path program 18 times [2019-12-27 01:59:13,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:13,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178125418] [2019-12-27 01:59:13,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:13,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178125418] [2019-12-27 01:59:13,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:13,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:59:13,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486024381] [2019-12-27 01:59:13,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:59:13,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:13,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:59:13,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:59:13,495 INFO L87 Difference]: Start difference. First operand 40797 states and 126265 transitions. Second operand 9 states. [2019-12-27 01:59:14,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:14,917 INFO L93 Difference]: Finished difference Result 61113 states and 186560 transitions. [2019-12-27 01:59:14,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:59:14,917 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-27 01:59:14,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:15,015 INFO L225 Difference]: With dead ends: 61113 [2019-12-27 01:59:15,016 INFO L226 Difference]: Without dead ends: 61113 [2019-12-27 01:59:15,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-12-27 01:59:15,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61113 states. [2019-12-27 01:59:15,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61113 to 39655. [2019-12-27 01:59:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39655 states. [2019-12-27 01:59:16,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39655 states to 39655 states and 122975 transitions. [2019-12-27 01:59:16,263 INFO L78 Accepts]: Start accepts. Automaton has 39655 states and 122975 transitions. Word has length 63 [2019-12-27 01:59:16,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:16,263 INFO L462 AbstractCegarLoop]: Abstraction has 39655 states and 122975 transitions. [2019-12-27 01:59:16,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:59:16,263 INFO L276 IsEmpty]: Start isEmpty. Operand 39655 states and 122975 transitions. [2019-12-27 01:59:16,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:16,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:16,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:59:16,311 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:16,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:16,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1012741715, now seen corresponding path program 19 times [2019-12-27 01:59:16,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:16,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908804554] [2019-12-27 01:59:16,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:16,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908804554] [2019-12-27 01:59:16,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:16,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:59:16,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373665963] [2019-12-27 01:59:16,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:59:16,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:16,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:59:16,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:59:16,411 INFO L87 Difference]: Start difference. First operand 39655 states and 122975 transitions. Second operand 8 states. [2019-12-27 01:59:17,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:17,577 INFO L93 Difference]: Finished difference Result 60669 states and 187687 transitions. [2019-12-27 01:59:17,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:59:17,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 01:59:17,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:17,671 INFO L225 Difference]: With dead ends: 60669 [2019-12-27 01:59:17,671 INFO L226 Difference]: Without dead ends: 60669 [2019-12-27 01:59:17,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:59:17,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60669 states. [2019-12-27 01:59:18,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60669 to 39134. [2019-12-27 01:59:18,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39134 states. [2019-12-27 01:59:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39134 states to 39134 states and 121190 transitions. [2019-12-27 01:59:18,410 INFO L78 Accepts]: Start accepts. Automaton has 39134 states and 121190 transitions. Word has length 63 [2019-12-27 01:59:18,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:18,410 INFO L462 AbstractCegarLoop]: Abstraction has 39134 states and 121190 transitions. [2019-12-27 01:59:18,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:59:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 39134 states and 121190 transitions. [2019-12-27 01:59:18,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:18,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:18,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:59:18,453 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:18,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:18,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1879007009, now seen corresponding path program 20 times [2019-12-27 01:59:18,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:18,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698039944] [2019-12-27 01:59:18,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:18,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698039944] [2019-12-27 01:59:18,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:18,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:59:18,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054772146] [2019-12-27 01:59:18,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:59:18,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:18,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:59:18,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:59:18,500 INFO L87 Difference]: Start difference. First operand 39134 states and 121190 transitions. Second operand 4 states. [2019-12-27 01:59:18,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:18,695 INFO L93 Difference]: Finished difference Result 68078 states and 210977 transitions. [2019-12-27 01:59:18,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:59:18,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-27 01:59:18,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:18,742 INFO L225 Difference]: With dead ends: 68078 [2019-12-27 01:59:18,742 INFO L226 Difference]: Without dead ends: 31490 [2019-12-27 01:59:18,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:59:18,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31490 states. [2019-12-27 01:59:19,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31490 to 31490. [2019-12-27 01:59:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31490 states. [2019-12-27 01:59:19,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31490 states to 31490 states and 97548 transitions. [2019-12-27 01:59:19,252 INFO L78 Accepts]: Start accepts. Automaton has 31490 states and 97548 transitions. Word has length 63 [2019-12-27 01:59:19,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:19,252 INFO L462 AbstractCegarLoop]: Abstraction has 31490 states and 97548 transitions. [2019-12-27 01:59:19,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:59:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 31490 states and 97548 transitions. [2019-12-27 01:59:19,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:19,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:19,289 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:59:19,289 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:19,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:19,290 INFO L82 PathProgramCache]: Analyzing trace with hash 2023139907, now seen corresponding path program 21 times [2019-12-27 01:59:19,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:19,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792557467] [2019-12-27 01:59:19,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:19,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792557467] [2019-12-27 01:59:19,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:19,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:59:19,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857659466] [2019-12-27 01:59:19,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:59:19,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:19,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:59:19,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:59:19,352 INFO L87 Difference]: Start difference. First operand 31490 states and 97548 transitions. Second operand 7 states. [2019-12-27 01:59:20,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:20,113 INFO L93 Difference]: Finished difference Result 76663 states and 234593 transitions. [2019-12-27 01:59:20,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 01:59:20,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:59:20,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:20,208 INFO L225 Difference]: With dead ends: 76663 [2019-12-27 01:59:20,209 INFO L226 Difference]: Without dead ends: 64942 [2019-12-27 01:59:20,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:59:20,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64942 states. [2019-12-27 01:59:20,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64942 to 31399. [2019-12-27 01:59:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31399 states. [2019-12-27 01:59:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31399 states to 31399 states and 97098 transitions. [2019-12-27 01:59:20,881 INFO L78 Accepts]: Start accepts. Automaton has 31399 states and 97098 transitions. Word has length 63 [2019-12-27 01:59:20,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:20,881 INFO L462 AbstractCegarLoop]: Abstraction has 31399 states and 97098 transitions. [2019-12-27 01:59:20,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:59:20,881 INFO L276 IsEmpty]: Start isEmpty. Operand 31399 states and 97098 transitions. [2019-12-27 01:59:20,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:20,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:20,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:59:20,915 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:20,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:20,915 INFO L82 PathProgramCache]: Analyzing trace with hash -94392515, now seen corresponding path program 22 times [2019-12-27 01:59:20,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:20,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115495995] [2019-12-27 01:59:20,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:20,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:20,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115495995] [2019-12-27 01:59:20,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:20,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:59:20,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051396801] [2019-12-27 01:59:20,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:59:20,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:20,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:59:20,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:59:20,954 INFO L87 Difference]: Start difference. First operand 31399 states and 97098 transitions. Second operand 3 states. [2019-12-27 01:59:21,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:21,165 INFO L93 Difference]: Finished difference Result 54341 states and 167505 transitions. [2019-12-27 01:59:21,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:59:21,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-27 01:59:21,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:21,199 INFO L225 Difference]: With dead ends: 54341 [2019-12-27 01:59:21,200 INFO L226 Difference]: Without dead ends: 23974 [2019-12-27 01:59:21,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 01:59:21,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23974 states. [2019-12-27 01:59:21,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23974 to 23974. [2019-12-27 01:59:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23974 states. [2019-12-27 01:59:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23974 states to 23974 states and 73252 transitions. [2019-12-27 01:59:21,561 INFO L78 Accepts]: Start accepts. Automaton has 23974 states and 73252 transitions. Word has length 63 [2019-12-27 01:59:21,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:21,561 INFO L462 AbstractCegarLoop]: Abstraction has 23974 states and 73252 transitions. [2019-12-27 01:59:21,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:59:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand 23974 states and 73252 transitions. [2019-12-27 01:59:21,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:59:21,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:21,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:59:21,592 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:21,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:21,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1205251063, now seen corresponding path program 1 times [2019-12-27 01:59:21,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:21,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559835928] [2019-12-27 01:59:21,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:21,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:21,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559835928] [2019-12-27 01:59:21,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:21,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:59:21,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289100516] [2019-12-27 01:59:21,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:59:21,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:21,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:59:21,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:59:21,670 INFO L87 Difference]: Start difference. First operand 23974 states and 73252 transitions. Second operand 6 states. [2019-12-27 01:59:22,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:22,319 INFO L93 Difference]: Finished difference Result 30942 states and 93348 transitions. [2019-12-27 01:59:22,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 01:59:22,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 01:59:22,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:22,362 INFO L225 Difference]: With dead ends: 30942 [2019-12-27 01:59:22,362 INFO L226 Difference]: Without dead ends: 30942 [2019-12-27 01:59:22,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:59:22,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30942 states. [2019-12-27 01:59:22,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30942 to 24664. [2019-12-27 01:59:22,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24664 states. [2019-12-27 01:59:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24664 states to 24664 states and 75271 transitions. [2019-12-27 01:59:22,765 INFO L78 Accepts]: Start accepts. Automaton has 24664 states and 75271 transitions. Word has length 64 [2019-12-27 01:59:22,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:22,765 INFO L462 AbstractCegarLoop]: Abstraction has 24664 states and 75271 transitions. [2019-12-27 01:59:22,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:59:22,765 INFO L276 IsEmpty]: Start isEmpty. Operand 24664 states and 75271 transitions. [2019-12-27 01:59:22,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:59:22,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:22,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:59:22,791 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:22,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:22,791 INFO L82 PathProgramCache]: Analyzing trace with hash 230927717, now seen corresponding path program 2 times [2019-12-27 01:59:22,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:22,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203510886] [2019-12-27 01:59:22,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:23,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:23,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203510886] [2019-12-27 01:59:23,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:23,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:59:23,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471029162] [2019-12-27 01:59:23,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:59:23,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:23,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:59:23,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:59:23,032 INFO L87 Difference]: Start difference. First operand 24664 states and 75271 transitions. Second operand 11 states. [2019-12-27 01:59:24,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:24,643 INFO L93 Difference]: Finished difference Result 37027 states and 111797 transitions. [2019-12-27 01:59:24,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 01:59:24,643 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 01:59:24,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:24,683 INFO L225 Difference]: With dead ends: 37027 [2019-12-27 01:59:24,683 INFO L226 Difference]: Without dead ends: 29675 [2019-12-27 01:59:24,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2019-12-27 01:59:24,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29675 states. [2019-12-27 01:59:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29675 to 25060. [2019-12-27 01:59:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25060 states. [2019-12-27 01:59:25,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25060 states to 25060 states and 76391 transitions. [2019-12-27 01:59:25,057 INFO L78 Accepts]: Start accepts. Automaton has 25060 states and 76391 transitions. Word has length 64 [2019-12-27 01:59:25,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:25,057 INFO L462 AbstractCegarLoop]: Abstraction has 25060 states and 76391 transitions. [2019-12-27 01:59:25,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:59:25,057 INFO L276 IsEmpty]: Start isEmpty. Operand 25060 states and 76391 transitions. [2019-12-27 01:59:25,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:59:25,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:25,083 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:59:25,083 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:25,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:25,083 INFO L82 PathProgramCache]: Analyzing trace with hash -477512813, now seen corresponding path program 3 times [2019-12-27 01:59:25,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:25,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954029594] [2019-12-27 01:59:25,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:25,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-12-27 01:59:25,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954029594] [2019-12-27 01:59:25,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:25,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:59:25,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053203861] [2019-12-27 01:59:25,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:59:25,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:25,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:59:25,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:59:25,282 INFO L87 Difference]: Start difference. First operand 25060 states and 76391 transitions. Second operand 11 states. [2019-12-27 01:59:26,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:26,748 INFO L93 Difference]: Finished difference Result 40763 states and 121891 transitions. [2019-12-27 01:59:26,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 01:59:26,749 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 01:59:26,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:26,797 INFO L225 Difference]: With dead ends: 40763 [2019-12-27 01:59:26,797 INFO L226 Difference]: Without dead ends: 35069 [2019-12-27 01:59:26,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2019-12-27 01:59:26,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35069 states. [2019-12-27 01:59:27,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35069 to 25133. [2019-12-27 01:59:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25133 states. [2019-12-27 01:59:27,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25133 states to 25133 states and 76447 transitions. [2019-12-27 01:59:27,232 INFO L78 Accepts]: Start accepts. Automaton has 25133 states and 76447 transitions. Word has length 64 [2019-12-27 01:59:27,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:27,233 INFO L462 AbstractCegarLoop]: Abstraction has 25133 states and 76447 transitions. [2019-12-27 01:59:27,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:59:27,233 INFO L276 IsEmpty]: Start isEmpty. Operand 25133 states and 76447 transitions. [2019-12-27 01:59:27,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:59:27,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:27,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:59:27,262 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:27,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:27,263 INFO L82 PathProgramCache]: Analyzing trace with hash -524839499, now seen corresponding path program 4 times [2019-12-27 01:59:27,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:27,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543810699] [2019-12-27 01:59:27,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:27,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:27,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543810699] [2019-12-27 01:59:27,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:27,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:59:27,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441248791] [2019-12-27 01:59:27,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:59:27,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:27,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:59:27,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:59:27,316 INFO L87 Difference]: Start difference. First operand 25133 states and 76447 transitions. Second operand 3 states. [2019-12-27 01:59:27,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:27,423 INFO L93 Difference]: Finished difference Result 25132 states and 76445 transitions. [2019-12-27 01:59:27,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:59:27,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:59:27,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:27,474 INFO L225 Difference]: With dead ends: 25132 [2019-12-27 01:59:27,474 INFO L226 Difference]: Without dead ends: 25132 [2019-12-27 01:59:27,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:59:27,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25132 states. [2019-12-27 01:59:27,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25132 to 20586. [2019-12-27 01:59:27,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20586 states. [2019-12-27 01:59:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20586 states to 20586 states and 63032 transitions. [2019-12-27 01:59:27,995 INFO L78 Accepts]: Start accepts. Automaton has 20586 states and 63032 transitions. Word has length 64 [2019-12-27 01:59:27,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:27,996 INFO L462 AbstractCegarLoop]: Abstraction has 20586 states and 63032 transitions. [2019-12-27 01:59:27,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:59:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 20586 states and 63032 transitions. [2019-12-27 01:59:28,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:59:28,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:28,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:59:28,021 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:28,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:28,021 INFO L82 PathProgramCache]: Analyzing trace with hash 2010713375, now seen corresponding path program 1 times [2019-12-27 01:59:28,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:28,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001295670] [2019-12-27 01:59:28,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:28,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:28,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001295670] [2019-12-27 01:59:28,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:28,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:59:28,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820597298] [2019-12-27 01:59:28,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:59:28,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:28,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:59:28,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:59:28,082 INFO L87 Difference]: Start difference. First operand 20586 states and 63032 transitions. Second operand 3 states. [2019-12-27 01:59:28,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:28,170 INFO L93 Difference]: Finished difference Result 14872 states and 45267 transitions. [2019-12-27 01:59:28,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:59:28,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:59:28,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:28,200 INFO L225 Difference]: With dead ends: 14872 [2019-12-27 01:59:28,200 INFO L226 Difference]: Without dead ends: 14872 [2019-12-27 01:59:28,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:59:28,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14872 states. [2019-12-27 01:59:28,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14872 to 14383. [2019-12-27 01:59:28,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14383 states. [2019-12-27 01:59:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14383 states to 14383 states and 43821 transitions. [2019-12-27 01:59:28,417 INFO L78 Accepts]: Start accepts. Automaton has 14383 states and 43821 transitions. Word has length 64 [2019-12-27 01:59:28,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:28,417 INFO L462 AbstractCegarLoop]: Abstraction has 14383 states and 43821 transitions. [2019-12-27 01:59:28,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:59:28,418 INFO L276 IsEmpty]: Start isEmpty. Operand 14383 states and 43821 transitions. [2019-12-27 01:59:28,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:59:28,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:28,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:59:28,438 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:28,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:28,438 INFO L82 PathProgramCache]: Analyzing trace with hash 339295601, now seen corresponding path program 1 times [2019-12-27 01:59:28,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:28,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959815497] [2019-12-27 01:59:28,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:28,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959815497] [2019-12-27 01:59:28,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:28,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:59:28,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621410552] [2019-12-27 01:59:28,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:59:28,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:28,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:59:28,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:59:28,532 INFO L87 Difference]: Start difference. First operand 14383 states and 43821 transitions. Second operand 8 states. [2019-12-27 01:59:29,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:29,438 INFO L93 Difference]: Finished difference Result 19804 states and 59343 transitions. [2019-12-27 01:59:29,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:59:29,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 01:59:29,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:29,463 INFO L225 Difference]: With dead ends: 19804 [2019-12-27 01:59:29,463 INFO L226 Difference]: Without dead ends: 19804 [2019-12-27 01:59:29,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:59:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19804 states. [2019-12-27 01:59:29,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19804 to 14173. [2019-12-27 01:59:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14173 states. [2019-12-27 01:59:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14173 states to 14173 states and 43256 transitions. [2019-12-27 01:59:29,703 INFO L78 Accepts]: Start accepts. Automaton has 14173 states and 43256 transitions. Word has length 65 [2019-12-27 01:59:29,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:29,703 INFO L462 AbstractCegarLoop]: Abstraction has 14173 states and 43256 transitions. [2019-12-27 01:59:29,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:59:29,704 INFO L276 IsEmpty]: Start isEmpty. Operand 14173 states and 43256 transitions. [2019-12-27 01:59:29,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:59:29,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:29,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:59:29,718 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:29,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:29,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1050757295, now seen corresponding path program 2 times [2019-12-27 01:59:29,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:29,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438859688] [2019-12-27 01:59:29,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:29,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438859688] [2019-12-27 01:59:29,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:29,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:59:29,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257866393] [2019-12-27 01:59:29,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:59:29,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:29,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:59:29,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:59:29,938 INFO L87 Difference]: Start difference. First operand 14173 states and 43256 transitions. Second operand 11 states. [2019-12-27 01:59:30,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:30,841 INFO L93 Difference]: Finished difference Result 23564 states and 71746 transitions. [2019-12-27 01:59:30,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 01:59:30,841 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 01:59:30,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:30,872 INFO L225 Difference]: With dead ends: 23564 [2019-12-27 01:59:30,872 INFO L226 Difference]: Without dead ends: 22269 [2019-12-27 01:59:30,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-27 01:59:30,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22269 states. [2019-12-27 01:59:31,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22269 to 19019. [2019-12-27 01:59:31,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19019 states. [2019-12-27 01:59:31,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19019 states to 19019 states and 58007 transitions. [2019-12-27 01:59:31,167 INFO L78 Accepts]: Start accepts. Automaton has 19019 states and 58007 transitions. Word has length 65 [2019-12-27 01:59:31,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:31,167 INFO L462 AbstractCegarLoop]: Abstraction has 19019 states and 58007 transitions. [2019-12-27 01:59:31,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:59:31,167 INFO L276 IsEmpty]: Start isEmpty. Operand 19019 states and 58007 transitions. [2019-12-27 01:59:31,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:59:31,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:31,186 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:59:31,186 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:31,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:31,186 INFO L82 PathProgramCache]: Analyzing trace with hash -330874671, now seen corresponding path program 3 times [2019-12-27 01:59:31,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:31,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074285182] [2019-12-27 01:59:31,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:31,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074285182] [2019-12-27 01:59:31,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:31,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:59:31,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338534338] [2019-12-27 01:59:31,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:59:31,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:31,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:59:31,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:59:31,331 INFO L87 Difference]: Start difference. First operand 19019 states and 58007 transitions. Second operand 11 states. [2019-12-27 01:59:32,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:32,116 INFO L93 Difference]: Finished difference Result 23056 states and 69218 transitions. [2019-12-27 01:59:32,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:59:32,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 01:59:32,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:32,143 INFO L225 Difference]: With dead ends: 23056 [2019-12-27 01:59:32,143 INFO L226 Difference]: Without dead ends: 18124 [2019-12-27 01:59:32,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:59:32,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18124 states. [2019-12-27 01:59:32,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18124 to 14519. [2019-12-27 01:59:32,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14519 states. [2019-12-27 01:59:32,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14519 states to 14519 states and 44143 transitions. [2019-12-27 01:59:32,389 INFO L78 Accepts]: Start accepts. Automaton has 14519 states and 44143 transitions. Word has length 65 [2019-12-27 01:59:32,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:32,390 INFO L462 AbstractCegarLoop]: Abstraction has 14519 states and 44143 transitions. [2019-12-27 01:59:32,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:59:32,390 INFO L276 IsEmpty]: Start isEmpty. Operand 14519 states and 44143 transitions. [2019-12-27 01:59:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:59:32,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:32,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:59:32,406 INFO L410 AbstractCegarLoop]: === Iteration 47 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:32,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:32,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1664741459, now seen corresponding path program 4 times [2019-12-27 01:59:32,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:32,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180881708] [2019-12-27 01:59:32,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:32,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180881708] [2019-12-27 01:59:32,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:32,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:59:32,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24861890] [2019-12-27 01:59:32,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:59:32,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:32,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:59:32,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:59:32,588 INFO L87 Difference]: Start difference. First operand 14519 states and 44143 transitions. Second operand 12 states. [2019-12-27 01:59:33,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:33,763 INFO L93 Difference]: Finished difference Result 16594 states and 49523 transitions. [2019-12-27 01:59:33,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:59:33,763 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 01:59:33,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:33,786 INFO L225 Difference]: With dead ends: 16594 [2019-12-27 01:59:33,786 INFO L226 Difference]: Without dead ends: 15700 [2019-12-27 01:59:33,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2019-12-27 01:59:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15700 states. [2019-12-27 01:59:33,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15700 to 14119. [2019-12-27 01:59:33,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14119 states. [2019-12-27 01:59:34,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14119 states to 14119 states and 42992 transitions. [2019-12-27 01:59:34,003 INFO L78 Accepts]: Start accepts. Automaton has 14119 states and 42992 transitions. Word has length 65 [2019-12-27 01:59:34,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:34,004 INFO L462 AbstractCegarLoop]: Abstraction has 14119 states and 42992 transitions. [2019-12-27 01:59:34,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:59:34,004 INFO L276 IsEmpty]: Start isEmpty. Operand 14119 states and 42992 transitions. [2019-12-27 01:59:34,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:59:34,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:34,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:59:34,020 INFO L410 AbstractCegarLoop]: === Iteration 48 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:34,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:34,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1019867375, now seen corresponding path program 5 times [2019-12-27 01:59:34,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:34,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509172704] [2019-12-27 01:59:34,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:34,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:34,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509172704] [2019-12-27 01:59:34,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:34,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:59:34,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861933678] [2019-12-27 01:59:34,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:59:34,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:34,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:59:34,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:59:34,078 INFO L87 Difference]: Start difference. First operand 14119 states and 42992 transitions. Second operand 4 states. [2019-12-27 01:59:34,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:34,182 INFO L93 Difference]: Finished difference Result 16847 states and 50921 transitions. [2019-12-27 01:59:34,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:59:34,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 01:59:34,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:34,203 INFO L225 Difference]: With dead ends: 16847 [2019-12-27 01:59:34,204 INFO L226 Difference]: Without dead ends: 16847 [2019-12-27 01:59:34,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:59:34,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16847 states. [2019-12-27 01:59:34,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16847 to 14255. [2019-12-27 01:59:34,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14255 states. [2019-12-27 01:59:34,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14255 states to 14255 states and 43511 transitions. [2019-12-27 01:59:34,435 INFO L78 Accepts]: Start accepts. Automaton has 14255 states and 43511 transitions. Word has length 65 [2019-12-27 01:59:34,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:34,435 INFO L462 AbstractCegarLoop]: Abstraction has 14255 states and 43511 transitions. [2019-12-27 01:59:34,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:59:34,435 INFO L276 IsEmpty]: Start isEmpty. Operand 14255 states and 43511 transitions. [2019-12-27 01:59:34,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:59:34,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:34,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:59:34,451 INFO L410 AbstractCegarLoop]: === Iteration 49 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:34,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:34,451 INFO L82 PathProgramCache]: Analyzing trace with hash -952881413, now seen corresponding path program 1 times [2019-12-27 01:59:34,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:34,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202737513] [2019-12-27 01:59:34,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:34,819 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 7 [2019-12-27 01:59:34,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:34,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202737513] [2019-12-27 01:59:34,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:34,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 01:59:34,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326087725] [2019-12-27 01:59:34,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 01:59:34,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:34,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 01:59:34,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:59:34,851 INFO L87 Difference]: Start difference. First operand 14255 states and 43511 transitions. Second operand 13 states. [2019-12-27 01:59:35,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:35,891 INFO L93 Difference]: Finished difference Result 20187 states and 60652 transitions. [2019-12-27 01:59:35,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 01:59:35,892 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-27 01:59:35,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:35,919 INFO L225 Difference]: With dead ends: 20187 [2019-12-27 01:59:35,919 INFO L226 Difference]: Without dead ends: 19718 [2019-12-27 01:59:35,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2019-12-27 01:59:35,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19718 states. [2019-12-27 01:59:36,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19718 to 13993. [2019-12-27 01:59:36,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13993 states. [2019-12-27 01:59:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13993 states to 13993 states and 42841 transitions. [2019-12-27 01:59:36,171 INFO L78 Accepts]: Start accepts. Automaton has 13993 states and 42841 transitions. Word has length 66 [2019-12-27 01:59:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:36,171 INFO L462 AbstractCegarLoop]: Abstraction has 13993 states and 42841 transitions. [2019-12-27 01:59:36,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 01:59:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 13993 states and 42841 transitions. [2019-12-27 01:59:36,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:59:36,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:36,186 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-27 01:59:36,186 INFO L410 AbstractCegarLoop]: === Iteration 50 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:36,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:36,186 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 2 times [2019-12-27 01:59:36,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:36,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714738227] [2019-12-27 01:59:36,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:59:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:59:36,292 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:59:36,293 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:59:36,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t669~0.base_22| 4)) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_380 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t669~0.base_22| 1) |v_#valid_69|) (= v_~z$r_buff0_thd2~0_184 0) (= v_~__unbuffered_cnt~0_128 0) (= v_~y~0_48 0) (= v_~z$mem_tmp~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$r_buff1_thd0~0_296 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t669~0.base_22|)) (= v_~z$w_buff1_used~0_500 0) (= v_~z$r_buff0_thd0~0_197 0) (= 0 |v_#NULL.base_6|) (= 0 |v_ULTIMATE.start_main_~#t669~0.offset_16|) (= 0 v_~z$flush_delayed~0_43) (= 0 v_~__unbuffered_p0_EAX~0_233) (= v_~z$read_delayed~0_7 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t669~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t669~0.base_22|) |v_ULTIMATE.start_main_~#t669~0.offset_16| 0)) |v_#memory_int_19|) (= 0 v_~z$r_buff1_thd3~0_396) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_37) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff0_thd3~0_379) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= 0 v_~x~0_133) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t669~0.base_22|) (= v_~z~0_182 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t671~0.base=|v_ULTIMATE.start_main_~#t671~0.base_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_233, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_37, ULTIMATE.start_main_~#t670~0.offset=|v_ULTIMATE.start_main_~#t670~0.offset_14|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ULTIMATE.start_main_~#t670~0.base=|v_ULTIMATE.start_main_~#t670~0.base_19|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_379, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ULTIMATE.start_main_~#t669~0.base=|v_ULTIMATE.start_main_~#t669~0.base_22|, ~x~0=v_~x~0_133, ULTIMATE.start_main_~#t671~0.offset=|v_ULTIMATE.start_main_~#t671~0.offset_14|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_296, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_184, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t669~0.offset=|v_ULTIMATE.start_main_~#t669~0.offset_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_380} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t671~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t670~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t670~0.base, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t669~0.base, ~x~0, ULTIMATE.start_main_~#t671~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t669~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:59:36,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23) (= v_~x~0_9 v_~__unbuffered_p0_EAX~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:59:36,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t670~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t670~0.base_11|) |v_ULTIMATE.start_main_~#t670~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t670~0.base_11|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t670~0.base_11| 4) |v_#length_15|) (not (= |v_ULTIMATE.start_main_~#t670~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t670~0.base_11|) (= |v_ULTIMATE.start_main_~#t670~0.offset_10| 0) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t670~0.base_11| 1) |v_#valid_31|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t670~0.base=|v_ULTIMATE.start_main_~#t670~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t670~0.offset=|v_ULTIMATE.start_main_~#t670~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t670~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t670~0.offset] because there is no mapped edge [2019-12-27 01:59:36,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t671~0.base_12|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t671~0.base_12| 4)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t671~0.base_12|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t671~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t671~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t671~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t671~0.base_12|) |v_ULTIMATE.start_main_~#t671~0.offset_10| 2)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t671~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t671~0.offset=|v_ULTIMATE.start_main_~#t671~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t671~0.base=|v_ULTIMATE.start_main_~#t671~0.base_12|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t671~0.offset, ULTIMATE.start_main_~#t671~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 01:59:36,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out-864101001| |P1Thread1of1ForFork2_#t~ite10_Out-864101001|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-864101001 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-864101001 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out-864101001| ~z$w_buff1~0_In-864101001) (not .cse1) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out-864101001| ~z~0_In-864101001)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-864101001, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-864101001, ~z$w_buff1~0=~z$w_buff1~0_In-864101001, ~z~0=~z~0_In-864101001} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-864101001|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-864101001, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-864101001|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-864101001, ~z$w_buff1~0=~z$w_buff1~0_In-864101001, ~z~0=~z~0_In-864101001} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 01:59:36,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In496240666 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_In496240666| |P2Thread1of1ForFork0_#t~ite23_Out496240666|) (= |P2Thread1of1ForFork0_#t~ite24_Out496240666| ~z$w_buff1~0_In496240666) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite23_Out496240666| ~z$w_buff1~0_In496240666) (= |P2Thread1of1ForFork0_#t~ite24_Out496240666| |P2Thread1of1ForFork0_#t~ite23_Out496240666|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In496240666 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In496240666 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In496240666 256)) (and (= (mod ~z$r_buff1_thd3~0_In496240666 256) 0) .cse1))) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In496240666, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In496240666, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In496240666|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In496240666, ~z$w_buff1~0=~z$w_buff1~0_In496240666, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In496240666, ~weak$$choice2~0=~weak$$choice2~0_In496240666} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In496240666, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out496240666|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In496240666, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out496240666|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In496240666, ~z$w_buff1~0=~z$w_buff1~0_In496240666, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In496240666, ~weak$$choice2~0=~weak$$choice2~0_In496240666} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 01:59:36,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1097816029 256))) (.cse6 (= (mod ~z$r_buff0_thd3~0_In1097816029 256) 0)) (.cse4 (= (mod ~z$r_buff1_thd3~0_In1097816029 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1097816029 256))) (.cse5 (= |P2Thread1of1ForFork0_#t~ite30_Out1097816029| |P2Thread1of1ForFork0_#t~ite29_Out1097816029|)) (.cse0 (= 0 (mod ~weak$$choice2~0_In1097816029 256)))) (or (let ((.cse2 (not .cse6))) (and (= |P2Thread1of1ForFork0_#t~ite28_Out1097816029| 0) .cse0 (or (not .cse1) .cse2) (not .cse3) (or (not .cse4) .cse2) .cse5 (= |P2Thread1of1ForFork0_#t~ite28_Out1097816029| |P2Thread1of1ForFork0_#t~ite29_Out1097816029|))) (and (= |P2Thread1of1ForFork0_#t~ite28_In1097816029| |P2Thread1of1ForFork0_#t~ite28_Out1097816029|) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out1097816029| ~z$w_buff1_used~0_In1097816029) (or (and .cse6 .cse1) (and .cse6 .cse4) .cse3) .cse5) (and (= |P2Thread1of1ForFork0_#t~ite30_Out1097816029| ~z$w_buff1_used~0_In1097816029) (= |P2Thread1of1ForFork0_#t~ite29_In1097816029| |P2Thread1of1ForFork0_#t~ite29_Out1097816029|) (not .cse0)))))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In1097816029|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1097816029, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1097816029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1097816029, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1097816029, ~weak$$choice2~0=~weak$$choice2~0_In1097816029, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1097816029|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1097816029|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1097816029, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1097816029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1097816029, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1097816029, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1097816029|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1097816029|, ~weak$$choice2~0=~weak$$choice2~0_In1097816029} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 01:59:36,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0)) (= v_~z$r_buff0_thd3~0_373 v_~z$r_buff0_thd3~0_372)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_373, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_372, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 01:59:36,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 01:59:36,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out1405554835| |P2Thread1of1ForFork0_#t~ite39_Out1405554835|)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1405554835 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1405554835 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out1405554835| ~z~0_In1405554835) (or .cse1 .cse2)) (and .cse0 (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1405554835| ~z$w_buff1~0_In1405554835) (not .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1405554835, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1405554835, ~z$w_buff1~0=~z$w_buff1~0_In1405554835, ~z~0=~z~0_In1405554835} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1405554835|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1405554835|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1405554835, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1405554835, ~z$w_buff1~0=~z$w_buff1~0_In1405554835, ~z~0=~z~0_In1405554835} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:59:36,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-388349080 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-388349080 256)))) (or (and (= ~z$w_buff0_used~0_In-388349080 |P2Thread1of1ForFork0_#t~ite40_Out-388349080|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-388349080|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-388349080, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-388349080} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-388349080, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-388349080|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-388349080} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 01:59:36,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-4409088 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-4409088 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-4409088 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-4409088 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out-4409088| ~z$w_buff1_used~0_In-4409088) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-4409088| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-4409088, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-4409088, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-4409088, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-4409088} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-4409088, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-4409088, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-4409088, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-4409088, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-4409088|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 01:59:36,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In123705831 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In123705831 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out123705831| ~z$r_buff0_thd3~0_In123705831)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out123705831|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In123705831, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In123705831} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In123705831, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In123705831, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out123705831|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 01:59:36,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1371736466 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-1371736466 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1371736466 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1371736466 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1371736466|)) (and (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In-1371736466 |P2Thread1of1ForFork0_#t~ite43_Out-1371736466|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1371736466, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1371736466, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1371736466, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1371736466} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1371736466|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1371736466, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1371736466, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1371736466, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1371736466} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 01:59:36,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= v_~z$r_buff1_thd3~0_306 |v_P2Thread1of1ForFork0_#t~ite43_56|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 01:59:36,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In139851873 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In139851873 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out139851873| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out139851873| ~z$w_buff0_used~0_In139851873)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In139851873, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In139851873} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out139851873|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In139851873, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In139851873} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 01:59:36,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-1050763981 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1050763981 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1050763981 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1050763981 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out-1050763981| ~z$w_buff1_used~0_In-1050763981)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork1_#t~ite6_Out-1050763981| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050763981, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1050763981, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1050763981, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1050763981} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050763981, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1050763981|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1050763981, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1050763981, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1050763981} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 01:59:36,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-113526663 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-113526663 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out-113526663 ~z$r_buff0_thd1~0_In-113526663)) (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out-113526663) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-113526663, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-113526663} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-113526663, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-113526663|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-113526663} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:59:36,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1249721031 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1249721031 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1249721031 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1249721031 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out1249721031| ~z$r_buff1_thd1~0_In1249721031)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1249721031|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1249721031, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1249721031, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1249721031, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1249721031} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1249721031|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1249721031, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1249721031, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1249721031, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1249721031} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 01:59:36,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 01:59:36,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1440331292 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1440331292 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1440331292|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1440331292| ~z$w_buff0_used~0_In1440331292)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1440331292, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1440331292} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1440331292, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1440331292|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1440331292} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 01:59:36,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1877737747 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-1877737747 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1877737747 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1877737747 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1877737747| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-1877737747| ~z$w_buff1_used~0_In-1877737747)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1877737747, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1877737747, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1877737747, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1877737747} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1877737747, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1877737747, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1877737747, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1877737747|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1877737747} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 01:59:36,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-339311654 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-339311654 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out-339311654| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-339311654 |P1Thread1of1ForFork2_#t~ite13_Out-339311654|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-339311654, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-339311654} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-339311654, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-339311654|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-339311654} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 01:59:36,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In860520886 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In860520886 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In860520886 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In860520886 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out860520886|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In860520886 |P1Thread1of1ForFork2_#t~ite14_Out860520886|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In860520886, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In860520886, ~z$w_buff1_used~0=~z$w_buff1_used~0_In860520886, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In860520886} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In860520886, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In860520886, ~z$w_buff1_used~0=~z$w_buff1_used~0_In860520886, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out860520886|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In860520886} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 01:59:36,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_186 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_186, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 01:59:36,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 01:59:36,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In155675213 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In155675213 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out155675213| ~z$w_buff1~0_In155675213)) (and (= |ULTIMATE.start_main_#t~ite47_Out155675213| ~z~0_In155675213) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In155675213, ~z$w_buff1_used~0=~z$w_buff1_used~0_In155675213, ~z$w_buff1~0=~z$w_buff1~0_In155675213, ~z~0=~z~0_In155675213} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In155675213, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out155675213|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In155675213, ~z$w_buff1~0=~z$w_buff1~0_In155675213, ~z~0=~z~0_In155675213} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 01:59:36,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 01:59:36,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2054097140 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2054097140 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out2054097140| ~z$w_buff0_used~0_In2054097140) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out2054097140| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2054097140, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2054097140} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2054097140, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2054097140, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out2054097140|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 01:59:36,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-462889267 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-462889267 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-462889267 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-462889267 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-462889267| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-462889267 |ULTIMATE.start_main_#t~ite50_Out-462889267|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-462889267, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-462889267, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-462889267, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-462889267} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-462889267|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-462889267, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-462889267, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-462889267, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-462889267} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 01:59:36,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-904483903 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-904483903 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In-904483903 |ULTIMATE.start_main_#t~ite51_Out-904483903|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-904483903|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-904483903, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-904483903} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-904483903, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-904483903|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-904483903} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 01:59:36,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1973567445 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1973567445 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1973567445 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1973567445 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In1973567445 |ULTIMATE.start_main_#t~ite52_Out1973567445|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out1973567445| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1973567445, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1973567445, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1973567445, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1973567445} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1973567445|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1973567445, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1973567445, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1973567445, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1973567445} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 01:59:36,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_25 2) (= 2 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~z$r_buff1_thd0~0_219 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 0 v_~__unbuffered_p0_EAX~0_178)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_219, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:59:36,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:59:36 BasicIcfg [2019-12-27 01:59:36,426 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:59:36,427 INFO L168 Benchmark]: Toolchain (without parser) took 146052.72 ms. Allocated memory was 141.6 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 103.4 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 01:59:36,427 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 141.6 MB. Free memory was 123.5 MB in the beginning and 123.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 01:59:36,428 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.28 ms. Allocated memory was 141.6 MB in the beginning and 204.5 MB in the end (delta: 62.9 MB). Free memory was 103.0 MB in the beginning and 158.0 MB in the end (delta: -55.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-12-27 01:59:36,428 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.03 ms. Allocated memory is still 204.5 MB. Free memory was 158.0 MB in the beginning and 155.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-12-27 01:59:36,428 INFO L168 Benchmark]: Boogie Preprocessor took 42.12 ms. Allocated memory is still 204.5 MB. Free memory was 155.5 MB in the beginning and 153.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-12-27 01:59:36,429 INFO L168 Benchmark]: RCFGBuilder took 842.33 ms. Allocated memory is still 204.5 MB. Free memory was 153.1 MB in the beginning and 102.9 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-27 01:59:36,429 INFO L168 Benchmark]: TraceAbstraction took 144276.37 ms. Allocated memory was 204.5 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 102.9 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 01:59:36,431 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.49 ms. Allocated memory is still 141.6 MB. Free memory was 123.5 MB in the beginning and 123.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.28 ms. Allocated memory was 141.6 MB in the beginning and 204.5 MB in the end (delta: 62.9 MB). Free memory was 103.0 MB in the beginning and 158.0 MB in the end (delta: -55.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.03 ms. Allocated memory is still 204.5 MB. Free memory was 158.0 MB in the beginning and 155.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.12 ms. Allocated memory is still 204.5 MB. Free memory was 155.5 MB in the beginning and 153.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 842.33 ms. Allocated memory is still 204.5 MB. Free memory was 153.1 MB in the beginning and 102.9 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 144276.37 ms. Allocated memory was 204.5 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 102.9 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7047 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t669, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t670, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t671, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 143.9s, OverallIterations: 50, TraceHistogramMax: 1, AutomataDifference: 54.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 12807 SDtfs, 15633 SDslu, 40839 SDs, 0 SdLazy, 25776 SolverSat, 644 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 708 GetRequests, 143 SyntacticMatches, 49 SemanticMatches, 516 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1424 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 54.5s AutomataMinimizationTime, 49 MinimizatonAttempts, 538821 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 2546 NumberOfCodeBlocks, 2546 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 2431 ConstructedInterpolants, 0 QuantifiedInterpolants, 573119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 49 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 incorrect! Received shutdown request...