/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:17:07,136 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:17:07,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:17:07,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:17:07,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:17:07,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:17:07,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:17:07,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:17:07,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:17:07,157 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:17:07,158 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:17:07,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:17:07,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:17:07,160 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:17:07,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:17:07,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:17:07,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:17:07,164 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:17:07,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:17:07,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:17:07,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:17:07,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:17:07,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:17:07,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:17:07,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:17:07,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:17:07,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:17:07,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:17:07,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:17:07,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:17:07,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:17:07,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:17:07,186 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:17:07,187 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:17:07,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:17:07,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:17:07,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:17:07,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:17:07,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:17:07,196 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:17:07,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:17:07,198 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-VariableLbe.epf [2019-12-18 20:17:07,220 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:17:07,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:17:07,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:17:07,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:17:07,222 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:17:07,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:17:07,222 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:17:07,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:17:07,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:17:07,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:17:07,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:17:07,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:17:07,224 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:17:07,224 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:17:07,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:17:07,224 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:17:07,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:17:07,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:17:07,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:17:07,225 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:17:07,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:17:07,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:17:07,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:17:07,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:17:07,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:17:07,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:17:07,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:17:07,226 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:17:07,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:17:07,227 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:17:07,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:17:07,513 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:17:07,516 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:17:07,518 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:17:07,518 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:17:07,519 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc.i [2019-12-18 20:17:07,590 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/146c4af8e/e3cb4a29257946e8bf245db23ae05341/FLAG9d087614b [2019-12-18 20:17:08,142 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:17:08,143 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_power.oepc.i [2019-12-18 20:17:08,165 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/146c4af8e/e3cb4a29257946e8bf245db23ae05341/FLAG9d087614b [2019-12-18 20:17:08,377 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/146c4af8e/e3cb4a29257946e8bf245db23ae05341 [2019-12-18 20:17:08,388 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:17:08,390 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:17:08,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:17:08,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:17:08,395 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:17:08,396 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:17:08" (1/1) ... [2019-12-18 20:17:08,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2253c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:08, skipping insertion in model container [2019-12-18 20:17:08,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:17:08" (1/1) ... [2019-12-18 20:17:08,407 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:17:08,470 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:17:09,057 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:17:09,069 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:17:09,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:17:09,201 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:17:09,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:09 WrapperNode [2019-12-18 20:17:09,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:17:09,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:17:09,203 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:17:09,203 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:17:09,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:09" (1/1) ... [2019-12-18 20:17:09,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:09" (1/1) ... [2019-12-18 20:17:09,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:17:09,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:17:09,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:17:09,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:17:09,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:09" (1/1) ... [2019-12-18 20:17:09,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:09" (1/1) ... [2019-12-18 20:17:09,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:09" (1/1) ... [2019-12-18 20:17:09,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:09" (1/1) ... [2019-12-18 20:17:09,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:09" (1/1) ... [2019-12-18 20:17:09,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:09" (1/1) ... [2019-12-18 20:17:09,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:09" (1/1) ... [2019-12-18 20:17:09,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:17:09,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:17:09,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:17:09,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:17:09,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:09" (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-18 20:17:09,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:17:09,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:17:09,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:17:09,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:17:09,395 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:17:09,395 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:17:09,395 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:17:09,396 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:17:09,396 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:17:09,396 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:17:09,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:17:09,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:17:09,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:17:09,398 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:17:10,163 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:17:10,163 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:17:10,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:17:10 BoogieIcfgContainer [2019-12-18 20:17:10,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:17:10,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:17:10,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:17:10,170 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:17:10,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:17:08" (1/3) ... [2019-12-18 20:17:10,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63fb9900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:17:10, skipping insertion in model container [2019-12-18 20:17:10,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:09" (2/3) ... [2019-12-18 20:17:10,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63fb9900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:17:10, skipping insertion in model container [2019-12-18 20:17:10,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:17:10" (3/3) ... [2019-12-18 20:17:10,174 INFO L109 eAbstractionObserver]: Analyzing ICFG mix011_power.oepc.i [2019-12-18 20:17:10,186 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:17:10,186 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:17:10,195 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:17:10,196 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:17:10,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,246 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,246 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,247 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,247 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,248 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,260 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,260 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,307 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,308 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,355 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,357 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,365 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,365 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,366 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,368 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,368 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:10,396 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:17:10,417 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:17:10,417 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:17:10,417 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:17:10,417 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:17:10,417 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:17:10,417 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:17:10,418 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:17:10,418 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:17:10,433 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-18 20:17:10,435 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 20:17:10,539 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 20:17:10,540 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:17:10,564 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 20:17:10,592 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 20:17:10,671 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 20:17:10,671 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:17:10,679 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 20:17:10,700 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 20:17:10,701 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:17:14,179 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 20:17:14,307 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 20:17:14,613 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 20:17:14,752 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 20:17:14,784 INFO L206 etLargeBlockEncoding]: Checked pairs total: 94688 [2019-12-18 20:17:14,784 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 20:17:14,788 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 106 transitions [2019-12-18 20:17:38,422 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 134882 states. [2019-12-18 20:17:38,424 INFO L276 IsEmpty]: Start isEmpty. Operand 134882 states. [2019-12-18 20:17:38,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 20:17:38,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:38,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 20:17:38,432 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-18 20:17:38,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:38,438 INFO L82 PathProgramCache]: Analyzing trace with hash 915989, now seen corresponding path program 1 times [2019-12-18 20:17:38,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:38,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984000480] [2019-12-18 20:17:38,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:38,812 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-18 20:17:38,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984000480] [2019-12-18 20:17:38,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:38,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:17:38,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329804723] [2019-12-18 20:17:38,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:17:38,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:38,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:17:38,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:17:38,841 INFO L87 Difference]: Start difference. First operand 134882 states. Second operand 3 states. [2019-12-18 20:17:40,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:40,075 INFO L93 Difference]: Finished difference Result 125324 states and 534602 transitions. [2019-12-18 20:17:40,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:17:40,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 20:17:40,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:40,846 INFO L225 Difference]: With dead ends: 125324 [2019-12-18 20:17:40,846 INFO L226 Difference]: Without dead ends: 118044 [2019-12-18 20:17:40,848 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-18 20:17:49,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118044 states. [2019-12-18 20:17:52,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118044 to 118044. [2019-12-18 20:17:52,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118044 states. [2019-12-18 20:17:53,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118044 states to 118044 states and 502920 transitions. [2019-12-18 20:17:53,077 INFO L78 Accepts]: Start accepts. Automaton has 118044 states and 502920 transitions. Word has length 3 [2019-12-18 20:17:53,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:53,078 INFO L462 AbstractCegarLoop]: Abstraction has 118044 states and 502920 transitions. [2019-12-18 20:17:53,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:17:53,078 INFO L276 IsEmpty]: Start isEmpty. Operand 118044 states and 502920 transitions. [2019-12-18 20:17:53,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 20:17:53,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:53,081 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:53,082 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-18 20:17:53,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:53,082 INFO L82 PathProgramCache]: Analyzing trace with hash -31291973, now seen corresponding path program 1 times [2019-12-18 20:17:53,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:53,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495116482] [2019-12-18 20:17:53,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:53,200 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-18 20:17:53,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495116482] [2019-12-18 20:17:53,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:53,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:17:53,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761133978] [2019-12-18 20:17:53,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:17:53,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:53,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:17:53,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:17:53,204 INFO L87 Difference]: Start difference. First operand 118044 states and 502920 transitions. Second operand 4 states. [2019-12-18 20:17:58,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:58,412 INFO L93 Difference]: Finished difference Result 183348 states and 749807 transitions. [2019-12-18 20:17:58,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:17:58,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 20:17:58,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:59,292 INFO L225 Difference]: With dead ends: 183348 [2019-12-18 20:17:59,292 INFO L226 Difference]: Without dead ends: 183299 [2019-12-18 20:17:59,293 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-18 20:18:10,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183299 states. [2019-12-18 20:18:14,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183299 to 167419. [2019-12-18 20:18:14,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167419 states. [2019-12-18 20:18:15,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167419 states to 167419 states and 693327 transitions. [2019-12-18 20:18:15,226 INFO L78 Accepts]: Start accepts. Automaton has 167419 states and 693327 transitions. Word has length 11 [2019-12-18 20:18:15,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:15,226 INFO L462 AbstractCegarLoop]: Abstraction has 167419 states and 693327 transitions. [2019-12-18 20:18:15,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:18:15,227 INFO L276 IsEmpty]: Start isEmpty. Operand 167419 states and 693327 transitions. [2019-12-18 20:18:15,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:18:15,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:15,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:15,234 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-18 20:18:15,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:15,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2078499822, now seen corresponding path program 1 times [2019-12-18 20:18:15,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:15,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757167545] [2019-12-18 20:18:15,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:15,295 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-18 20:18:15,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757167545] [2019-12-18 20:18:15,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:15,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:18:15,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313558491] [2019-12-18 20:18:15,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:18:15,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:15,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:18:15,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:15,297 INFO L87 Difference]: Start difference. First operand 167419 states and 693327 transitions. Second operand 3 states. [2019-12-18 20:18:15,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:15,442 INFO L93 Difference]: Finished difference Result 35457 states and 115033 transitions. [2019-12-18 20:18:15,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:18:15,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 20:18:15,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:15,512 INFO L225 Difference]: With dead ends: 35457 [2019-12-18 20:18:15,512 INFO L226 Difference]: Without dead ends: 35457 [2019-12-18 20:18:15,513 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-18 20:18:15,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35457 states. [2019-12-18 20:18:16,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35457 to 35457. [2019-12-18 20:18:16,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35457 states. [2019-12-18 20:18:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35457 states to 35457 states and 115033 transitions. [2019-12-18 20:18:22,163 INFO L78 Accepts]: Start accepts. Automaton has 35457 states and 115033 transitions. Word has length 13 [2019-12-18 20:18:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:22,163 INFO L462 AbstractCegarLoop]: Abstraction has 35457 states and 115033 transitions. [2019-12-18 20:18:22,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:18:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 35457 states and 115033 transitions. [2019-12-18 20:18:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:18:22,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:22,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:22,168 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-18 20:18:22,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:22,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1087155049, now seen corresponding path program 1 times [2019-12-18 20:18:22,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:22,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444486600] [2019-12-18 20:18:22,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:22,289 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-18 20:18:22,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444486600] [2019-12-18 20:18:22,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:22,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:18:22,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769826686] [2019-12-18 20:18:22,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:18:22,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:22,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:18:22,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:18:22,291 INFO L87 Difference]: Start difference. First operand 35457 states and 115033 transitions. Second operand 5 states. [2019-12-18 20:18:22,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:22,822 INFO L93 Difference]: Finished difference Result 48336 states and 154905 transitions. [2019-12-18 20:18:22,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:18:22,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 20:18:22,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:22,895 INFO L225 Difference]: With dead ends: 48336 [2019-12-18 20:18:22,895 INFO L226 Difference]: Without dead ends: 48336 [2019-12-18 20:18:22,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:18:23,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-18 20:18:23,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 40811. [2019-12-18 20:18:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40811 states. [2019-12-18 20:18:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40811 states to 40811 states and 131928 transitions. [2019-12-18 20:18:24,013 INFO L78 Accepts]: Start accepts. Automaton has 40811 states and 131928 transitions. Word has length 16 [2019-12-18 20:18:24,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:24,014 INFO L462 AbstractCegarLoop]: Abstraction has 40811 states and 131928 transitions. [2019-12-18 20:18:24,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:18:24,014 INFO L276 IsEmpty]: Start isEmpty. Operand 40811 states and 131928 transitions. [2019-12-18 20:18:24,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:18:24,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:24,024 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-18 20:18:24,024 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-18 20:18:24,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:24,025 INFO L82 PathProgramCache]: Analyzing trace with hash 331077478, now seen corresponding path program 1 times [2019-12-18 20:18:24,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:24,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748463749] [2019-12-18 20:18:24,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:24,164 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-18 20:18:24,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748463749] [2019-12-18 20:18:24,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:24,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:18:24,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471010661] [2019-12-18 20:18:24,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:18:24,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:24,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:18:24,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:18:24,166 INFO L87 Difference]: Start difference. First operand 40811 states and 131928 transitions. Second operand 6 states. [2019-12-18 20:18:25,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:25,175 INFO L93 Difference]: Finished difference Result 60696 states and 191428 transitions. [2019-12-18 20:18:25,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:18:25,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 20:18:25,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:25,276 INFO L225 Difference]: With dead ends: 60696 [2019-12-18 20:18:25,276 INFO L226 Difference]: Without dead ends: 60689 [2019-12-18 20:18:25,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:18:25,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60689 states. [2019-12-18 20:18:26,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60689 to 41267. [2019-12-18 20:18:26,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41267 states. [2019-12-18 20:18:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41267 states to 41267 states and 132739 transitions. [2019-12-18 20:18:27,034 INFO L78 Accepts]: Start accepts. Automaton has 41267 states and 132739 transitions. Word has length 22 [2019-12-18 20:18:27,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:27,035 INFO L462 AbstractCegarLoop]: Abstraction has 41267 states and 132739 transitions. [2019-12-18 20:18:27,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:18:27,036 INFO L276 IsEmpty]: Start isEmpty. Operand 41267 states and 132739 transitions. [2019-12-18 20:18:27,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:18:27,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:27,066 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-18 20:18:27,066 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-18 20:18:27,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:27,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1815979917, now seen corresponding path program 1 times [2019-12-18 20:18:27,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:27,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368379504] [2019-12-18 20:18:27,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:27,194 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-18 20:18:27,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368379504] [2019-12-18 20:18:27,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:27,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:18:27,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219830846] [2019-12-18 20:18:27,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:18:27,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:27,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:18:27,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:18:27,198 INFO L87 Difference]: Start difference. First operand 41267 states and 132739 transitions. Second operand 4 states. [2019-12-18 20:18:27,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:27,321 INFO L93 Difference]: Finished difference Result 16400 states and 49837 transitions. [2019-12-18 20:18:27,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:18:27,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 20:18:27,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:27,355 INFO L225 Difference]: With dead ends: 16400 [2019-12-18 20:18:27,355 INFO L226 Difference]: Without dead ends: 16400 [2019-12-18 20:18:27,356 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-18 20:18:27,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16400 states. [2019-12-18 20:18:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16400 to 16107. [2019-12-18 20:18:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16107 states. [2019-12-18 20:18:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16107 states to 16107 states and 49001 transitions. [2019-12-18 20:18:27,750 INFO L78 Accepts]: Start accepts. Automaton has 16107 states and 49001 transitions. Word has length 25 [2019-12-18 20:18:27,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:27,752 INFO L462 AbstractCegarLoop]: Abstraction has 16107 states and 49001 transitions. [2019-12-18 20:18:27,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:18:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 16107 states and 49001 transitions. [2019-12-18 20:18:27,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:18:27,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:27,772 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] [2019-12-18 20:18:27,773 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-18 20:18:27,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:27,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1743661769, now seen corresponding path program 1 times [2019-12-18 20:18:27,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:27,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949850584] [2019-12-18 20:18:27,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:27,910 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-18 20:18:27,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949850584] [2019-12-18 20:18:27,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:27,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:18:27,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014372186] [2019-12-18 20:18:27,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:18:27,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:27,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:18:27,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:18:27,912 INFO L87 Difference]: Start difference. First operand 16107 states and 49001 transitions. Second operand 6 states. [2019-12-18 20:18:28,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:28,445 INFO L93 Difference]: Finished difference Result 23083 states and 68424 transitions. [2019-12-18 20:18:28,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 20:18:28,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 20:18:28,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:28,481 INFO L225 Difference]: With dead ends: 23083 [2019-12-18 20:18:28,482 INFO L226 Difference]: Without dead ends: 23083 [2019-12-18 20:18:28,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:18:28,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23083 states. [2019-12-18 20:18:28,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23083 to 18424. [2019-12-18 20:18:28,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18424 states. [2019-12-18 20:18:28,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18424 states to 18424 states and 55823 transitions. [2019-12-18 20:18:28,936 INFO L78 Accepts]: Start accepts. Automaton has 18424 states and 55823 transitions. Word has length 27 [2019-12-18 20:18:28,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:28,936 INFO L462 AbstractCegarLoop]: Abstraction has 18424 states and 55823 transitions. [2019-12-18 20:18:28,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:18:28,937 INFO L276 IsEmpty]: Start isEmpty. Operand 18424 states and 55823 transitions. [2019-12-18 20:18:28,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 20:18:28,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:28,972 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] [2019-12-18 20:18:28,973 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-18 20:18:28,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:28,973 INFO L82 PathProgramCache]: Analyzing trace with hash 805811820, now seen corresponding path program 1 times [2019-12-18 20:18:28,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:28,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432058464] [2019-12-18 20:18:28,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:29,230 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-18 20:18:29,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432058464] [2019-12-18 20:18:29,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:29,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:18:29,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324035764] [2019-12-18 20:18:29,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:18:29,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:29,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:18:29,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:18:29,233 INFO L87 Difference]: Start difference. First operand 18424 states and 55823 transitions. Second operand 9 states. [2019-12-18 20:18:31,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:31,183 INFO L93 Difference]: Finished difference Result 26715 states and 79377 transitions. [2019-12-18 20:18:31,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 20:18:31,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-18 20:18:31,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:31,226 INFO L225 Difference]: With dead ends: 26715 [2019-12-18 20:18:31,226 INFO L226 Difference]: Without dead ends: 26715 [2019-12-18 20:18:31,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2019-12-18 20:18:31,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26715 states. [2019-12-18 20:18:31,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26715 to 19044. [2019-12-18 20:18:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19044 states. [2019-12-18 20:18:31,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19044 states to 19044 states and 57734 transitions. [2019-12-18 20:18:31,592 INFO L78 Accepts]: Start accepts. Automaton has 19044 states and 57734 transitions. Word has length 33 [2019-12-18 20:18:31,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:31,593 INFO L462 AbstractCegarLoop]: Abstraction has 19044 states and 57734 transitions. [2019-12-18 20:18:31,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:18:31,593 INFO L276 IsEmpty]: Start isEmpty. Operand 19044 states and 57734 transitions. [2019-12-18 20:18:31,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 20:18:31,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:31,618 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] [2019-12-18 20:18:31,619 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-18 20:18:31,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:31,619 INFO L82 PathProgramCache]: Analyzing trace with hash 664142985, now seen corresponding path program 1 times [2019-12-18 20:18:31,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:31,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65997784] [2019-12-18 20:18:31,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:31,887 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-18 20:18:31,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65997784] [2019-12-18 20:18:31,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:31,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:18:31,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271247145] [2019-12-18 20:18:31,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:18:31,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:31,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:18:31,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:18:31,890 INFO L87 Difference]: Start difference. First operand 19044 states and 57734 transitions. Second operand 10 states. [2019-12-18 20:18:33,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:33,677 INFO L93 Difference]: Finished difference Result 26617 states and 79014 transitions. [2019-12-18 20:18:33,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 20:18:33,678 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-12-18 20:18:33,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:33,712 INFO L225 Difference]: With dead ends: 26617 [2019-12-18 20:18:33,712 INFO L226 Difference]: Without dead ends: 26617 [2019-12-18 20:18:33,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2019-12-18 20:18:33,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26617 states. [2019-12-18 20:18:34,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26617 to 18195. [2019-12-18 20:18:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18195 states. [2019-12-18 20:18:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18195 states to 18195 states and 55074 transitions. [2019-12-18 20:18:34,037 INFO L78 Accepts]: Start accepts. Automaton has 18195 states and 55074 transitions. Word has length 37 [2019-12-18 20:18:34,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:34,038 INFO L462 AbstractCegarLoop]: Abstraction has 18195 states and 55074 transitions. [2019-12-18 20:18:34,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:18:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 18195 states and 55074 transitions. [2019-12-18 20:18:34,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 20:18:34,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:34,060 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] [2019-12-18 20:18:34,061 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-18 20:18:34,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:34,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1881663113, now seen corresponding path program 2 times [2019-12-18 20:18:34,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:34,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118557843] [2019-12-18 20:18:34,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:34,182 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-18 20:18:34,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118557843] [2019-12-18 20:18:34,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:34,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:18:34,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469491824] [2019-12-18 20:18:34,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:18:34,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:34,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:18:34,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:18:34,184 INFO L87 Difference]: Start difference. First operand 18195 states and 55074 transitions. Second operand 7 states. [2019-12-18 20:18:35,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:35,080 INFO L93 Difference]: Finished difference Result 29162 states and 85548 transitions. [2019-12-18 20:18:35,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 20:18:35,081 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-12-18 20:18:35,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:35,121 INFO L225 Difference]: With dead ends: 29162 [2019-12-18 20:18:35,122 INFO L226 Difference]: Without dead ends: 29162 [2019-12-18 20:18:35,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-18 20:18:35,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29162 states. [2019-12-18 20:18:35,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29162 to 18918. [2019-12-18 20:18:35,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18918 states. [2019-12-18 20:18:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18918 states to 18918 states and 57118 transitions. [2019-12-18 20:18:35,604 INFO L78 Accepts]: Start accepts. Automaton has 18918 states and 57118 transitions. Word has length 37 [2019-12-18 20:18:35,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:35,605 INFO L462 AbstractCegarLoop]: Abstraction has 18918 states and 57118 transitions. [2019-12-18 20:18:35,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:18:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand 18918 states and 57118 transitions. [2019-12-18 20:18:35,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 20:18:35,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:35,626 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] [2019-12-18 20:18:35,626 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-18 20:18:35,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:35,627 INFO L82 PathProgramCache]: Analyzing trace with hash -163329335, now seen corresponding path program 1 times [2019-12-18 20:18:35,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:35,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364957785] [2019-12-18 20:18:35,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:35,678 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-18 20:18:35,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364957785] [2019-12-18 20:18:35,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:35,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:18:35,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727310685] [2019-12-18 20:18:35,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:18:35,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:35,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:18:35,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:35,680 INFO L87 Difference]: Start difference. First operand 18918 states and 57118 transitions. Second operand 3 states. [2019-12-18 20:18:35,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:35,814 INFO L93 Difference]: Finished difference Result 29344 states and 87977 transitions. [2019-12-18 20:18:35,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:18:35,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-18 20:18:35,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:35,856 INFO L225 Difference]: With dead ends: 29344 [2019-12-18 20:18:35,856 INFO L226 Difference]: Without dead ends: 29344 [2019-12-18 20:18:35,856 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-18 20:18:35,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29344 states. [2019-12-18 20:18:36,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29344 to 22329. [2019-12-18 20:18:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22329 states. [2019-12-18 20:18:36,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22329 states to 22329 states and 67710 transitions. [2019-12-18 20:18:36,250 INFO L78 Accepts]: Start accepts. Automaton has 22329 states and 67710 transitions. Word has length 37 [2019-12-18 20:18:36,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:36,250 INFO L462 AbstractCegarLoop]: Abstraction has 22329 states and 67710 transitions. [2019-12-18 20:18:36,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:18:36,250 INFO L276 IsEmpty]: Start isEmpty. Operand 22329 states and 67710 transitions. [2019-12-18 20:18:36,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 20:18:36,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:36,272 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] [2019-12-18 20:18:36,272 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-18 20:18:36,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:36,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1813761101, now seen corresponding path program 3 times [2019-12-18 20:18:36,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:36,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329417365] [2019-12-18 20:18:36,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:36,375 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-18 20:18:36,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329417365] [2019-12-18 20:18:36,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:36,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:18:36,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928625808] [2019-12-18 20:18:36,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:18:36,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:36,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:18:36,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:18:36,378 INFO L87 Difference]: Start difference. First operand 22329 states and 67710 transitions. Second operand 8 states. [2019-12-18 20:18:37,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:37,734 INFO L93 Difference]: Finished difference Result 29277 states and 86475 transitions. [2019-12-18 20:18:37,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 20:18:37,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-12-18 20:18:37,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:37,790 INFO L225 Difference]: With dead ends: 29277 [2019-12-18 20:18:37,790 INFO L226 Difference]: Without dead ends: 29277 [2019-12-18 20:18:37,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-18 20:18:38,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29277 states. [2019-12-18 20:18:38,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29277 to 19351. [2019-12-18 20:18:38,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19351 states. [2019-12-18 20:18:38,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19351 states to 19351 states and 59074 transitions. [2019-12-18 20:18:38,511 INFO L78 Accepts]: Start accepts. Automaton has 19351 states and 59074 transitions. Word has length 37 [2019-12-18 20:18:38,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:38,512 INFO L462 AbstractCegarLoop]: Abstraction has 19351 states and 59074 transitions. [2019-12-18 20:18:38,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:18:38,512 INFO L276 IsEmpty]: Start isEmpty. Operand 19351 states and 59074 transitions. [2019-12-18 20:18:38,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:18:38,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:38,548 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-18 20:18:38,548 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-18 20:18:38,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:38,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1882924927, now seen corresponding path program 1 times [2019-12-18 20:18:38,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:38,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024117538] [2019-12-18 20:18:38,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:38,613 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-18 20:18:38,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024117538] [2019-12-18 20:18:38,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:38,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:18:38,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959384731] [2019-12-18 20:18:38,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:18:38,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:38,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:18:38,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:38,616 INFO L87 Difference]: Start difference. First operand 19351 states and 59074 transitions. Second operand 3 states. [2019-12-18 20:18:38,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:38,816 INFO L93 Difference]: Finished difference Result 32902 states and 100904 transitions. [2019-12-18 20:18:38,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:18:38,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 20:18:38,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:38,857 INFO L225 Difference]: With dead ends: 32902 [2019-12-18 20:18:38,858 INFO L226 Difference]: Without dead ends: 16530 [2019-12-18 20:18:38,858 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-18 20:18:39,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16530 states. [2019-12-18 20:18:39,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16530 to 16463. [2019-12-18 20:18:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16463 states. [2019-12-18 20:18:39,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16463 states to 16463 states and 49550 transitions. [2019-12-18 20:18:39,529 INFO L78 Accepts]: Start accepts. Automaton has 16463 states and 49550 transitions. Word has length 39 [2019-12-18 20:18:39,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:39,530 INFO L462 AbstractCegarLoop]: Abstraction has 16463 states and 49550 transitions. [2019-12-18 20:18:39,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:18:39,530 INFO L276 IsEmpty]: Start isEmpty. Operand 16463 states and 49550 transitions. [2019-12-18 20:18:39,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:18:39,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:39,558 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-18 20:18:39,558 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-18 20:18:39,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:39,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1781220711, now seen corresponding path program 2 times [2019-12-18 20:18:39,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:39,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720269114] [2019-12-18 20:18:39,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:39,613 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-18 20:18:39,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720269114] [2019-12-18 20:18:39,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:39,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:18:39,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505445612] [2019-12-18 20:18:39,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:18:39,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:39,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:18:39,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:39,615 INFO L87 Difference]: Start difference. First operand 16463 states and 49550 transitions. Second operand 3 states. [2019-12-18 20:18:39,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:39,701 INFO L93 Difference]: Finished difference Result 16462 states and 49548 transitions. [2019-12-18 20:18:39,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:18:39,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 20:18:39,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:39,732 INFO L225 Difference]: With dead ends: 16462 [2019-12-18 20:18:39,732 INFO L226 Difference]: Without dead ends: 16462 [2019-12-18 20:18:39,733 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-18 20:18:39,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16462 states. [2019-12-18 20:18:39,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16462 to 16462. [2019-12-18 20:18:39,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16462 states. [2019-12-18 20:18:40,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16462 states to 16462 states and 49548 transitions. [2019-12-18 20:18:40,016 INFO L78 Accepts]: Start accepts. Automaton has 16462 states and 49548 transitions. Word has length 39 [2019-12-18 20:18:40,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:40,016 INFO L462 AbstractCegarLoop]: Abstraction has 16462 states and 49548 transitions. [2019-12-18 20:18:40,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:18:40,016 INFO L276 IsEmpty]: Start isEmpty. Operand 16462 states and 49548 transitions. [2019-12-18 20:18:40,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:18:40,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:40,038 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-18 20:18:40,038 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-18 20:18:40,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:40,038 INFO L82 PathProgramCache]: Analyzing trace with hash -918298112, now seen corresponding path program 1 times [2019-12-18 20:18:40,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:40,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676217697] [2019-12-18 20:18:40,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:40,087 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-18 20:18:40,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676217697] [2019-12-18 20:18:40,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:40,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:18:40,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705868490] [2019-12-18 20:18:40,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:18:40,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:40,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:18:40,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:18:40,089 INFO L87 Difference]: Start difference. First operand 16462 states and 49548 transitions. Second operand 5 states. [2019-12-18 20:18:40,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:40,176 INFO L93 Difference]: Finished difference Result 15233 states and 46714 transitions. [2019-12-18 20:18:40,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:18:40,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 20:18:40,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:40,203 INFO L225 Difference]: With dead ends: 15233 [2019-12-18 20:18:40,203 INFO L226 Difference]: Without dead ends: 13532 [2019-12-18 20:18:40,204 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-18 20:18:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13532 states. [2019-12-18 20:18:40,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13532 to 13119. [2019-12-18 20:18:40,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13119 states. [2019-12-18 20:18:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13119 states to 13119 states and 41451 transitions. [2019-12-18 20:18:40,429 INFO L78 Accepts]: Start accepts. Automaton has 13119 states and 41451 transitions. Word has length 40 [2019-12-18 20:18:40,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:40,429 INFO L462 AbstractCegarLoop]: Abstraction has 13119 states and 41451 transitions. [2019-12-18 20:18:40,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:18:40,429 INFO L276 IsEmpty]: Start isEmpty. Operand 13119 states and 41451 transitions. [2019-12-18 20:18:40,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:18:40,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:40,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] [2019-12-18 20:18:40,451 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-18 20:18:40,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:40,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1206516285, now seen corresponding path program 1 times [2019-12-18 20:18:40,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:40,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511947551] [2019-12-18 20:18:40,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:40,504 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-18 20:18:40,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511947551] [2019-12-18 20:18:40,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:40,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:18:40,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229386997] [2019-12-18 20:18:40,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:18:40,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:40,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:18:40,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:40,506 INFO L87 Difference]: Start difference. First operand 13119 states and 41451 transitions. Second operand 3 states. [2019-12-18 20:18:40,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:40,605 INFO L93 Difference]: Finished difference Result 17885 states and 54369 transitions. [2019-12-18 20:18:40,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:18:40,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 20:18:40,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:40,639 INFO L225 Difference]: With dead ends: 17885 [2019-12-18 20:18:40,639 INFO L226 Difference]: Without dead ends: 17885 [2019-12-18 20:18:40,640 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-18 20:18:40,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17885 states. [2019-12-18 20:18:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17885 to 13119. [2019-12-18 20:18:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13119 states. [2019-12-18 20:18:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13119 states to 13119 states and 40250 transitions. [2019-12-18 20:18:41,043 INFO L78 Accepts]: Start accepts. Automaton has 13119 states and 40250 transitions. Word has length 64 [2019-12-18 20:18:41,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:41,044 INFO L462 AbstractCegarLoop]: Abstraction has 13119 states and 40250 transitions. [2019-12-18 20:18:41,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:18:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand 13119 states and 40250 transitions. [2019-12-18 20:18:41,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:18:41,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:41,062 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-18 20:18:41,063 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-18 20:18:41,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:41,063 INFO L82 PathProgramCache]: Analyzing trace with hash 529429650, now seen corresponding path program 1 times [2019-12-18 20:18:41,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:41,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911694013] [2019-12-18 20:18:41,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:41,152 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-18 20:18:41,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911694013] [2019-12-18 20:18:41,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:41,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:18:41,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798447461] [2019-12-18 20:18:41,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:18:41,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:41,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:18:41,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:18:41,155 INFO L87 Difference]: Start difference. First operand 13119 states and 40250 transitions. Second operand 7 states. [2019-12-18 20:18:41,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:41,650 INFO L93 Difference]: Finished difference Result 33266 states and 102532 transitions. [2019-12-18 20:18:41,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:18:41,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 20:18:41,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:41,686 INFO L225 Difference]: With dead ends: 33266 [2019-12-18 20:18:41,687 INFO L226 Difference]: Without dead ends: 25898 [2019-12-18 20:18:41,687 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-18 20:18:41,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25898 states. [2019-12-18 20:18:41,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25898 to 15458. [2019-12-18 20:18:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15458 states. [2019-12-18 20:18:42,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15458 states to 15458 states and 47861 transitions. [2019-12-18 20:18:42,008 INFO L78 Accepts]: Start accepts. Automaton has 15458 states and 47861 transitions. Word has length 64 [2019-12-18 20:18:42,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:42,008 INFO L462 AbstractCegarLoop]: Abstraction has 15458 states and 47861 transitions. [2019-12-18 20:18:42,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:18:42,008 INFO L276 IsEmpty]: Start isEmpty. Operand 15458 states and 47861 transitions. [2019-12-18 20:18:42,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:18:42,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:42,023 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-18 20:18:42,024 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-18 20:18:42,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:42,024 INFO L82 PathProgramCache]: Analyzing trace with hash -660129416, now seen corresponding path program 2 times [2019-12-18 20:18:42,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:42,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722236250] [2019-12-18 20:18:42,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:42,111 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-18 20:18:42,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722236250] [2019-12-18 20:18:42,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:42,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:18:42,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87516142] [2019-12-18 20:18:42,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:18:42,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:42,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:18:42,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:18:42,117 INFO L87 Difference]: Start difference. First operand 15458 states and 47861 transitions. Second operand 7 states. [2019-12-18 20:18:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:42,618 INFO L93 Difference]: Finished difference Result 41464 states and 126048 transitions. [2019-12-18 20:18:42,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:18:42,618 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 20:18:42,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:42,672 INFO L225 Difference]: With dead ends: 41464 [2019-12-18 20:18:42,673 INFO L226 Difference]: Without dead ends: 30167 [2019-12-18 20:18:42,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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-18 20:18:42,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30167 states. [2019-12-18 20:18:43,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30167 to 18336. [2019-12-18 20:18:43,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18336 states. [2019-12-18 20:18:43,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18336 states to 18336 states and 56657 transitions. [2019-12-18 20:18:43,199 INFO L78 Accepts]: Start accepts. Automaton has 18336 states and 56657 transitions. Word has length 64 [2019-12-18 20:18:43,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:43,199 INFO L462 AbstractCegarLoop]: Abstraction has 18336 states and 56657 transitions. [2019-12-18 20:18:43,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:18:43,200 INFO L276 IsEmpty]: Start isEmpty. Operand 18336 states and 56657 transitions. [2019-12-18 20:18:43,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:18:43,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:43,225 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-18 20:18:43,225 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-18 20:18:43,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:43,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1274071658, now seen corresponding path program 3 times [2019-12-18 20:18:43,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:43,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187050709] [2019-12-18 20:18:43,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:43,338 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-18 20:18:43,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187050709] [2019-12-18 20:18:43,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:43,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:18:43,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594844050] [2019-12-18 20:18:43,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:18:43,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:43,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:18:43,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:18:43,340 INFO L87 Difference]: Start difference. First operand 18336 states and 56657 transitions. Second operand 9 states. [2019-12-18 20:18:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:44,703 INFO L93 Difference]: Finished difference Result 54016 states and 164154 transitions. [2019-12-18 20:18:44,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:18:44,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 20:18:44,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:44,773 INFO L225 Difference]: With dead ends: 54016 [2019-12-18 20:18:44,774 INFO L226 Difference]: Without dead ends: 51528 [2019-12-18 20:18:44,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-18 20:18:44,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51528 states. [2019-12-18 20:18:45,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51528 to 18481. [2019-12-18 20:18:45,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18481 states. [2019-12-18 20:18:45,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18481 states to 18481 states and 57262 transitions. [2019-12-18 20:18:45,314 INFO L78 Accepts]: Start accepts. Automaton has 18481 states and 57262 transitions. Word has length 64 [2019-12-18 20:18:45,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:45,314 INFO L462 AbstractCegarLoop]: Abstraction has 18481 states and 57262 transitions. [2019-12-18 20:18:45,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:18:45,314 INFO L276 IsEmpty]: Start isEmpty. Operand 18481 states and 57262 transitions. [2019-12-18 20:18:45,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:18:45,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:45,335 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-18 20:18:45,335 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-18 20:18:45,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:45,335 INFO L82 PathProgramCache]: Analyzing trace with hash 212464914, now seen corresponding path program 4 times [2019-12-18 20:18:45,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:45,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762984036] [2019-12-18 20:18:45,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:45,465 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-18 20:18:45,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762984036] [2019-12-18 20:18:45,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:45,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:18:45,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661402667] [2019-12-18 20:18:45,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:18:45,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:45,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:18:45,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:18:45,468 INFO L87 Difference]: Start difference. First operand 18481 states and 57262 transitions. Second operand 9 states. [2019-12-18 20:18:46,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:46,676 INFO L93 Difference]: Finished difference Result 61286 states and 186822 transitions. [2019-12-18 20:18:46,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:18:46,676 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 20:18:46,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:46,759 INFO L225 Difference]: With dead ends: 61286 [2019-12-18 20:18:46,760 INFO L226 Difference]: Without dead ends: 58862 [2019-12-18 20:18:46,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 20:18:46,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58862 states. [2019-12-18 20:18:47,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58862 to 18509. [2019-12-18 20:18:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18509 states. [2019-12-18 20:18:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18509 states to 18509 states and 57416 transitions. [2019-12-18 20:18:47,537 INFO L78 Accepts]: Start accepts. Automaton has 18509 states and 57416 transitions. Word has length 64 [2019-12-18 20:18:47,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:47,537 INFO L462 AbstractCegarLoop]: Abstraction has 18509 states and 57416 transitions. [2019-12-18 20:18:47,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:18:47,538 INFO L276 IsEmpty]: Start isEmpty. Operand 18509 states and 57416 transitions. [2019-12-18 20:18:47,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:18:47,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:47,556 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-18 20:18:47,557 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-18 20:18:47,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:47,557 INFO L82 PathProgramCache]: Analyzing trace with hash 780788010, now seen corresponding path program 5 times [2019-12-18 20:18:47,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:47,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235856237] [2019-12-18 20:18:47,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:47,645 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-18 20:18:47,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235856237] [2019-12-18 20:18:47,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:47,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:18:47,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018861721] [2019-12-18 20:18:47,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:18:47,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:47,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:18:47,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:47,647 INFO L87 Difference]: Start difference. First operand 18509 states and 57416 transitions. Second operand 3 states. [2019-12-18 20:18:47,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:47,709 INFO L93 Difference]: Finished difference Result 15927 states and 48052 transitions. [2019-12-18 20:18:47,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:18:47,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 20:18:47,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:47,730 INFO L225 Difference]: With dead ends: 15927 [2019-12-18 20:18:47,730 INFO L226 Difference]: Without dead ends: 15927 [2019-12-18 20:18:47,730 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-18 20:18:47,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15927 states. [2019-12-18 20:18:47,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15927 to 14929. [2019-12-18 20:18:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14929 states. [2019-12-18 20:18:47,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14929 states to 14929 states and 44866 transitions. [2019-12-18 20:18:47,974 INFO L78 Accepts]: Start accepts. Automaton has 14929 states and 44866 transitions. Word has length 64 [2019-12-18 20:18:47,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:47,974 INFO L462 AbstractCegarLoop]: Abstraction has 14929 states and 44866 transitions. [2019-12-18 20:18:47,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:18:47,974 INFO L276 IsEmpty]: Start isEmpty. Operand 14929 states and 44866 transitions. [2019-12-18 20:18:47,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:18:47,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:47,990 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-18 20:18:47,990 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-18 20:18:47,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:47,991 INFO L82 PathProgramCache]: Analyzing trace with hash 435603939, now seen corresponding path program 1 times [2019-12-18 20:18:47,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:47,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331778490] [2019-12-18 20:18:47,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:48,128 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-18 20:18:48,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331778490] [2019-12-18 20:18:48,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:48,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:18:48,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689933660] [2019-12-18 20:18:48,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:18:48,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:48,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:18:48,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:18:48,131 INFO L87 Difference]: Start difference. First operand 14929 states and 44866 transitions. Second operand 9 states. [2019-12-18 20:18:48,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:48,926 INFO L93 Difference]: Finished difference Result 22509 states and 67910 transitions. [2019-12-18 20:18:48,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:18:48,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 20:18:48,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:48,958 INFO L225 Difference]: With dead ends: 22509 [2019-12-18 20:18:48,958 INFO L226 Difference]: Without dead ends: 22509 [2019-12-18 20:18:48,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:18:49,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22509 states. [2019-12-18 20:18:49,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22509 to 15267. [2019-12-18 20:18:49,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15267 states. [2019-12-18 20:18:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15267 states to 15267 states and 45870 transitions. [2019-12-18 20:18:49,234 INFO L78 Accepts]: Start accepts. Automaton has 15267 states and 45870 transitions. Word has length 65 [2019-12-18 20:18:49,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:49,235 INFO L462 AbstractCegarLoop]: Abstraction has 15267 states and 45870 transitions. [2019-12-18 20:18:49,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:18:49,235 INFO L276 IsEmpty]: Start isEmpty. Operand 15267 states and 45870 transitions. [2019-12-18 20:18:49,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:18:49,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:49,251 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-18 20:18:49,251 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-18 20:18:49,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:49,251 INFO L82 PathProgramCache]: Analyzing trace with hash -549275619, now seen corresponding path program 2 times [2019-12-18 20:18:49,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:49,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147734453] [2019-12-18 20:18:49,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:49,442 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-18 20:18:49,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147734453] [2019-12-18 20:18:49,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:49,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:18:49,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906730677] [2019-12-18 20:18:49,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:18:49,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:49,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:18:49,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:18:49,445 INFO L87 Difference]: Start difference. First operand 15267 states and 45870 transitions. Second operand 10 states. [2019-12-18 20:18:51,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:51,366 INFO L93 Difference]: Finished difference Result 29988 states and 89809 transitions. [2019-12-18 20:18:51,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 20:18:51,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-18 20:18:51,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:51,398 INFO L225 Difference]: With dead ends: 29988 [2019-12-18 20:18:51,398 INFO L226 Difference]: Without dead ends: 22775 [2019-12-18 20:18:51,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-12-18 20:18:51,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22775 states. [2019-12-18 20:18:51,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22775 to 15792. [2019-12-18 20:18:51,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15792 states. [2019-12-18 20:18:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15792 states to 15792 states and 47342 transitions. [2019-12-18 20:18:51,689 INFO L78 Accepts]: Start accepts. Automaton has 15792 states and 47342 transitions. Word has length 65 [2019-12-18 20:18:51,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:51,690 INFO L462 AbstractCegarLoop]: Abstraction has 15792 states and 47342 transitions. [2019-12-18 20:18:51,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:18:51,690 INFO L276 IsEmpty]: Start isEmpty. Operand 15792 states and 47342 transitions. [2019-12-18 20:18:51,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:18:51,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:51,707 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-18 20:18:51,707 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-18 20:18:51,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:51,707 INFO L82 PathProgramCache]: Analyzing trace with hash 2029406981, now seen corresponding path program 3 times [2019-12-18 20:18:51,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:51,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682909482] [2019-12-18 20:18:51,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:51,881 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-18 20:18:51,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682909482] [2019-12-18 20:18:51,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:51,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:18:51,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044443378] [2019-12-18 20:18:51,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:18:51,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:51,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:18:51,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:18:51,883 INFO L87 Difference]: Start difference. First operand 15792 states and 47342 transitions. Second operand 11 states. [2019-12-18 20:18:53,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:53,946 INFO L93 Difference]: Finished difference Result 28760 states and 85433 transitions. [2019-12-18 20:18:53,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 20:18:53,946 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 20:18:53,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:53,976 INFO L225 Difference]: With dead ends: 28760 [2019-12-18 20:18:53,976 INFO L226 Difference]: Without dead ends: 23457 [2019-12-18 20:18:53,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-18 20:18:54,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23457 states. [2019-12-18 20:18:54,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23457 to 15816. [2019-12-18 20:18:54,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15816 states. [2019-12-18 20:18:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15816 states to 15816 states and 47255 transitions. [2019-12-18 20:18:54,267 INFO L78 Accepts]: Start accepts. Automaton has 15816 states and 47255 transitions. Word has length 65 [2019-12-18 20:18:54,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:54,267 INFO L462 AbstractCegarLoop]: Abstraction has 15816 states and 47255 transitions. [2019-12-18 20:18:54,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:18:54,267 INFO L276 IsEmpty]: Start isEmpty. Operand 15816 states and 47255 transitions. [2019-12-18 20:18:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:18:54,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:54,283 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-18 20:18:54,283 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-18 20:18:54,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:54,283 INFO L82 PathProgramCache]: Analyzing trace with hash -423322147, now seen corresponding path program 4 times [2019-12-18 20:18:54,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:54,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29527614] [2019-12-18 20:18:54,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:54,342 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-18 20:18:54,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29527614] [2019-12-18 20:18:54,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:54,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:18:54,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956385160] [2019-12-18 20:18:54,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:18:54,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:54,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:18:54,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:54,344 INFO L87 Difference]: Start difference. First operand 15816 states and 47255 transitions. Second operand 3 states. [2019-12-18 20:18:54,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:54,406 INFO L93 Difference]: Finished difference Result 15815 states and 47253 transitions. [2019-12-18 20:18:54,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:18:54,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 20:18:54,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:54,432 INFO L225 Difference]: With dead ends: 15815 [2019-12-18 20:18:54,433 INFO L226 Difference]: Without dead ends: 15815 [2019-12-18 20:18:54,433 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-18 20:18:54,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15815 states. [2019-12-18 20:18:54,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15815 to 14003. [2019-12-18 20:18:54,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14003 states. [2019-12-18 20:18:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14003 states to 14003 states and 42214 transitions. [2019-12-18 20:18:54,686 INFO L78 Accepts]: Start accepts. Automaton has 14003 states and 42214 transitions. Word has length 65 [2019-12-18 20:18:54,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:54,686 INFO L462 AbstractCegarLoop]: Abstraction has 14003 states and 42214 transitions. [2019-12-18 20:18:54,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:18:54,686 INFO L276 IsEmpty]: Start isEmpty. Operand 14003 states and 42214 transitions. [2019-12-18 20:18:54,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:18:54,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:54,700 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-18 20:18:54,700 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-18 20:18:54,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:54,700 INFO L82 PathProgramCache]: Analyzing trace with hash 295960154, now seen corresponding path program 1 times [2019-12-18 20:18:54,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:54,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506633431] [2019-12-18 20:18:54,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:54,964 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-18 20:18:54,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506633431] [2019-12-18 20:18:54,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:54,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:18:54,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400119465] [2019-12-18 20:18:54,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:18:54,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:54,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:18:54,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:18:54,967 INFO L87 Difference]: Start difference. First operand 14003 states and 42214 transitions. Second operand 11 states. [2019-12-18 20:18:56,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:56,271 INFO L93 Difference]: Finished difference Result 32582 states and 97501 transitions. [2019-12-18 20:18:56,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 20:18:56,271 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 20:18:56,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:56,302 INFO L225 Difference]: With dead ends: 32582 [2019-12-18 20:18:56,302 INFO L226 Difference]: Without dead ends: 23811 [2019-12-18 20:18:56,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=1028, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 20:18:56,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23811 states. [2019-12-18 20:18:56,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23811 to 12798. [2019-12-18 20:18:56,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12798 states. [2019-12-18 20:18:56,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12798 states to 12798 states and 38540 transitions. [2019-12-18 20:18:56,583 INFO L78 Accepts]: Start accepts. Automaton has 12798 states and 38540 transitions. Word has length 66 [2019-12-18 20:18:56,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:56,583 INFO L462 AbstractCegarLoop]: Abstraction has 12798 states and 38540 transitions. [2019-12-18 20:18:56,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:18:56,583 INFO L276 IsEmpty]: Start isEmpty. Operand 12798 states and 38540 transitions. [2019-12-18 20:18:56,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:18:56,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:56,596 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-18 20:18:56,597 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-18 20:18:56,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:56,599 INFO L82 PathProgramCache]: Analyzing trace with hash -992763836, now seen corresponding path program 2 times [2019-12-18 20:18:56,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:56,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625309321] [2019-12-18 20:18:56,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:56,756 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-18 20:18:56,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625309321] [2019-12-18 20:18:56,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:56,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:18:56,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8358521] [2019-12-18 20:18:56,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:18:56,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:56,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:18:56,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:18:56,758 INFO L87 Difference]: Start difference. First operand 12798 states and 38540 transitions. Second operand 8 states. [2019-12-18 20:18:57,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:57,774 INFO L93 Difference]: Finished difference Result 24037 states and 70441 transitions. [2019-12-18 20:18:57,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 20:18:57,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 20:18:57,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:57,805 INFO L225 Difference]: With dead ends: 24037 [2019-12-18 20:18:57,805 INFO L226 Difference]: Without dead ends: 23869 [2019-12-18 20:18:57,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-12-18 20:18:57,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23869 states. [2019-12-18 20:18:58,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23869 to 17148. [2019-12-18 20:18:58,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17148 states. [2019-12-18 20:18:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17148 states to 17148 states and 50997 transitions. [2019-12-18 20:18:58,226 INFO L78 Accepts]: Start accepts. Automaton has 17148 states and 50997 transitions. Word has length 66 [2019-12-18 20:18:58,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:58,226 INFO L462 AbstractCegarLoop]: Abstraction has 17148 states and 50997 transitions. [2019-12-18 20:18:58,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:18:58,227 INFO L276 IsEmpty]: Start isEmpty. Operand 17148 states and 50997 transitions. [2019-12-18 20:18:58,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:18:58,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:58,244 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-18 20:18:58,245 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-18 20:18:58,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:58,245 INFO L82 PathProgramCache]: Analyzing trace with hash -149828840, now seen corresponding path program 3 times [2019-12-18 20:18:58,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:58,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524882335] [2019-12-18 20:18:58,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:58,318 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-18 20:18:58,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524882335] [2019-12-18 20:18:58,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:58,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:18:58,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776057365] [2019-12-18 20:18:58,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:18:58,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:58,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:18:58,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:58,320 INFO L87 Difference]: Start difference. First operand 17148 states and 50997 transitions. Second operand 3 states. [2019-12-18 20:18:58,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:58,447 INFO L93 Difference]: Finished difference Result 19899 states and 59416 transitions. [2019-12-18 20:18:58,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:18:58,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 20:18:58,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:58,472 INFO L225 Difference]: With dead ends: 19899 [2019-12-18 20:18:58,473 INFO L226 Difference]: Without dead ends: 19899 [2019-12-18 20:18:58,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:58,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19899 states. [2019-12-18 20:18:58,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19899 to 15275. [2019-12-18 20:18:58,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15275 states. [2019-12-18 20:18:58,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15275 states to 15275 states and 45986 transitions. [2019-12-18 20:18:58,739 INFO L78 Accepts]: Start accepts. Automaton has 15275 states and 45986 transitions. Word has length 66 [2019-12-18 20:18:58,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:58,740 INFO L462 AbstractCegarLoop]: Abstraction has 15275 states and 45986 transitions. [2019-12-18 20:18:58,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:18:58,740 INFO L276 IsEmpty]: Start isEmpty. Operand 15275 states and 45986 transitions. [2019-12-18 20:18:58,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:18:58,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:58,757 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, 1] [2019-12-18 20:18:58,757 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-18 20:18:58,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:58,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1704185659, now seen corresponding path program 1 times [2019-12-18 20:18:58,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:58,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105232497] [2019-12-18 20:18:58,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:18:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:18:58,914 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:18:58,914 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:18:58,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [897] [897] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= 0 v_~a$r_buff1_thd3~0_51) (= 0 v_~a$w_buff1_used~0_72) (= v_~main$tmp_guard1~0_18 0) (= v_~__unbuffered_p1_EBX~0_17 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t281~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t281~0.base_25|) |v_ULTIMATE.start_main_~#t281~0.offset_20| 0)) |v_#memory_int_23|) (= 0 v_~a$w_buff0_used~0_114) (= v_~a$r_buff0_thd0~0_20 0) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t281~0.base_25|)) (= 0 v_~a$r_buff1_thd1~0_16) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t281~0.base_25|) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t281~0.base_25| 1)) (= 0 v_~__unbuffered_cnt~0_21) (= v_~z~0_10 0) (= v_~a$flush_delayed~0_12 0) (= 0 |v_ULTIMATE.start_main_~#t281~0.offset_20|) (= 0 v_~weak$$choice2~0_32) (= v_~a$r_buff0_thd3~0_76 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~__unbuffered_p2_EAX~0_17) (= v_~__unbuffered_p2_EBX~0_18 0) (= v_~a$r_buff0_thd2~0_20 0) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice0~0_7) (= v_~a$mem_tmp~0_10 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t281~0.base_25| 4)) (= v_~a~0_29 0) (= 0 v_~a$r_buff1_thd0~0_22) (= |v_#NULL.offset_4| 0) (= v_~a$r_buff0_thd1~0_25 0) (= v_~main$tmp_guard0~0_11 0) (= v_~a$read_delayed_var~0.offset_8 0) (= 0 v_~a$w_buff1~0_25) (= v_~x~0_19 0) (= 0 v_~a$r_buff1_thd2~0_18) (= 0 v_~__unbuffered_p1_EAX~0_16) (= 0 v_~a$w_buff0~0_25) (= 0 v_~a$read_delayed~0_8) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t282~0.base=|v_ULTIMATE.start_main_~#t282~0.base_26|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_11|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_20, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~a~0=v_~a~0_29, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_25|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ULTIMATE.start_main_~#t283~0.offset=|v_ULTIMATE.start_main_~#t283~0.offset_16|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_18, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_114, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_25, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_25, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_22, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_19, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~a$w_buff1~0=v_~a$w_buff1~0_25, ULTIMATE.start_main_~#t283~0.base=|v_ULTIMATE.start_main_~#t283~0.base_22|, ~y~0=v_~y~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_16, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_76, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t282~0.offset=|v_ULTIMATE.start_main_~#t282~0.offset_20|, ULTIMATE.start_main_~#t281~0.base=|v_ULTIMATE.start_main_~#t281~0.base_25|, ~a$flush_delayed~0=v_~a$flush_delayed~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_10, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t281~0.offset=|v_ULTIMATE.start_main_~#t281~0.offset_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t282~0.base, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t283~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t283~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t282~0.offset, ULTIMATE.start_main_~#t281~0.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t281~0.offset] because there is no mapped edge [2019-12-18 20:18:58,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L835-1-->L837: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t282~0.base_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t282~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t282~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t282~0.base_13|) |v_ULTIMATE.start_main_~#t282~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t282~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t282~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t282~0.offset_11|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t282~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t282~0.base=|v_ULTIMATE.start_main_~#t282~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t282~0.offset=|v_ULTIMATE.start_main_~#t282~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t282~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t282~0.offset] because there is no mapped edge [2019-12-18 20:18:58,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L4-->L750: Formula: (and (= 1 v_~x~0_5) (= v_~a$r_buff0_thd1~0_16 v_~a$r_buff1_thd1~0_11) (= v_~a$r_buff0_thd1~0_15 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8)) (= v_~a$r_buff0_thd2~0_14 v_~a$r_buff1_thd2~0_10) (= v_~a$r_buff0_thd3~0_48 v_~a$r_buff1_thd3~0_28) (= v_~a$r_buff0_thd0~0_14 v_~a$r_buff1_thd0~0_11)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_14, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_16, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_14} OutVars{~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_11, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_10, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_14, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_11, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_15, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_14, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 20:18:58,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L776-2-->L776-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In1262420163 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In1262420163 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1262420163| ~a~0_In1262420163) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out1262420163| ~a$w_buff1~0_In1262420163) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In1262420163, ~a$w_buff1~0=~a$w_buff1~0_In1262420163, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1262420163, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1262420163} OutVars{~a~0=~a~0_In1262420163, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1262420163|, ~a$w_buff1~0=~a$w_buff1~0_In1262420163, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1262420163, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1262420163} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 20:18:58,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L776-4-->L777: Formula: (= v_~a~0_20 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{~a~0=v_~a~0_20, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 20:18:58,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L751-->L751-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-1519070622 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1519070622 256)))) (or (and (= ~a$w_buff0_used~0_In-1519070622 |P0Thread1of1ForFork1_#t~ite5_Out-1519070622|) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-1519070622| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1519070622, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1519070622} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1519070622|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1519070622, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1519070622} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 20:18:58,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-1659033116 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In-1659033116 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1659033116 256))) (.cse3 (= (mod ~a$r_buff0_thd1~0_In-1659033116 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1659033116| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1659033116| ~a$w_buff1_used~0_In-1659033116) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1659033116, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1659033116, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1659033116, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1659033116} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1659033116|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1659033116, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1659033116, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1659033116, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1659033116} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 20:18:58,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L753-->L754: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In1090822965 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1090822965 256) 0))) (or (and (= ~a$r_buff0_thd1~0_Out1090822965 ~a$r_buff0_thd1~0_In1090822965) (or .cse0 .cse1)) (and (not .cse0) (= ~a$r_buff0_thd1~0_Out1090822965 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1090822965, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1090822965} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1090822965|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1090822965, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1090822965} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:18:58,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L754-->L754-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-161715332 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-161715332 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-161715332 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In-161715332 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out-161715332| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out-161715332| ~a$r_buff1_thd1~0_In-161715332)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-161715332, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-161715332, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-161715332, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-161715332} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-161715332|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-161715332, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-161715332, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-161715332, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-161715332} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 20:18:58,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L754-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:18:58,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L837-1-->L839: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t283~0.base_12|) 0) (= |v_ULTIMATE.start_main_~#t283~0.offset_10| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t283~0.base_12| 4) |v_#length_15|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t283~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t283~0.base_12| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t283~0.base_12| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t283~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t283~0.base_12|) |v_ULTIMATE.start_main_~#t283~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t283~0.base=|v_ULTIMATE.start_main_~#t283~0.base_12|, #length=|v_#length_15|, ULTIMATE.start_main_~#t283~0.offset=|v_ULTIMATE.start_main_~#t283~0.offset_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t283~0.base, #length, ULTIMATE.start_main_~#t283~0.offset] because there is no mapped edge [2019-12-18 20:18:58,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1507214729 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In1507214729| |P2Thread1of1ForFork0_#t~ite20_Out1507214729|) (= ~a$w_buff0~0_In1507214729 |P2Thread1of1ForFork0_#t~ite21_Out1507214729|) (not .cse0)) (and .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1507214729 256) 0))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In1507214729 256))) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1507214729 256))) (= (mod ~a$w_buff0_used~0_In1507214729 256) 0))) (= |P2Thread1of1ForFork0_#t~ite20_Out1507214729| |P2Thread1of1ForFork0_#t~ite21_Out1507214729|) (= ~a$w_buff0~0_In1507214729 |P2Thread1of1ForFork0_#t~ite20_Out1507214729|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1507214729, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1507214729, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1507214729, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1507214729, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1507214729, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1507214729|, ~weak$$choice2~0=~weak$$choice2~0_In1507214729} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1507214729|, ~a$w_buff0~0=~a$w_buff0~0_In1507214729, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1507214729, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1507214729, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1507214729, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1507214729|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1507214729, ~weak$$choice2~0=~weak$$choice2~0_In1507214729} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 20:18:58,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1139457730 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In1139457730| |P2Thread1of1ForFork0_#t~ite26_Out1139457730|) (= |P2Thread1of1ForFork0_#t~ite27_Out1139457730| ~a$w_buff0_used~0_In1139457730)) (and (= ~a$w_buff0_used~0_In1139457730 |P2Thread1of1ForFork0_#t~ite26_Out1139457730|) (= |P2Thread1of1ForFork0_#t~ite27_Out1139457730| |P2Thread1of1ForFork0_#t~ite26_Out1139457730|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1139457730 256) 0))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In1139457730 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In1139457730 256)) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In1139457730 256) 0)))) .cse0))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1139457730|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1139457730, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1139457730, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1139457730, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1139457730, ~weak$$choice2~0=~weak$$choice2~0_In1139457730} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1139457730|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1139457730|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1139457730, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1139457730, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1139457730, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1139457730, ~weak$$choice2~0=~weak$$choice2~0_In1139457730} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 20:18:58,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L804-->L804-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-847016257 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite29_Out-847016257| ~a$w_buff1_used~0_In-847016257) .cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out-847016257| |P2Thread1of1ForFork0_#t~ite30_Out-847016257|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-847016257 256) 0))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-847016257 256))) (= 0 (mod ~a$w_buff0_used~0_In-847016257 256)) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-847016257 256) 0))))) (and (= |P2Thread1of1ForFork0_#t~ite29_In-847016257| |P2Thread1of1ForFork0_#t~ite29_Out-847016257|) (= ~a$w_buff1_used~0_In-847016257 |P2Thread1of1ForFork0_#t~ite30_Out-847016257|) (not .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-847016257, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-847016257, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-847016257, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-847016257, ~weak$$choice2~0=~weak$$choice2~0_In-847016257, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-847016257|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-847016257, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-847016257, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-847016257, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-847016257|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-847016257, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-847016257|, ~weak$$choice2~0=~weak$$choice2~0_In-847016257} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 20:18:58,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L805-->L806: Formula: (and (= v_~a$r_buff0_thd3~0_61 v_~a$r_buff0_thd3~0_60) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 20:18:58,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L808-->L812: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a$flush_delayed~0_6 0) (= v_~a~0_21 v_~a$mem_tmp~0_4)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_21, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 20:18:58,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L812-2-->L812-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In822125330 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In822125330 256)))) (or (and (or .cse0 .cse1) (= ~a~0_In822125330 |P2Thread1of1ForFork0_#t~ite38_Out822125330|)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out822125330| ~a$w_buff1~0_In822125330) (not .cse1) (not .cse0)))) InVars {~a~0=~a~0_In822125330, ~a$w_buff1~0=~a$w_buff1~0_In822125330, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In822125330, ~a$w_buff1_used~0=~a$w_buff1_used~0_In822125330} OutVars{~a~0=~a~0_In822125330, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out822125330|, ~a$w_buff1~0=~a$w_buff1~0_In822125330, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In822125330, ~a$w_buff1_used~0=~a$w_buff1_used~0_In822125330} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 20:18:58,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L812-4-->L813: Formula: (= v_~a~0_16 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_16, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 20:18:58,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-269988440 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-269988440 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-269988440|) (not .cse0) (not .cse1)) (and (= ~a$w_buff0_used~0_In-269988440 |P2Thread1of1ForFork0_#t~ite40_Out-269988440|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-269988440, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-269988440} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-269988440|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-269988440, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-269988440} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 20:18:58,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd3~0_In502185524 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In502185524 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In502185524 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In502185524 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out502185524| ~a$w_buff1_used~0_In502185524) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite41_Out502185524| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In502185524, ~a$w_buff0_used~0=~a$w_buff0_used~0_In502185524, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In502185524, ~a$w_buff1_used~0=~a$w_buff1_used~0_In502185524} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In502185524, ~a$w_buff0_used~0=~a$w_buff0_used~0_In502185524, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In502185524, ~a$w_buff1_used~0=~a$w_buff1_used~0_In502185524, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out502185524|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 20:18:58,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In299478729 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In299478729 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out299478729| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd3~0_In299478729 |P2Thread1of1ForFork0_#t~ite42_Out299478729|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In299478729, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In299478729} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In299478729, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In299478729, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out299478729|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 20:18:58,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L816-->L816-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd3~0_In113787489 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In113787489 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In113787489 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In113787489 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out113787489| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite43_Out113787489| ~a$r_buff1_thd3~0_In113787489) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In113787489, ~a$w_buff0_used~0=~a$w_buff0_used~0_In113787489, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In113787489, ~a$w_buff1_used~0=~a$w_buff1_used~0_In113787489} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out113787489|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In113787489, ~a$w_buff0_used~0=~a$w_buff0_used~0_In113787489, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In113787489, ~a$w_buff1_used~0=~a$w_buff1_used~0_In113787489} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 20:18:58,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_42 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_42, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 20:18:58,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1994126086 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1994126086 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1994126086| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out1994126086| ~a$w_buff0_used~0_In1994126086)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1994126086, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1994126086} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1994126086, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1994126086, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1994126086|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 20:18:58,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-227436457 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-227436457 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-227436457 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-227436457 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-227436457|)) (and (or .cse1 .cse0) (= ~a$w_buff1_used~0_In-227436457 |P1Thread1of1ForFork2_#t~ite12_Out-227436457|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-227436457, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-227436457, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-227436457, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-227436457} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-227436457, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-227436457, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-227436457, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-227436457|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-227436457} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 20:18:58,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In2066538583 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In2066538583 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out2066538583|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In2066538583 |P1Thread1of1ForFork2_#t~ite13_Out2066538583|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2066538583, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2066538583} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2066538583, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2066538583, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out2066538583|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 20:18:58,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1562697124 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1562697124 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In1562697124 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In1562697124 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out1562697124| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork2_#t~ite14_Out1562697124| ~a$r_buff1_thd2~0_In1562697124) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1562697124, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1562697124, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1562697124, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1562697124} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1562697124, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1562697124, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1562697124, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1562697124, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1562697124|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 20:18:58,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L780-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 20:18:58,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L839-1-->L845: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:18:58,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L845-2-->L845-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-521814264 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-521814264 256)))) (or (and (= ~a$w_buff1~0_In-521814264 |ULTIMATE.start_main_#t~ite47_Out-521814264|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a~0_In-521814264 |ULTIMATE.start_main_#t~ite47_Out-521814264|)))) InVars {~a~0=~a~0_In-521814264, ~a$w_buff1~0=~a$w_buff1~0_In-521814264, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-521814264, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-521814264} OutVars{~a~0=~a~0_In-521814264, ~a$w_buff1~0=~a$w_buff1~0_In-521814264, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-521814264|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-521814264, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-521814264} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 20:18:58,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L845-4-->L846: Formula: (= v_~a~0_18 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{~a~0=v_~a~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 20:18:58,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In893706765 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In893706765 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out893706765| 0)) (and (= |ULTIMATE.start_main_#t~ite49_Out893706765| ~a$w_buff0_used~0_In893706765) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In893706765, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In893706765} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In893706765, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out893706765|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In893706765} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 20:18:58,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L847-->L847-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In155242225 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In155242225 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In155242225 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In155242225 256)))) (or (and (= ~a$w_buff1_used~0_In155242225 |ULTIMATE.start_main_#t~ite50_Out155242225|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out155242225|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In155242225, ~a$w_buff0_used~0=~a$w_buff0_used~0_In155242225, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In155242225, ~a$w_buff1_used~0=~a$w_buff1_used~0_In155242225} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out155242225|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In155242225, ~a$w_buff0_used~0=~a$w_buff0_used~0_In155242225, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In155242225, ~a$w_buff1_used~0=~a$w_buff1_used~0_In155242225} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 20:18:58,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1879847461 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1879847461 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1879847461|)) (and (= ~a$r_buff0_thd0~0_In1879847461 |ULTIMATE.start_main_#t~ite51_Out1879847461|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1879847461, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1879847461} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1879847461|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1879847461, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1879847461} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 20:18:58,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In2059899280 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In2059899280 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In2059899280 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In2059899280 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd0~0_In2059899280 |ULTIMATE.start_main_#t~ite52_Out2059899280|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out2059899280|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2059899280, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2059899280, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2059899280, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2059899280} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out2059899280|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2059899280, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2059899280, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2059899280, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2059899280} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 20:18:58,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= v_~x~0_10 2) (= 0 v_~__unbuffered_p1_EBX~0_8) (= 1 v_~__unbuffered_p1_EAX~0_7) (= v_~__unbuffered_p2_EBX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_14| v_~a$r_buff1_thd0~0_15) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_10} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_15, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:18:59,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:18:59 BasicIcfg [2019-12-18 20:18:59,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:18:59,060 INFO L168 Benchmark]: Toolchain (without parser) took 110670.48 ms. Allocated memory was 145.8 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 101.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 20:18:59,060 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 20:18:59,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 811.48 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.8 MB in the beginning and 157.1 MB in the end (delta: -56.3 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-12-18 20:18:59,065 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.63 ms. Allocated memory is still 203.4 MB. Free memory was 157.1 MB in the beginning and 154.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:18:59,066 INFO L168 Benchmark]: Boogie Preprocessor took 40.81 ms. Allocated memory is still 203.4 MB. Free memory was 154.4 MB in the beginning and 151.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:18:59,067 INFO L168 Benchmark]: RCFGBuilder took 839.07 ms. Allocated memory is still 203.4 MB. Free memory was 151.7 MB in the beginning and 101.4 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-18 20:18:59,074 INFO L168 Benchmark]: TraceAbstraction took 108891.65 ms. Allocated memory was 203.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 100.7 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 20:18:59,079 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.50 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 811.48 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.8 MB in the beginning and 157.1 MB in the end (delta: -56.3 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.63 ms. Allocated memory is still 203.4 MB. Free memory was 157.1 MB in the beginning and 154.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.81 ms. Allocated memory is still 203.4 MB. Free memory was 154.4 MB in the beginning and 151.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 839.07 ms. Allocated memory is still 203.4 MB. Free memory was 151.7 MB in the beginning and 101.4 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 108891.65 ms. Allocated memory was 203.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 100.7 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 178 ProgramPointsBefore, 96 ProgramPointsAfterwards, 215 TransitionsBefore, 106 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 31 ChoiceCompositions, 7327 VarBasedMoverChecksPositive, 212 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 94688 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L764] 2 x = 2 [L767] 2 y = 1 [L770] 2 __unbuffered_p1_EAX = y [L773] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L776] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L839] FCALL, FORK 0 pthread_create(&t283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L790] 3 z = 1 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=1] [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=1] [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=2, y=1, z=1] [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=1] [L812] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=1] [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L845] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=1] [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 108.5s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 29.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6742 SDtfs, 9020 SDslu, 22608 SDs, 0 SdLazy, 12710 SolverSat, 512 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 369 GetRequests, 53 SyntacticMatches, 11 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1382 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167419occurred 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: 46.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 239008 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1325 NumberOfCodeBlocks, 1325 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1230 ConstructedInterpolants, 0 QuantifiedInterpolants, 254629 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...