/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/mix032_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:13:30,115 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:13:30,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:13:30,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:13:30,130 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:13:30,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:13:30,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:13:30,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:13:30,135 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:13:30,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:13:30,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:13:30,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:13:30,138 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:13:30,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:13:30,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:13:30,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:13:30,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:13:30,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:13:30,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:13:30,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:13:30,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:13:30,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:13:30,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:13:30,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:13:30,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:13:30,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:13:30,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:13:30,154 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:13:30,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:13:30,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:13:30,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:13:30,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:13:30,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:13:30,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:13:30,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:13:30,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:13:30,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:13:30,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:13:30,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:13:30,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:13:30,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:13:30,165 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-27 06:13:30,187 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:13:30,188 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:13:30,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:13:30,190 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:13:30,190 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:13:30,190 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:13:30,190 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:13:30,191 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:13:30,191 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:13:30,191 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:13:30,192 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:13:30,192 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:13:30,192 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:13:30,193 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:13:30,193 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:13:30,193 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:13:30,193 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:13:30,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:13:30,194 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:13:30,194 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:13:30,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:13:30,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:13:30,195 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:13:30,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:13:30,195 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:13:30,195 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:13:30,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:13:30,196 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:13:30,196 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:13:30,196 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:13:30,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:13:30,573 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:13:30,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:13:30,579 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:13:30,579 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:13:30,580 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_power.oepc.i [2019-12-27 06:13:30,658 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efdf5e3c4/8c6f57fe46a34fbfbd076c39fffc56b3/FLAGbc5ef6fef [2019-12-27 06:13:31,163 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:13:31,164 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_power.oepc.i [2019-12-27 06:13:31,181 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efdf5e3c4/8c6f57fe46a34fbfbd076c39fffc56b3/FLAGbc5ef6fef [2019-12-27 06:13:31,488 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efdf5e3c4/8c6f57fe46a34fbfbd076c39fffc56b3 [2019-12-27 06:13:31,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:13:31,500 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:13:31,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:13:31,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:13:31,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:13:31,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:13:31" (1/1) ... [2019-12-27 06:13:31,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:31, skipping insertion in model container [2019-12-27 06:13:31,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:13:31" (1/1) ... [2019-12-27 06:13:31,516 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:13:31,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:13:32,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:13:32,194 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:13:32,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:13:32,337 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:13:32,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:32 WrapperNode [2019-12-27 06:13:32,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:13:32,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:13:32,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:13:32,339 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:13:32,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:32" (1/1) ... [2019-12-27 06:13:32,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:32" (1/1) ... [2019-12-27 06:13:32,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:13:32,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:13:32,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:13:32,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:13:32,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:32" (1/1) ... [2019-12-27 06:13:32,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:32" (1/1) ... [2019-12-27 06:13:32,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:32" (1/1) ... [2019-12-27 06:13:32,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:32" (1/1) ... [2019-12-27 06:13:32,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:32" (1/1) ... [2019-12-27 06:13:32,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:32" (1/1) ... [2019-12-27 06:13:32,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:32" (1/1) ... [2019-12-27 06:13:32,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:13:32,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:13:32,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:13:32,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:13:32,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:13:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:13:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:13:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:13:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:13:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:13:32,542 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:13:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:13:32,542 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:13:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:13:32,543 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:13:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:13:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:13:32,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:13:32,545 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:13:33,370 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:13:33,370 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:13:33,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:13:33 BoogieIcfgContainer [2019-12-27 06:13:33,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:13:33,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:13:33,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:13:33,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:13:33,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:13:31" (1/3) ... [2019-12-27 06:13:33,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7383e0e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:13:33, skipping insertion in model container [2019-12-27 06:13:33,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:32" (2/3) ... [2019-12-27 06:13:33,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7383e0e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:13:33, skipping insertion in model container [2019-12-27 06:13:33,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:13:33" (3/3) ... [2019-12-27 06:13:33,381 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_power.oepc.i [2019-12-27 06:13:33,391 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:13:33,392 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:13:33,399 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:13:33,400 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:13:33,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,458 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,458 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,458 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,459 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,459 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,466 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,466 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,473 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,474 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,499 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,500 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,506 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,508 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,522 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,523 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,531 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:33,552 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:13:33,573 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:13:33,573 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:13:33,573 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:13:33,574 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:13:33,574 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:13:33,574 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:13:33,574 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:13:33,574 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:13:33,596 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-27 06:13:33,597 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 06:13:33,716 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 06:13:33,717 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:13:33,733 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:13:33,759 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 06:13:33,812 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 06:13:33,813 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:13:33,821 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:13:33,844 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 06:13:33,845 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:13:37,492 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 06:13:37,629 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 06:13:37,662 INFO L206 etLargeBlockEncoding]: Checked pairs total: 86141 [2019-12-27 06:13:37,662 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 06:13:37,666 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 97 places, 107 transitions [2019-12-27 06:14:01,145 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 132752 states. [2019-12-27 06:14:01,147 INFO L276 IsEmpty]: Start isEmpty. Operand 132752 states. [2019-12-27 06:14:01,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:14:01,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:14:01,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:14:01,154 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:14:01,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:14:01,159 INFO L82 PathProgramCache]: Analyzing trace with hash 920980, now seen corresponding path program 1 times [2019-12-27 06:14:01,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:14:01,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366026322] [2019-12-27 06:14:01,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:14:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:14:01,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:14:01,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366026322] [2019-12-27 06:14:01,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:14:01,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:14:01,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205409351] [2019-12-27 06:14:01,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:14:01,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:14:01,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:14:01,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:14:01,366 INFO L87 Difference]: Start difference. First operand 132752 states. Second operand 3 states. [2019-12-27 06:14:05,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:14:05,181 INFO L93 Difference]: Finished difference Result 131526 states and 562532 transitions. [2019-12-27 06:14:05,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:14:05,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:14:05,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:14:05,925 INFO L225 Difference]: With dead ends: 131526 [2019-12-27 06:14:05,926 INFO L226 Difference]: Without dead ends: 123882 [2019-12-27 06:14:05,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:14:14,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123882 states. [2019-12-27 06:14:16,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123882 to 123882. [2019-12-27 06:14:16,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123882 states. [2019-12-27 06:14:20,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123882 states to 123882 states and 529184 transitions. [2019-12-27 06:14:20,845 INFO L78 Accepts]: Start accepts. Automaton has 123882 states and 529184 transitions. Word has length 3 [2019-12-27 06:14:20,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:14:20,845 INFO L462 AbstractCegarLoop]: Abstraction has 123882 states and 529184 transitions. [2019-12-27 06:14:20,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:14:20,845 INFO L276 IsEmpty]: Start isEmpty. Operand 123882 states and 529184 transitions. [2019-12-27 06:14:20,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:14:20,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:14:20,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:14:20,850 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:14:20,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:14:20,851 INFO L82 PathProgramCache]: Analyzing trace with hash 710493958, now seen corresponding path program 1 times [2019-12-27 06:14:20,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:14:20,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206314508] [2019-12-27 06:14:20,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:14:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:14:20,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:14:20,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206314508] [2019-12-27 06:14:20,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:14:20,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:14:20,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245338594] [2019-12-27 06:14:20,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:14:20,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:14:20,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:14:20,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:14:20,987 INFO L87 Difference]: Start difference. First operand 123882 states and 529184 transitions. Second operand 4 states. [2019-12-27 06:14:23,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:14:23,164 INFO L93 Difference]: Finished difference Result 192368 states and 789500 transitions. [2019-12-27 06:14:23,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:14:23,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:14:23,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:14:23,842 INFO L225 Difference]: With dead ends: 192368 [2019-12-27 06:14:23,842 INFO L226 Difference]: Without dead ends: 192319 [2019-12-27 06:14:23,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:14:35,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192319 states. [2019-12-27 06:14:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192319 to 176439. [2019-12-27 06:14:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176439 states. [2019-12-27 06:14:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176439 states to 176439 states and 733020 transitions. [2019-12-27 06:14:39,985 INFO L78 Accepts]: Start accepts. Automaton has 176439 states and 733020 transitions. Word has length 11 [2019-12-27 06:14:39,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:14:39,985 INFO L462 AbstractCegarLoop]: Abstraction has 176439 states and 733020 transitions. [2019-12-27 06:14:39,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:14:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 176439 states and 733020 transitions. [2019-12-27 06:14:39,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:14:39,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:14:39,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:14:39,992 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:14:39,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:14:39,992 INFO L82 PathProgramCache]: Analyzing trace with hash 379802942, now seen corresponding path program 1 times [2019-12-27 06:14:39,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:14:39,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774173084] [2019-12-27 06:14:39,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:14:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:14:40,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:14:40,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774173084] [2019-12-27 06:14:40,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:14:40,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:14:40,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673732801] [2019-12-27 06:14:40,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:14:40,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:14:40,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:14:40,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:14:40,070 INFO L87 Difference]: Start difference. First operand 176439 states and 733020 transitions. Second operand 3 states. [2019-12-27 06:14:40,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:14:40,214 INFO L93 Difference]: Finished difference Result 37131 states and 120949 transitions. [2019-12-27 06:14:40,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:14:40,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:14:40,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:14:40,316 INFO L225 Difference]: With dead ends: 37131 [2019-12-27 06:14:40,317 INFO L226 Difference]: Without dead ends: 37131 [2019-12-27 06:14:40,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:14:45,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37131 states. [2019-12-27 06:14:46,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37131 to 37131. [2019-12-27 06:14:46,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37131 states. [2019-12-27 06:14:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37131 states to 37131 states and 120949 transitions. [2019-12-27 06:14:46,320 INFO L78 Accepts]: Start accepts. Automaton has 37131 states and 120949 transitions. Word has length 13 [2019-12-27 06:14:46,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:14:46,321 INFO L462 AbstractCegarLoop]: Abstraction has 37131 states and 120949 transitions. [2019-12-27 06:14:46,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:14:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 37131 states and 120949 transitions. [2019-12-27 06:14:46,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:14:46,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:14:46,324 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:14:46,324 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:14:46,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:14:46,324 INFO L82 PathProgramCache]: Analyzing trace with hash 63930122, now seen corresponding path program 1 times [2019-12-27 06:14:46,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:14:46,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734801940] [2019-12-27 06:14:46,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:14:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:14:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:14:46,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734801940] [2019-12-27 06:14:46,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:14:46,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:14:46,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768939135] [2019-12-27 06:14:46,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:14:46,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:14:46,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:14:46,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:14:46,438 INFO L87 Difference]: Start difference. First operand 37131 states and 120949 transitions. Second operand 5 states. [2019-12-27 06:14:47,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:14:47,034 INFO L93 Difference]: Finished difference Result 51130 states and 164640 transitions. [2019-12-27 06:14:47,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:14:47,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 06:14:47,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:14:47,136 INFO L225 Difference]: With dead ends: 51130 [2019-12-27 06:14:47,137 INFO L226 Difference]: Without dead ends: 51130 [2019-12-27 06:14:47,137 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-27 06:14:47,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51130 states. [2019-12-27 06:14:48,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51130 to 43859. [2019-12-27 06:14:48,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43859 states. [2019-12-27 06:14:48,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43859 states to 43859 states and 142404 transitions. [2019-12-27 06:14:48,369 INFO L78 Accepts]: Start accepts. Automaton has 43859 states and 142404 transitions. Word has length 16 [2019-12-27 06:14:48,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:14:48,370 INFO L462 AbstractCegarLoop]: Abstraction has 43859 states and 142404 transitions. [2019-12-27 06:14:48,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:14:48,370 INFO L276 IsEmpty]: Start isEmpty. Operand 43859 states and 142404 transitions. [2019-12-27 06:14:48,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:14:48,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:14:48,381 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:14:48,382 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:14:48,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:14:48,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1543064485, now seen corresponding path program 1 times [2019-12-27 06:14:48,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:14:48,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071575127] [2019-12-27 06:14:48,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:14:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:14:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:14:48,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071575127] [2019-12-27 06:14:48,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:14:48,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:14:48,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798761742] [2019-12-27 06:14:48,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:14:48,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:14:48,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:14:48,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:14:48,583 INFO L87 Difference]: Start difference. First operand 43859 states and 142404 transitions. Second operand 6 states. [2019-12-27 06:14:49,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:14:49,557 INFO L93 Difference]: Finished difference Result 65194 states and 206492 transitions. [2019-12-27 06:14:49,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:14:49,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 06:14:49,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:14:49,667 INFO L225 Difference]: With dead ends: 65194 [2019-12-27 06:14:49,667 INFO L226 Difference]: Without dead ends: 65187 [2019-12-27 06:14:49,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:14:49,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65187 states. [2019-12-27 06:14:51,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65187 to 43757. [2019-12-27 06:14:51,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43757 states. [2019-12-27 06:14:51,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43757 states to 43757 states and 141300 transitions. [2019-12-27 06:14:51,240 INFO L78 Accepts]: Start accepts. Automaton has 43757 states and 141300 transitions. Word has length 22 [2019-12-27 06:14:51,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:14:51,240 INFO L462 AbstractCegarLoop]: Abstraction has 43757 states and 141300 transitions. [2019-12-27 06:14:51,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:14:51,241 INFO L276 IsEmpty]: Start isEmpty. Operand 43757 states and 141300 transitions. [2019-12-27 06:14:51,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:14:51,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:14:51,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:14:51,257 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:14:51,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:14:51,257 INFO L82 PathProgramCache]: Analyzing trace with hash 970281241, now seen corresponding path program 1 times [2019-12-27 06:14:51,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:14:51,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715877489] [2019-12-27 06:14:51,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:14:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:14:51,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:14:51,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715877489] [2019-12-27 06:14:51,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:14:51,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:14:51,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177289462] [2019-12-27 06:14:51,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:14:51,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:14:51,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:14:51,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:14:51,319 INFO L87 Difference]: Start difference. First operand 43757 states and 141300 transitions. Second operand 4 states. [2019-12-27 06:14:51,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:14:51,406 INFO L93 Difference]: Finished difference Result 17328 states and 52920 transitions. [2019-12-27 06:14:51,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:14:51,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:14:51,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:14:51,433 INFO L225 Difference]: With dead ends: 17328 [2019-12-27 06:14:51,433 INFO L226 Difference]: Without dead ends: 17328 [2019-12-27 06:14:51,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:14:51,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17328 states. [2019-12-27 06:14:51,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17328 to 17035. [2019-12-27 06:14:51,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17035 states. [2019-12-27 06:14:51,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17035 states to 17035 states and 52084 transitions. [2019-12-27 06:14:51,699 INFO L78 Accepts]: Start accepts. Automaton has 17035 states and 52084 transitions. Word has length 25 [2019-12-27 06:14:51,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:14:51,699 INFO L462 AbstractCegarLoop]: Abstraction has 17035 states and 52084 transitions. [2019-12-27 06:14:51,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:14:51,699 INFO L276 IsEmpty]: Start isEmpty. Operand 17035 states and 52084 transitions. [2019-12-27 06:14:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:14:51,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:14:51,713 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-27 06:14:51,713 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:14:51,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:14:51,713 INFO L82 PathProgramCache]: Analyzing trace with hash 847537641, now seen corresponding path program 1 times [2019-12-27 06:14:51,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:14:51,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592185752] [2019-12-27 06:14:51,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:14:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:14:51,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:14:51,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592185752] [2019-12-27 06:14:51,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:14:51,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:14:51,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538160243] [2019-12-27 06:14:51,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:14:51,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:14:51,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:14:51,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:14:51,764 INFO L87 Difference]: Start difference. First operand 17035 states and 52084 transitions. Second operand 3 states. [2019-12-27 06:14:51,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:14:51,866 INFO L93 Difference]: Finished difference Result 24679 states and 73906 transitions. [2019-12-27 06:14:51,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:14:51,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 06:14:51,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:14:51,898 INFO L225 Difference]: With dead ends: 24679 [2019-12-27 06:14:51,898 INFO L226 Difference]: Without dead ends: 24679 [2019-12-27 06:14:51,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:14:51,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24679 states. [2019-12-27 06:14:52,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24679 to 18893. [2019-12-27 06:14:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18893 states. [2019-12-27 06:14:52,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18893 states to 18893 states and 57180 transitions. [2019-12-27 06:14:52,222 INFO L78 Accepts]: Start accepts. Automaton has 18893 states and 57180 transitions. Word has length 27 [2019-12-27 06:14:52,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:14:52,223 INFO L462 AbstractCegarLoop]: Abstraction has 18893 states and 57180 transitions. [2019-12-27 06:14:52,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:14:52,223 INFO L276 IsEmpty]: Start isEmpty. Operand 18893 states and 57180 transitions. [2019-12-27 06:14:52,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:14:52,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:14:52,236 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-27 06:14:52,236 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:14:52,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:14:52,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1249538234, now seen corresponding path program 1 times [2019-12-27 06:14:52,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:14:52,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558049504] [2019-12-27 06:14:52,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:14:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:14:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:14:52,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558049504] [2019-12-27 06:14:52,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:14:52,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:14:52,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953088959] [2019-12-27 06:14:52,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:14:52,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:14:52,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:14:52,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:14:52,388 INFO L87 Difference]: Start difference. First operand 18893 states and 57180 transitions. Second operand 8 states. [2019-12-27 06:14:53,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:14:53,260 INFO L93 Difference]: Finished difference Result 24657 states and 73330 transitions. [2019-12-27 06:14:53,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:14:53,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 06:14:53,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:14:53,293 INFO L225 Difference]: With dead ends: 24657 [2019-12-27 06:14:53,294 INFO L226 Difference]: Without dead ends: 24657 [2019-12-27 06:14:53,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:14:53,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24657 states. [2019-12-27 06:14:53,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24657 to 21635. [2019-12-27 06:14:53,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21635 states. [2019-12-27 06:14:53,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21635 states to 21635 states and 65084 transitions. [2019-12-27 06:14:53,948 INFO L78 Accepts]: Start accepts. Automaton has 21635 states and 65084 transitions. Word has length 27 [2019-12-27 06:14:53,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:14:53,948 INFO L462 AbstractCegarLoop]: Abstraction has 21635 states and 65084 transitions. [2019-12-27 06:14:53,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:14:53,948 INFO L276 IsEmpty]: Start isEmpty. Operand 21635 states and 65084 transitions. [2019-12-27 06:14:53,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:14:53,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:14:53,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:14:53,971 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:14:53,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:14:53,972 INFO L82 PathProgramCache]: Analyzing trace with hash 303260619, now seen corresponding path program 1 times [2019-12-27 06:14:53,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:14:53,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908467470] [2019-12-27 06:14:53,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:14:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:14:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:14:54,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908467470] [2019-12-27 06:14:54,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:14:54,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:14:54,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779675737] [2019-12-27 06:14:54,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:14:54,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:14:54,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:14:54,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:14:54,118 INFO L87 Difference]: Start difference. First operand 21635 states and 65084 transitions. Second operand 7 states. [2019-12-27 06:14:55,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:14:55,415 INFO L93 Difference]: Finished difference Result 29098 states and 85533 transitions. [2019-12-27 06:14:55,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:14:55,415 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 06:14:55,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:14:55,455 INFO L225 Difference]: With dead ends: 29098 [2019-12-27 06:14:55,455 INFO L226 Difference]: Without dead ends: 29098 [2019-12-27 06:14:55,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:14:55,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29098 states. [2019-12-27 06:14:55,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29098 to 19796. [2019-12-27 06:14:55,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19796 states. [2019-12-27 06:14:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19796 states to 19796 states and 59787 transitions. [2019-12-27 06:14:55,831 INFO L78 Accepts]: Start accepts. Automaton has 19796 states and 59787 transitions. Word has length 33 [2019-12-27 06:14:55,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:14:55,831 INFO L462 AbstractCegarLoop]: Abstraction has 19796 states and 59787 transitions. [2019-12-27 06:14:55,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:14:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 19796 states and 59787 transitions. [2019-12-27 06:14:55,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:14:55,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:14:55,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:14:55,855 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:14:55,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:14:55,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1014539128, now seen corresponding path program 1 times [2019-12-27 06:14:55,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:14:55,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685684216] [2019-12-27 06:14:55,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:14:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:14:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:14:55,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685684216] [2019-12-27 06:14:55,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:14:55,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:14:55,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223454147] [2019-12-27 06:14:55,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:14:55,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:14:55,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:14:55,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:14:55,927 INFO L87 Difference]: Start difference. First operand 19796 states and 59787 transitions. Second operand 3 states. [2019-12-27 06:14:55,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:14:55,999 INFO L93 Difference]: Finished difference Result 19795 states and 59785 transitions. [2019-12-27 06:14:56,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:14:56,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 06:14:56,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:14:56,034 INFO L225 Difference]: With dead ends: 19795 [2019-12-27 06:14:56,035 INFO L226 Difference]: Without dead ends: 19795 [2019-12-27 06:14:56,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:14:56,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19795 states. [2019-12-27 06:14:56,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19795 to 19795. [2019-12-27 06:14:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19795 states. [2019-12-27 06:14:56,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19795 states to 19795 states and 59785 transitions. [2019-12-27 06:14:56,347 INFO L78 Accepts]: Start accepts. Automaton has 19795 states and 59785 transitions. Word has length 39 [2019-12-27 06:14:56,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:14:56,348 INFO L462 AbstractCegarLoop]: Abstraction has 19795 states and 59785 transitions. [2019-12-27 06:14:56,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:14:56,348 INFO L276 IsEmpty]: Start isEmpty. Operand 19795 states and 59785 transitions. [2019-12-27 06:14:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 06:14:56,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:14:56,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:14:56,370 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:14:56,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:14:56,370 INFO L82 PathProgramCache]: Analyzing trace with hash 756070649, now seen corresponding path program 1 times [2019-12-27 06:14:56,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:14:56,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669100090] [2019-12-27 06:14:56,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:14:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:14:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:14:56,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669100090] [2019-12-27 06:14:56,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:14:56,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:14:56,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726217264] [2019-12-27 06:14:56,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:14:56,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:14:56,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:14:56,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:14:56,428 INFO L87 Difference]: Start difference. First operand 19795 states and 59785 transitions. Second operand 5 states. [2019-12-27 06:14:56,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:14:56,512 INFO L93 Difference]: Finished difference Result 18449 states and 56713 transitions. [2019-12-27 06:14:56,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:14:56,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 06:14:56,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:14:56,543 INFO L225 Difference]: With dead ends: 18449 [2019-12-27 06:14:56,544 INFO L226 Difference]: Without dead ends: 18449 [2019-12-27 06:14:56,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:14:56,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18449 states. [2019-12-27 06:14:56,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18449 to 17868. [2019-12-27 06:14:56,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17868 states. [2019-12-27 06:14:57,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17868 states to 17868 states and 55144 transitions. [2019-12-27 06:14:57,149 INFO L78 Accepts]: Start accepts. Automaton has 17868 states and 55144 transitions. Word has length 40 [2019-12-27 06:14:57,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:14:57,150 INFO L462 AbstractCegarLoop]: Abstraction has 17868 states and 55144 transitions. [2019-12-27 06:14:57,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:14:57,150 INFO L276 IsEmpty]: Start isEmpty. Operand 17868 states and 55144 transitions. [2019-12-27 06:14:57,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:14:57,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:14:57,169 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:14:57,171 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:14:57,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:14:57,171 INFO L82 PathProgramCache]: Analyzing trace with hash 465623346, now seen corresponding path program 1 times [2019-12-27 06:14:57,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:14:57,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289211637] [2019-12-27 06:14:57,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:14:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:14:57,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:14:57,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289211637] [2019-12-27 06:14:57,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:14:57,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:14:57,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900401546] [2019-12-27 06:14:57,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:14:57,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:14:57,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:14:57,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:14:57,236 INFO L87 Difference]: Start difference. First operand 17868 states and 55144 transitions. Second operand 3 states. [2019-12-27 06:14:57,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:14:57,345 INFO L93 Difference]: Finished difference Result 23807 states and 72041 transitions. [2019-12-27 06:14:57,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:14:57,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 06:14:57,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:14:57,373 INFO L225 Difference]: With dead ends: 23807 [2019-12-27 06:14:57,374 INFO L226 Difference]: Without dead ends: 23807 [2019-12-27 06:14:57,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:14:57,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23807 states. [2019-12-27 06:14:57,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23807 to 17426. [2019-12-27 06:14:57,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17426 states. [2019-12-27 06:14:57,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17426 states to 17426 states and 53191 transitions. [2019-12-27 06:14:57,677 INFO L78 Accepts]: Start accepts. Automaton has 17426 states and 53191 transitions. Word has length 64 [2019-12-27 06:14:57,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:14:57,677 INFO L462 AbstractCegarLoop]: Abstraction has 17426 states and 53191 transitions. [2019-12-27 06:14:57,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:14:57,677 INFO L276 IsEmpty]: Start isEmpty. Operand 17426 states and 53191 transitions. [2019-12-27 06:14:57,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:14:57,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:14:57,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] [2019-12-27 06:14:57,700 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:14:57,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:14:57,701 INFO L82 PathProgramCache]: Analyzing trace with hash -693487797, now seen corresponding path program 1 times [2019-12-27 06:14:57,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:14:57,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590049566] [2019-12-27 06:14:57,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:14:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:14:57,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:14:57,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590049566] [2019-12-27 06:14:57,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:14:57,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:14:57,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962851135] [2019-12-27 06:14:57,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:14:57,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:14:57,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:14:57,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:14:57,792 INFO L87 Difference]: Start difference. First operand 17426 states and 53191 transitions. Second operand 7 states. [2019-12-27 06:14:58,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:14:58,279 INFO L93 Difference]: Finished difference Result 48084 states and 145917 transitions. [2019-12-27 06:14:58,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:14:58,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:14:58,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:14:58,333 INFO L225 Difference]: With dead ends: 48084 [2019-12-27 06:14:58,333 INFO L226 Difference]: Without dead ends: 37467 [2019-12-27 06:14:58,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:14:58,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37467 states. [2019-12-27 06:14:58,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37467 to 20749. [2019-12-27 06:14:58,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20749 states. [2019-12-27 06:14:58,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20749 states to 20749 states and 63592 transitions. [2019-12-27 06:14:58,813 INFO L78 Accepts]: Start accepts. Automaton has 20749 states and 63592 transitions. Word has length 64 [2019-12-27 06:14:58,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:14:58,814 INFO L462 AbstractCegarLoop]: Abstraction has 20749 states and 63592 transitions. [2019-12-27 06:14:58,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:14:58,814 INFO L276 IsEmpty]: Start isEmpty. Operand 20749 states and 63592 transitions. [2019-12-27 06:14:58,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:14:58,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:14:58,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:14:58,844 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:14:58,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:14:58,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1789693793, now seen corresponding path program 2 times [2019-12-27 06:14:58,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:14:58,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565447751] [2019-12-27 06:14:58,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:14:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:14:58,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:14:58,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565447751] [2019-12-27 06:14:58,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:14:58,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:14:58,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143880040] [2019-12-27 06:14:58,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:14:58,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:14:58,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:14:58,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:14:58,935 INFO L87 Difference]: Start difference. First operand 20749 states and 63592 transitions. Second operand 7 states. [2019-12-27 06:14:59,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:14:59,483 INFO L93 Difference]: Finished difference Result 56386 states and 169231 transitions. [2019-12-27 06:14:59,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:14:59,483 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:14:59,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:14:59,539 INFO L225 Difference]: With dead ends: 56386 [2019-12-27 06:14:59,539 INFO L226 Difference]: Without dead ends: 41272 [2019-12-27 06:14:59,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:14:59,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41272 states. [2019-12-27 06:15:00,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41272 to 24336. [2019-12-27 06:15:00,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24336 states. [2019-12-27 06:15:00,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24336 states to 24336 states and 74402 transitions. [2019-12-27 06:15:00,415 INFO L78 Accepts]: Start accepts. Automaton has 24336 states and 74402 transitions. Word has length 64 [2019-12-27 06:15:00,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:00,416 INFO L462 AbstractCegarLoop]: Abstraction has 24336 states and 74402 transitions. [2019-12-27 06:15:00,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:15:00,416 INFO L276 IsEmpty]: Start isEmpty. Operand 24336 states and 74402 transitions. [2019-12-27 06:15:00,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:15:00,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:00,446 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:00,446 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:00,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:00,447 INFO L82 PathProgramCache]: Analyzing trace with hash 679233867, now seen corresponding path program 3 times [2019-12-27 06:15:00,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:00,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611250919] [2019-12-27 06:15:00,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:00,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611250919] [2019-12-27 06:15:00,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:00,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:15:00,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904794065] [2019-12-27 06:15:00,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:15:00,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:00,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:15:00,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:15:00,582 INFO L87 Difference]: Start difference. First operand 24336 states and 74402 transitions. Second operand 9 states. [2019-12-27 06:15:01,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:01,960 INFO L93 Difference]: Finished difference Result 73251 states and 220222 transitions. [2019-12-27 06:15:01,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 06:15:01,965 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 06:15:01,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:02,077 INFO L225 Difference]: With dead ends: 73251 [2019-12-27 06:15:02,077 INFO L226 Difference]: Without dead ends: 70628 [2019-12-27 06:15:02,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-27 06:15:02,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70628 states. [2019-12-27 06:15:02,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70628 to 24492. [2019-12-27 06:15:02,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24492 states. [2019-12-27 06:15:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24492 states to 24492 states and 75064 transitions. [2019-12-27 06:15:02,821 INFO L78 Accepts]: Start accepts. Automaton has 24492 states and 75064 transitions. Word has length 64 [2019-12-27 06:15:02,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:02,821 INFO L462 AbstractCegarLoop]: Abstraction has 24492 states and 75064 transitions. [2019-12-27 06:15:02,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:15:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 24492 states and 75064 transitions. [2019-12-27 06:15:02,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:15:02,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:02,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:02,846 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:02,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:02,847 INFO L82 PathProgramCache]: Analyzing trace with hash 539911759, now seen corresponding path program 4 times [2019-12-27 06:15:02,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:02,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014794826] [2019-12-27 06:15:02,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:02,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:02,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014794826] [2019-12-27 06:15:02,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:02,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:15:02,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666903269] [2019-12-27 06:15:02,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:15:02,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:02,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:15:02,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:15:02,955 INFO L87 Difference]: Start difference. First operand 24492 states and 75064 transitions. Second operand 9 states. [2019-12-27 06:15:03,949 WARN L192 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-12-27 06:15:04,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:04,707 INFO L93 Difference]: Finished difference Result 82759 states and 249081 transitions. [2019-12-27 06:15:04,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 06:15:04,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 06:15:04,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:04,838 INFO L225 Difference]: With dead ends: 82759 [2019-12-27 06:15:04,838 INFO L226 Difference]: Without dead ends: 80200 [2019-12-27 06:15:04,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:15:05,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80200 states. [2019-12-27 06:15:05,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80200 to 24529. [2019-12-27 06:15:05,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24529 states. [2019-12-27 06:15:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24529 states to 24529 states and 75262 transitions. [2019-12-27 06:15:05,681 INFO L78 Accepts]: Start accepts. Automaton has 24529 states and 75262 transitions. Word has length 64 [2019-12-27 06:15:05,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:05,681 INFO L462 AbstractCegarLoop]: Abstraction has 24529 states and 75262 transitions. [2019-12-27 06:15:05,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:15:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand 24529 states and 75262 transitions. [2019-12-27 06:15:05,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:15:05,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:05,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:05,711 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:05,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:05,711 INFO L82 PathProgramCache]: Analyzing trace with hash -101721945, now seen corresponding path program 5 times [2019-12-27 06:15:05,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:05,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329756488] [2019-12-27 06:15:05,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:05,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:05,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329756488] [2019-12-27 06:15:05,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:05,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:15:05,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875557384] [2019-12-27 06:15:05,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:05,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:05,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:05,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:05,781 INFO L87 Difference]: Start difference. First operand 24529 states and 75262 transitions. Second operand 3 states. [2019-12-27 06:15:05,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:05,945 INFO L93 Difference]: Finished difference Result 28844 states and 88337 transitions. [2019-12-27 06:15:05,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:05,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 06:15:05,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:05,987 INFO L225 Difference]: With dead ends: 28844 [2019-12-27 06:15:05,987 INFO L226 Difference]: Without dead ends: 28844 [2019-12-27 06:15:05,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:06,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28844 states. [2019-12-27 06:15:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28844 to 25486. [2019-12-27 06:15:06,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25486 states. [2019-12-27 06:15:06,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25486 states to 25486 states and 78425 transitions. [2019-12-27 06:15:06,443 INFO L78 Accepts]: Start accepts. Automaton has 25486 states and 78425 transitions. Word has length 64 [2019-12-27 06:15:06,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:06,443 INFO L462 AbstractCegarLoop]: Abstraction has 25486 states and 78425 transitions. [2019-12-27 06:15:06,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:06,443 INFO L276 IsEmpty]: Start isEmpty. Operand 25486 states and 78425 transitions. [2019-12-27 06:15:06,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:15:06,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:06,472 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:06,472 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:06,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:06,472 INFO L82 PathProgramCache]: Analyzing trace with hash -255354465, now seen corresponding path program 1 times [2019-12-27 06:15:06,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:06,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779901404] [2019-12-27 06:15:06,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:06,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779901404] [2019-12-27 06:15:06,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:06,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:15:06,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044549265] [2019-12-27 06:15:06,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:06,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:06,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:06,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:06,516 INFO L87 Difference]: Start difference. First operand 25486 states and 78425 transitions. Second operand 3 states. [2019-12-27 06:15:07,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:07,024 INFO L93 Difference]: Finished difference Result 35862 states and 111079 transitions. [2019-12-27 06:15:07,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:07,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:15:07,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:07,073 INFO L225 Difference]: With dead ends: 35862 [2019-12-27 06:15:07,074 INFO L226 Difference]: Without dead ends: 35862 [2019-12-27 06:15:07,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:07,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35862 states. [2019-12-27 06:15:07,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35862 to 26322. [2019-12-27 06:15:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26322 states. [2019-12-27 06:15:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26322 states to 26322 states and 81010 transitions. [2019-12-27 06:15:07,541 INFO L78 Accepts]: Start accepts. Automaton has 26322 states and 81010 transitions. Word has length 65 [2019-12-27 06:15:07,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:07,541 INFO L462 AbstractCegarLoop]: Abstraction has 26322 states and 81010 transitions. [2019-12-27 06:15:07,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand 26322 states and 81010 transitions. [2019-12-27 06:15:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:15:07,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:07,569 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:07,569 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:07,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:07,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1966497405, now seen corresponding path program 2 times [2019-12-27 06:15:07,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:07,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170136402] [2019-12-27 06:15:07,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:07,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:07,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170136402] [2019-12-27 06:15:07,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:07,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:15:07,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279377685] [2019-12-27 06:15:07,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:15:07,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:07,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:15:07,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:15:07,671 INFO L87 Difference]: Start difference. First operand 26322 states and 81010 transitions. Second operand 8 states. [2019-12-27 06:15:08,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:08,726 INFO L93 Difference]: Finished difference Result 66649 states and 201649 transitions. [2019-12-27 06:15:08,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:15:08,727 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 06:15:08,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:08,808 INFO L225 Difference]: With dead ends: 66649 [2019-12-27 06:15:08,809 INFO L226 Difference]: Without dead ends: 63016 [2019-12-27 06:15:08,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-27 06:15:08,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63016 states. [2019-12-27 06:15:09,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63016 to 26412. [2019-12-27 06:15:09,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26412 states. [2019-12-27 06:15:09,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26412 states to 26412 states and 81379 transitions. [2019-12-27 06:15:09,499 INFO L78 Accepts]: Start accepts. Automaton has 26412 states and 81379 transitions. Word has length 65 [2019-12-27 06:15:09,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:09,499 INFO L462 AbstractCegarLoop]: Abstraction has 26412 states and 81379 transitions. [2019-12-27 06:15:09,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:15:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 26412 states and 81379 transitions. [2019-12-27 06:15:09,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:15:09,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:09,528 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:09,529 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:09,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:09,529 INFO L82 PathProgramCache]: Analyzing trace with hash 765140549, now seen corresponding path program 3 times [2019-12-27 06:15:09,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:09,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340096268] [2019-12-27 06:15:09,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:09,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:09,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340096268] [2019-12-27 06:15:09,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:09,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:15:09,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817470399] [2019-12-27 06:15:09,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:15:09,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:09,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:15:09,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:15:09,642 INFO L87 Difference]: Start difference. First operand 26412 states and 81379 transitions. Second operand 9 states. [2019-12-27 06:15:11,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:11,351 INFO L93 Difference]: Finished difference Result 74722 states and 224033 transitions. [2019-12-27 06:15:11,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 06:15:11,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 06:15:11,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:11,445 INFO L225 Difference]: With dead ends: 74722 [2019-12-27 06:15:11,445 INFO L226 Difference]: Without dead ends: 71089 [2019-12-27 06:15:11,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:15:11,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71089 states. [2019-12-27 06:15:12,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71089 to 26420. [2019-12-27 06:15:12,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26420 states. [2019-12-27 06:15:12,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26420 states to 26420 states and 81394 transitions. [2019-12-27 06:15:12,243 INFO L78 Accepts]: Start accepts. Automaton has 26420 states and 81394 transitions. Word has length 65 [2019-12-27 06:15:12,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:12,244 INFO L462 AbstractCegarLoop]: Abstraction has 26420 states and 81394 transitions. [2019-12-27 06:15:12,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:15:12,244 INFO L276 IsEmpty]: Start isEmpty. Operand 26420 states and 81394 transitions. [2019-12-27 06:15:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:15:12,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:12,273 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:12,273 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:12,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:12,273 INFO L82 PathProgramCache]: Analyzing trace with hash 2002809857, now seen corresponding path program 4 times [2019-12-27 06:15:12,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:12,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019246197] [2019-12-27 06:15:12,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:12,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019246197] [2019-12-27 06:15:12,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:12,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:15:12,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550423360] [2019-12-27 06:15:12,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:15:12,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:12,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:15:12,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:15:12,399 INFO L87 Difference]: Start difference. First operand 26420 states and 81394 transitions. Second operand 9 states. [2019-12-27 06:15:13,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:13,727 INFO L93 Difference]: Finished difference Result 81638 states and 244427 transitions. [2019-12-27 06:15:13,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 06:15:13,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 06:15:13,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:13,826 INFO L225 Difference]: With dead ends: 81638 [2019-12-27 06:15:13,827 INFO L226 Difference]: Without dead ends: 78036 [2019-12-27 06:15:13,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:15:14,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78036 states. [2019-12-27 06:15:14,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78036 to 26315. [2019-12-27 06:15:14,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26315 states. [2019-12-27 06:15:15,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26315 states to 26315 states and 80875 transitions. [2019-12-27 06:15:15,035 INFO L78 Accepts]: Start accepts. Automaton has 26315 states and 80875 transitions. Word has length 65 [2019-12-27 06:15:15,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:15,036 INFO L462 AbstractCegarLoop]: Abstraction has 26315 states and 80875 transitions. [2019-12-27 06:15:15,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:15:15,036 INFO L276 IsEmpty]: Start isEmpty. Operand 26315 states and 80875 transitions. [2019-12-27 06:15:15,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:15:15,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:15,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:15,067 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:15,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:15,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1618555097, now seen corresponding path program 5 times [2019-12-27 06:15:15,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:15,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738754813] [2019-12-27 06:15:15,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:15,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:15,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738754813] [2019-12-27 06:15:15,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:15,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:15:15,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878843295] [2019-12-27 06:15:15,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:15:15,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:15,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:15:15,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:15:15,235 INFO L87 Difference]: Start difference. First operand 26315 states and 80875 transitions. Second operand 8 states. [2019-12-27 06:15:16,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:16,016 INFO L93 Difference]: Finished difference Result 42815 states and 131817 transitions. [2019-12-27 06:15:16,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:15:16,016 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 06:15:16,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:16,076 INFO L225 Difference]: With dead ends: 42815 [2019-12-27 06:15:16,076 INFO L226 Difference]: Without dead ends: 42815 [2019-12-27 06:15:16,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:15:16,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42815 states. [2019-12-27 06:15:16,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42815 to 29193. [2019-12-27 06:15:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29193 states. [2019-12-27 06:15:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29193 states to 29193 states and 90198 transitions. [2019-12-27 06:15:16,648 INFO L78 Accepts]: Start accepts. Automaton has 29193 states and 90198 transitions. Word has length 65 [2019-12-27 06:15:16,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:16,648 INFO L462 AbstractCegarLoop]: Abstraction has 29193 states and 90198 transitions. [2019-12-27 06:15:16,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:15:16,648 INFO L276 IsEmpty]: Start isEmpty. Operand 29193 states and 90198 transitions. [2019-12-27 06:15:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:15:16,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:16,680 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:16,680 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:16,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:16,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1430272868, now seen corresponding path program 1 times [2019-12-27 06:15:16,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:16,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874645647] [2019-12-27 06:15:16,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:16,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:16,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874645647] [2019-12-27 06:15:16,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:16,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:15:16,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192142089] [2019-12-27 06:15:16,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:16,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:16,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:16,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:16,729 INFO L87 Difference]: Start difference. First operand 29193 states and 90198 transitions. Second operand 3 states. [2019-12-27 06:15:16,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:16,836 INFO L93 Difference]: Finished difference Result 24401 states and 74117 transitions. [2019-12-27 06:15:16,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:16,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:15:16,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:16,870 INFO L225 Difference]: With dead ends: 24401 [2019-12-27 06:15:16,870 INFO L226 Difference]: Without dead ends: 24401 [2019-12-27 06:15:16,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:16,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24401 states. [2019-12-27 06:15:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24401 to 23087. [2019-12-27 06:15:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23087 states. [2019-12-27 06:15:17,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23087 states to 23087 states and 69985 transitions. [2019-12-27 06:15:17,241 INFO L78 Accepts]: Start accepts. Automaton has 23087 states and 69985 transitions. Word has length 65 [2019-12-27 06:15:17,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:17,241 INFO L462 AbstractCegarLoop]: Abstraction has 23087 states and 69985 transitions. [2019-12-27 06:15:17,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:17,241 INFO L276 IsEmpty]: Start isEmpty. Operand 23087 states and 69985 transitions. [2019-12-27 06:15:17,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:15:17,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:17,268 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:17,268 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:17,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:17,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1219517666, now seen corresponding path program 1 times [2019-12-27 06:15:17,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:17,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665239042] [2019-12-27 06:15:17,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:17,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:17,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665239042] [2019-12-27 06:15:17,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:17,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 06:15:17,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544037059] [2019-12-27 06:15:17,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:15:17,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:17,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:15:17,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:15:17,459 INFO L87 Difference]: Start difference. First operand 23087 states and 69985 transitions. Second operand 10 states. [2019-12-27 06:15:19,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:19,787 INFO L93 Difference]: Finished difference Result 48222 states and 147637 transitions. [2019-12-27 06:15:19,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 06:15:19,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 06:15:19,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:19,859 INFO L225 Difference]: With dead ends: 48222 [2019-12-27 06:15:19,859 INFO L226 Difference]: Without dead ends: 48222 [2019-12-27 06:15:19,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2019-12-27 06:15:20,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48222 states. [2019-12-27 06:15:20,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48222 to 24122. [2019-12-27 06:15:20,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24122 states. [2019-12-27 06:15:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24122 states to 24122 states and 73565 transitions. [2019-12-27 06:15:20,447 INFO L78 Accepts]: Start accepts. Automaton has 24122 states and 73565 transitions. Word has length 66 [2019-12-27 06:15:20,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:20,447 INFO L462 AbstractCegarLoop]: Abstraction has 24122 states and 73565 transitions. [2019-12-27 06:15:20,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:15:20,447 INFO L276 IsEmpty]: Start isEmpty. Operand 24122 states and 73565 transitions. [2019-12-27 06:15:20,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:15:20,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:20,472 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:20,473 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:20,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:20,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1614859221, now seen corresponding path program 1 times [2019-12-27 06:15:20,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:20,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869702211] [2019-12-27 06:15:20,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:20,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:20,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869702211] [2019-12-27 06:15:20,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:20,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:15:20,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934011615] [2019-12-27 06:15:20,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:15:20,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:20,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:15:20,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:15:20,633 INFO L87 Difference]: Start difference. First operand 24122 states and 73565 transitions. Second operand 11 states. [2019-12-27 06:15:21,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:21,800 INFO L93 Difference]: Finished difference Result 55018 states and 166424 transitions. [2019-12-27 06:15:21,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 06:15:21,801 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 06:15:21,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:21,856 INFO L225 Difference]: With dead ends: 55018 [2019-12-27 06:15:21,856 INFO L226 Difference]: Without dead ends: 42799 [2019-12-27 06:15:21,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=912, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 06:15:21,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42799 states. [2019-12-27 06:15:22,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42799 to 23322. [2019-12-27 06:15:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23322 states. [2019-12-27 06:15:22,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23322 states to 23322 states and 70768 transitions. [2019-12-27 06:15:22,360 INFO L78 Accepts]: Start accepts. Automaton has 23322 states and 70768 transitions. Word has length 66 [2019-12-27 06:15:22,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:22,361 INFO L462 AbstractCegarLoop]: Abstraction has 23322 states and 70768 transitions. [2019-12-27 06:15:22,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:15:22,361 INFO L276 IsEmpty]: Start isEmpty. Operand 23322 states and 70768 transitions. [2019-12-27 06:15:22,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:15:22,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:22,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:22,385 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:22,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:22,385 INFO L82 PathProgramCache]: Analyzing trace with hash 136153959, now seen corresponding path program 2 times [2019-12-27 06:15:22,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:22,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274626094] [2019-12-27 06:15:22,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:22,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274626094] [2019-12-27 06:15:22,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:22,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:15:22,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040499901] [2019-12-27 06:15:22,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 06:15:22,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:22,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 06:15:22,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:15:22,811 INFO L87 Difference]: Start difference. First operand 23322 states and 70768 transitions. Second operand 13 states. [2019-12-27 06:15:29,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:29,273 INFO L93 Difference]: Finished difference Result 48947 states and 144601 transitions. [2019-12-27 06:15:29,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-27 06:15:29,273 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-27 06:15:29,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:29,337 INFO L225 Difference]: With dead ends: 48947 [2019-12-27 06:15:29,337 INFO L226 Difference]: Without dead ends: 48727 [2019-12-27 06:15:29,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=700, Invalid=3206, Unknown=0, NotChecked=0, Total=3906 [2019-12-27 06:15:29,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48727 states. [2019-12-27 06:15:29,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48727 to 29975. [2019-12-27 06:15:29,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29975 states. [2019-12-27 06:15:29,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29975 states to 29975 states and 89959 transitions. [2019-12-27 06:15:29,970 INFO L78 Accepts]: Start accepts. Automaton has 29975 states and 89959 transitions. Word has length 66 [2019-12-27 06:15:29,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:29,970 INFO L462 AbstractCegarLoop]: Abstraction has 29975 states and 89959 transitions. [2019-12-27 06:15:29,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 06:15:29,971 INFO L276 IsEmpty]: Start isEmpty. Operand 29975 states and 89959 transitions. [2019-12-27 06:15:30,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:15:30,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:30,001 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:30,001 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:30,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:30,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1510390231, now seen corresponding path program 3 times [2019-12-27 06:15:30,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:30,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169705755] [2019-12-27 06:15:30,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:30,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169705755] [2019-12-27 06:15:30,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:30,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:15:30,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106344733] [2019-12-27 06:15:30,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:30,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:30,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:30,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:30,059 INFO L87 Difference]: Start difference. First operand 29975 states and 89959 transitions. Second operand 3 states. [2019-12-27 06:15:30,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:30,151 INFO L93 Difference]: Finished difference Result 29974 states and 89957 transitions. [2019-12-27 06:15:30,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:30,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 06:15:30,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:30,192 INFO L225 Difference]: With dead ends: 29974 [2019-12-27 06:15:30,192 INFO L226 Difference]: Without dead ends: 29974 [2019-12-27 06:15:30,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:30,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29974 states. [2019-12-27 06:15:30,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29974 to 23894. [2019-12-27 06:15:30,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23894 states. [2019-12-27 06:15:31,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23894 states to 23894 states and 72679 transitions. [2019-12-27 06:15:31,042 INFO L78 Accepts]: Start accepts. Automaton has 23894 states and 72679 transitions. Word has length 66 [2019-12-27 06:15:31,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:31,042 INFO L462 AbstractCegarLoop]: Abstraction has 23894 states and 72679 transitions. [2019-12-27 06:15:31,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:31,043 INFO L276 IsEmpty]: Start isEmpty. Operand 23894 states and 72679 transitions. [2019-12-27 06:15:31,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:15:31,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:31,068 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-27 06:15:31,068 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:31,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:31,068 INFO L82 PathProgramCache]: Analyzing trace with hash 827602940, now seen corresponding path program 1 times [2019-12-27 06:15:31,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:31,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18712358] [2019-12-27 06:15:31,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:15:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:15:31,223 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:15:31,223 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:15:31,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [902] [902] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t849~0.base_21|) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~main$tmp_guard1~0_16 0) (= v_~b$flush_delayed~0_13 0) (= v_~__unbuffered_p1_EBX~0_14 0) (= 0 v_~a~0_8) (= v_~b$r_buff1_thd1~0_19 0) (= 0 v_~b$r_buff0_thd0~0_21) (= v_~b$r_buff1_thd2~0_18 0) (= 0 v_~b$read_delayed~0_7) (= 0 v_~__unbuffered_cnt~0_21) (= 0 v_~y~0_7) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~b$r_buff0_thd1~0_29) (= v_~x~0_10 0) (= 0 v_~b$w_buff0~0_24) (= 0 v_~z~0_7) (= v_~b$r_buff1_thd0~0_24 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t849~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t849~0.base_21|) |v_ULTIMATE.start_main_~#t849~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~b$r_buff0_thd3~0_76) (= v_~b$read_delayed_var~0.offset_7 0) (= 0 v_~b$r_buff0_thd2~0_21) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~__unbuffered_p2_EBX~0_15 0) (= v_~b$mem_tmp~0_10 0) (= v_~b$r_buff1_thd3~0_49 0) (= 0 v_~__unbuffered_p0_EAX~0_17) (= 0 v_~__unbuffered_p2_EAX~0_12) (= (select .cse0 |v_ULTIMATE.start_main_~#t849~0.base_21|) 0) (= 0 v_~b$w_buff1_used~0_68) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t849~0.base_21| 1)) (= 0 v_~b$w_buff1~0_23) (= 0 |v_ULTIMATE.start_main_~#t849~0.offset_17|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t849~0.base_21| 4)) (= |v_#NULL.offset_4| 0) (= v_~b~0_28 0) (= 0 v_~b$w_buff0_used~0_110) (= 0 v_~b$read_delayed_var~0.base_7))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_76, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_19, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, 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|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_110, ~a~0=v_~a~0_8, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ULTIMATE.start_main_~#t849~0.base=|v_ULTIMATE.start_main_~#t849~0.base_21|, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_21, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_21, ~b$mem_tmp~0=v_~b$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ~b$flush_delayed~0=v_~b$flush_delayed~0_13, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ULTIMATE.start_main_~#t850~0.offset=|v_ULTIMATE.start_main_~#t850~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_29, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ULTIMATE.start_main_~#t850~0.base=|v_ULTIMATE.start_main_~#t850~0.base_21|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_68, ULTIMATE.start_main_~#t849~0.offset=|v_ULTIMATE.start_main_~#t849~0.offset_17|, ~y~0=v_~y~0_7, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_18, ULTIMATE.start_main_~#t851~0.offset=|v_ULTIMATE.start_main_~#t851~0.offset_17|, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_14, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ~b~0=v_~b~0_28, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t851~0.base=|v_ULTIMATE.start_main_~#t851~0.base_21|, ~z~0=v_~z~0_7, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_49} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t849~0.base, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ULTIMATE.start_main_~#t850~0.offset, ~weak$$choice0~0, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t850~0.base, ~b$w_buff1_used~0, ULTIMATE.start_main_~#t849~0.offset, ~y~0, ~b$r_buff1_thd2~0, ULTIMATE.start_main_~#t851~0.offset, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t851~0.base, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 06:15:31,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L754: Formula: (and (= ~b$r_buff0_thd2~0_In867201943 ~b$r_buff1_thd2~0_Out867201943) (= ~b$r_buff1_thd1~0_Out867201943 ~b$r_buff0_thd1~0_In867201943) (= 1 ~b$r_buff0_thd1~0_Out867201943) (= ~b$r_buff1_thd3~0_Out867201943 ~b$r_buff0_thd3~0_In867201943) (not (= 0 P0Thread1of1ForFork2___VERIFIER_assert_~expression_In867201943)) (= ~b$r_buff1_thd0~0_Out867201943 ~b$r_buff0_thd0~0_In867201943) (= ~__unbuffered_p0_EAX~0_Out867201943 ~x~0_In867201943)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In867201943, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In867201943, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In867201943, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In867201943, ~x~0=~x~0_In867201943, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In867201943} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out867201943, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In867201943, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out867201943, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In867201943, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out867201943, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out867201943, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In867201943, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out867201943, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out867201943, ~x~0=~x~0_In867201943, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In867201943} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 06:15:31,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L842-1-->L844: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t850~0.base_10| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t850~0.base_10|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t850~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t850~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t850~0.base_10|) |v_ULTIMATE.start_main_~#t850~0.offset_9| 1)) |v_#memory_int_11|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t850~0.base_10|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t850~0.base_10|) (= |v_ULTIMATE.start_main_~#t850~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t850~0.base=|v_ULTIMATE.start_main_~#t850~0.base_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t850~0.offset=|v_ULTIMATE.start_main_~#t850~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t850~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t850~0.offset] because there is no mapped edge [2019-12-27 06:15:31,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse0 (= (mod ~b$w_buff1_used~0_In-1849104733 256) 0)) (.cse1 (= (mod ~b$r_buff1_thd2~0_In-1849104733 256) 0))) (or (and (= ~b~0_In-1849104733 |P1Thread1of1ForFork0_#t~ite9_Out-1849104733|) (or .cse0 .cse1)) (and (= ~b$w_buff1~0_In-1849104733 |P1Thread1of1ForFork0_#t~ite9_Out-1849104733|) (not .cse0) (not .cse1)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-1849104733, ~b~0=~b~0_In-1849104733, ~b$w_buff1~0=~b$w_buff1~0_In-1849104733, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1849104733} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In-1849104733, ~b~0=~b~0_In-1849104733, ~b$w_buff1~0=~b$w_buff1~0_In-1849104733, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out-1849104733|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1849104733} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 06:15:31,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_23 |v_P1Thread1of1ForFork0_#t~ite9_8|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_8|} OutVars{~b~0=v_~b~0_23, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_7|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_7|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 06:15:31,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-229369527 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd2~0_In-229369527 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite11_Out-229369527|)) (and (= |P1Thread1of1ForFork0_#t~ite11_Out-229369527| ~b$w_buff0_used~0_In-229369527) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-229369527, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-229369527} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-229369527, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-229369527, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-229369527|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 06:15:31,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse2 (= (mod ~b$r_buff1_thd2~0_In-1058675588 256) 0)) (.cse3 (= (mod ~b$w_buff1_used~0_In-1058675588 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In-1058675588 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd2~0_In-1058675588 256) 0))) (or (and (or .cse0 .cse1) (= ~b$w_buff1_used~0_In-1058675588 |P1Thread1of1ForFork0_#t~ite12_Out-1058675588|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork0_#t~ite12_Out-1058675588|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1058675588, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1058675588, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1058675588, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1058675588} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1058675588, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1058675588, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1058675588, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out-1058675588|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1058675588} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 06:15:31,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In1535361508 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd2~0_In1535361508 256) 0))) (or (and (= ~b$r_buff0_thd2~0_In1535361508 |P1Thread1of1ForFork0_#t~ite13_Out1535361508|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out1535361508|) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1535361508, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1535361508} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1535361508, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1535361508, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out1535361508|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 06:15:31,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse2 (= 0 (mod ~b$w_buff1_used~0_In142638581 256))) (.cse3 (= (mod ~b$r_buff1_thd2~0_In142638581 256) 0)) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In142638581 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In142638581 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite14_Out142638581|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~b$r_buff1_thd2~0_In142638581 |P1Thread1of1ForFork0_#t~ite14_Out142638581|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In142638581, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In142638581, ~b$w_buff1_used~0=~b$w_buff1_used~0_In142638581, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In142638581} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In142638581, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In142638581, ~b$w_buff1_used~0=~b$w_buff1_used~0_In142638581, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out142638581|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In142638581} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 06:15:31,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L784-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~b$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork0_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_8|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_7|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_13, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 06:15:31,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t851~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t851~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t851~0.base_13|) |v_ULTIMATE.start_main_~#t851~0.offset_11| 2)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t851~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t851~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t851~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t851~0.base_13| 4)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t851~0.base_13| 1) |v_#valid_36|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t851~0.base=|v_ULTIMATE.start_main_~#t851~0.base_13|, ULTIMATE.start_main_~#t851~0.offset=|v_ULTIMATE.start_main_~#t851~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t851~0.base, ULTIMATE.start_main_~#t851~0.offset] because there is no mapped edge [2019-12-27 06:15:31,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L808-->L808-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In523000183 256) 0))) (or (and (let ((.cse0 (= (mod ~b$r_buff0_thd3~0_In523000183 256) 0))) (or (and (= (mod ~b$w_buff1_used~0_In523000183 256) 0) .cse0) (and (= (mod ~b$r_buff1_thd3~0_In523000183 256) 0) .cse0) (= 0 (mod ~b$w_buff0_used~0_In523000183 256)))) (= |P2Thread1of1ForFork1_#t~ite21_Out523000183| |P2Thread1of1ForFork1_#t~ite20_Out523000183|) (= ~b$w_buff0~0_In523000183 |P2Thread1of1ForFork1_#t~ite20_Out523000183|) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite20_In523000183| |P2Thread1of1ForFork1_#t~ite20_Out523000183|) (= ~b$w_buff0~0_In523000183 |P2Thread1of1ForFork1_#t~ite21_Out523000183|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In523000183, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In523000183, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In523000183|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In523000183, ~b$w_buff0~0=~b$w_buff0~0_In523000183, ~weak$$choice2~0=~weak$$choice2~0_In523000183, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In523000183} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In523000183, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In523000183, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out523000183|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out523000183|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In523000183, ~b$w_buff0~0=~b$w_buff0~0_In523000183, ~weak$$choice2~0=~weak$$choice2~0_In523000183, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In523000183} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 06:15:31,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-829523701 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite27_Out-829523701| ~b$w_buff0_used~0_In-829523701) (= |P2Thread1of1ForFork1_#t~ite26_In-829523701| |P2Thread1of1ForFork1_#t~ite26_Out-829523701|)) (and (= ~b$w_buff0_used~0_In-829523701 |P2Thread1of1ForFork1_#t~ite26_Out-829523701|) (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-829523701 256)))) (or (and .cse1 (= (mod ~b$w_buff1_used~0_In-829523701 256) 0)) (and .cse1 (= 0 (mod ~b$r_buff1_thd3~0_In-829523701 256))) (= (mod ~b$w_buff0_used~0_In-829523701 256) 0))) .cse0 (= |P2Thread1of1ForFork1_#t~ite27_Out-829523701| |P2Thread1of1ForFork1_#t~ite26_Out-829523701|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-829523701, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-829523701, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-829523701|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-829523701, ~weak$$choice2~0=~weak$$choice2~0_In-829523701, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-829523701} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-829523701, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-829523701|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-829523701, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-829523701|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-829523701, ~weak$$choice2~0=~weak$$choice2~0_In-829523701, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-829523701} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-27 06:15:31,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (= v_~b$r_buff0_thd3~0_49 v_~b$r_buff0_thd3~0_50) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_49, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 06:15:31,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (= v_~b~0_18 v_~b$mem_tmp~0_5) (not (= (mod v_~b$flush_delayed~0_8 256) 0))) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~b~0=v_~b~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-27 06:15:31,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff1_thd3~0_In-1881275904 256))) (.cse0 (= (mod ~b$w_buff1_used~0_In-1881275904 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite38_Out-1881275904| ~b~0_In-1881275904) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite38_Out-1881275904| ~b$w_buff1~0_In-1881275904)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-1881275904, ~b~0=~b~0_In-1881275904, ~b$w_buff1~0=~b$w_buff1~0_In-1881275904, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1881275904} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-1881275904|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1881275904, ~b~0=~b~0_In-1881275904, ~b$w_buff1~0=~b$w_buff1~0_In-1881275904, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1881275904} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-27 06:15:31,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_20 |v_P2Thread1of1ForFork1_#t~ite38_8|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_8|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_7|, ~b~0=v_~b~0_20, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-27 06:15:31,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~b$r_buff0_thd3~0_In-970462600 256) 0)) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In-970462600 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite40_Out-970462600| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In-970462600 |P2Thread1of1ForFork1_#t~ite40_Out-970462600|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-970462600, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-970462600} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-970462600, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-970462600, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-970462600|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-27 06:15:31,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse2 (= (mod ~b$w_buff1_used~0_In1939656142 256) 0)) (.cse3 (= (mod ~b$r_buff1_thd3~0_In1939656142 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In1939656142 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In1939656142 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite41_Out1939656142|)) (and (= ~b$w_buff1_used~0_In1939656142 |P2Thread1of1ForFork1_#t~ite41_Out1939656142|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1939656142, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1939656142, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1939656142, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1939656142} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1939656142, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1939656142, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1939656142, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out1939656142|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1939656142} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-27 06:15:31,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In-1118064498 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1118064498 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite42_Out-1118064498| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite42_Out-1118064498| ~b$r_buff0_thd3~0_In-1118064498) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1118064498, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1118064498} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1118064498, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1118064498, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-1118064498|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-27 06:15:31,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse3 (= (mod ~b$r_buff0_thd3~0_In-2035284881 256) 0)) (.cse2 (= 0 (mod ~b$w_buff0_used~0_In-2035284881 256))) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In-2035284881 256))) (.cse0 (= (mod ~b$r_buff1_thd3~0_In-2035284881 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite43_Out-2035284881| ~b$r_buff1_thd3~0_In-2035284881) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite43_Out-2035284881|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2035284881, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-2035284881, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2035284881, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-2035284881} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-2035284881, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-2035284881, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-2035284881|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2035284881, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-2035284881} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-27 06:15:31,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L823-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~b$r_buff1_thd3~0_42 |v_P2Thread1of1ForFork1_#t~ite43_8|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_42, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 06:15:31,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In318039473 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In318039473 256)))) (or (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In318039473 |P0Thread1of1ForFork2_#t~ite5_Out318039473|)) (and (not .cse0) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out318039473|) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In318039473, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In318039473} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In318039473, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In318039473, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out318039473|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 06:15:31,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~b$r_buff1_thd1~0_In-436371462 256))) (.cse2 (= (mod ~b$w_buff1_used~0_In-436371462 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-436371462 256))) (.cse1 (= (mod ~b$r_buff0_thd1~0_In-436371462 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite6_Out-436371462| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork2_#t~ite6_Out-436371462| ~b$w_buff1_used~0_In-436371462) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-436371462, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-436371462, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-436371462, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-436371462} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-436371462, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-436371462, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-436371462, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-436371462, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-436371462|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 06:15:31,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-1413440719 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd1~0_In-1413440719 256) 0))) (or (and (= ~b$r_buff0_thd1~0_Out-1413440719 0) (not .cse0) (not .cse1)) (and (= ~b$r_buff0_thd1~0_Out-1413440719 ~b$r_buff0_thd1~0_In-1413440719) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1413440719, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1413440719} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1413440719, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-1413440719, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-1413440719|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 06:15:31,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse1 (= (mod ~b$w_buff1_used~0_In-1223764807 256) 0)) (.cse0 (= (mod ~b$r_buff1_thd1~0_In-1223764807 256) 0)) (.cse2 (= 0 (mod ~b$w_buff0_used~0_In-1223764807 256))) (.cse3 (= (mod ~b$r_buff0_thd1~0_In-1223764807 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_Out-1223764807| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork2_#t~ite8_Out-1223764807| ~b$r_buff1_thd1~0_In-1223764807) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1223764807, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1223764807, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1223764807, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1223764807} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1223764807, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1223764807, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1223764807, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1223764807, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1223764807|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:15:31,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= v_~b$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork2_#t~ite8_8|)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_15, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_7|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 06:15:31,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: 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-27 06:15:31,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse1 (= (mod ~b$w_buff1_used~0_In-53277654 256) 0)) (.cse0 (= (mod ~b$r_buff1_thd0~0_In-53277654 256) 0))) (or (and (not .cse0) (= ~b$w_buff1~0_In-53277654 |ULTIMATE.start_main_#t~ite47_Out-53277654|) (not .cse1)) (and (or .cse1 .cse0) (= ~b~0_In-53277654 |ULTIMATE.start_main_#t~ite47_Out-53277654|)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-53277654, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-53277654, ~b~0=~b~0_In-53277654, ~b$w_buff1~0=~b$w_buff1~0_In-53277654} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-53277654, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-53277654, ~b~0=~b~0_In-53277654, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-53277654|, ~b$w_buff1~0=~b$w_buff1~0_In-53277654} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 06:15:31,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_21 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{~b~0=v_~b~0_21, 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[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 06:15:31,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~b$r_buff0_thd0~0_In147631564 256) 0)) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In147631564 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out147631564| ~b$w_buff0_used~0_In147631564) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out147631564| 0) (not .cse0) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In147631564, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In147631564} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In147631564, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out147631564|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In147631564} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 06:15:31,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse3 (= (mod ~b$w_buff1_used~0_In-717558100 256) 0)) (.cse2 (= 0 (mod ~b$r_buff1_thd0~0_In-717558100 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In-717558100 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-717558100 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-717558100| 0)) (and (= ~b$w_buff1_used~0_In-717558100 |ULTIMATE.start_main_#t~ite50_Out-717558100|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-717558100, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-717558100, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-717558100, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-717558100} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-717558100|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In-717558100, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-717558100, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-717558100, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-717558100} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 06:15:31,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-1435249547 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In-1435249547 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-1435249547| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1435249547| ~b$r_buff0_thd0~0_In-1435249547)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1435249547, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1435249547} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1435249547, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1435249547|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1435249547} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 06:15:31,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse2 (= 0 (mod ~b$w_buff0_used~0_In-72877423 256))) (.cse3 (= 0 (mod ~b$r_buff0_thd0~0_In-72877423 256))) (.cse0 (= (mod ~b$r_buff1_thd0~0_In-72877423 256) 0)) (.cse1 (= (mod ~b$w_buff1_used~0_In-72877423 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-72877423| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-72877423| ~b$r_buff1_thd0~0_In-72877423) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-72877423, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-72877423, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-72877423, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-72877423} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-72877423, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-72877423|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-72877423, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-72877423, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-72877423} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 06:15:31,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p2_EAX~0_5 1) (= 1 v_~__unbuffered_p1_EAX~0_7) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= v_~b$r_buff1_thd0~0_17 |v_ULTIMATE.start_main_#t~ite52_11|) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 0 v_~__unbuffered_p1_EBX~0_7)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__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_5} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_5, 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, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:15:31,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:15:31 BasicIcfg [2019-12-27 06:15:31,375 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:15:31,378 INFO L168 Benchmark]: Toolchain (without parser) took 119877.59 ms. Allocated memory was 146.8 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 103.1 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 06:15:31,379 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 06:15:31,379 INFO L168 Benchmark]: CACSL2BoogieTranslator took 837.57 ms. Allocated memory was 146.8 MB in the beginning and 202.4 MB in the end (delta: 55.6 MB). Free memory was 102.9 MB in the beginning and 153.5 MB in the end (delta: -50.6 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:15:31,383 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.29 ms. Allocated memory is still 202.4 MB. Free memory was 153.5 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:15:31,383 INFO L168 Benchmark]: Boogie Preprocessor took 61.59 ms. Allocated memory is still 202.4 MB. Free memory was 150.9 MB in the beginning and 148.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:15:31,384 INFO L168 Benchmark]: RCFGBuilder took 896.01 ms. Allocated memory is still 202.4 MB. Free memory was 148.3 MB in the beginning and 97.5 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:15:31,384 INFO L168 Benchmark]: TraceAbstraction took 118002.19 ms. Allocated memory was 202.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 96.8 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 06:15:31,388 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.43 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 837.57 ms. Allocated memory was 146.8 MB in the beginning and 202.4 MB in the end (delta: 55.6 MB). Free memory was 102.9 MB in the beginning and 153.5 MB in the end (delta: -50.6 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.29 ms. Allocated memory is still 202.4 MB. Free memory was 153.5 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.59 ms. Allocated memory is still 202.4 MB. Free memory was 150.9 MB in the beginning and 148.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 896.01 ms. Allocated memory is still 202.4 MB. Free memory was 148.3 MB in the beginning and 97.5 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 118002.19 ms. Allocated memory was 202.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 96.8 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 180 ProgramPointsBefore, 97 ProgramPointsAfterwards, 217 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 31 ChoiceCompositions, 7585 VarBasedMoverChecksPositive, 220 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 86141 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L739] 1 b$w_buff1 = b$w_buff0 [L740] 1 b$w_buff0 = 1 [L741] 1 b$w_buff1_used = b$w_buff0_used [L742] 1 b$w_buff0_used = (_Bool)1 [L754] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L768] 2 x = 1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L780] 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L754] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L781] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L782] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L783] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L846] FCALL, FORK 0 pthread_create(&t851, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 3 z = 1 [L797] 3 a = 1 [L800] 3 __unbuffered_p2_EAX = a [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 b$flush_delayed = weak$$choice2 [L806] 3 b$mem_tmp = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) VAL [!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L808] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L809] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1))=0, x=1, y=1, z=1] [L809] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L810] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L821] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L822] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L755] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L756] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L852] 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L854] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L855] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 117.6s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 33.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7081 SDtfs, 10558 SDslu, 24415 SDs, 0 SdLazy, 13717 SolverSat, 491 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 384 GetRequests, 36 SyntacticMatches, 18 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2432 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176439occurred 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: 52.7s AutomataMinimizationTime, 27 MinimizatonAttempts, 434644 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1361 NumberOfCodeBlocks, 1361 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1267 ConstructedInterpolants, 0 QuantifiedInterpolants, 276070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...