/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/mix025_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:48:44,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:48:44,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:48:45,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:48:45,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:48:45,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:48:45,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:48:45,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:48:45,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:48:45,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:48:45,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:48:45,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:48:45,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:48:45,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:48:45,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:48:45,025 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:48:45,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:48:45,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:48:45,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:48:45,031 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:48:45,034 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:48:45,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:48:45,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:48:45,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:48:45,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:48:45,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:48:45,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:48:45,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:48:45,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:48:45,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:48:45,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:48:45,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:48:45,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:48:45,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:48:45,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:48:45,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:48:45,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:48:45,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:48:45,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:48:45,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:48:45,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:48:45,059 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:48:45,081 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:48:45,081 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:48:45,083 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:48:45,083 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:48:45,083 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:48:45,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:48:45,084 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:48:45,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:48:45,084 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:48:45,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:48:45,084 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:48:45,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:48:45,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:48:45,085 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:48:45,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:48:45,085 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:48:45,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:48:45,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:48:45,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:48:45,086 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:48:45,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:48:45,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:48:45,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:48:45,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:48:45,087 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:48:45,087 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:48:45,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:48:45,088 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:48:45,088 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:48:45,088 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:48:45,385 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:48:45,408 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:48:45,411 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:48:45,413 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:48:45,413 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:48:45,414 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_power.oepc.i [2019-12-18 20:48:45,476 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3723182d/8bef914b85c64af28a6c761991e0a2d0/FLAGa05990c16 [2019-12-18 20:48:46,089 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:48:46,090 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_power.oepc.i [2019-12-18 20:48:46,104 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3723182d/8bef914b85c64af28a6c761991e0a2d0/FLAGa05990c16 [2019-12-18 20:48:46,326 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3723182d/8bef914b85c64af28a6c761991e0a2d0 [2019-12-18 20:48:46,336 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:48:46,338 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:48:46,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:48:46,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:48:46,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:48:46,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:48:46" (1/1) ... [2019-12-18 20:48:46,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50af0a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:46, skipping insertion in model container [2019-12-18 20:48:46,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:48:46" (1/1) ... [2019-12-18 20:48:46,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:48:46,428 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:48:46,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:48:46,935 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:48:47,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:48:47,082 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:48:47,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:47 WrapperNode [2019-12-18 20:48:47,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:48:47,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:48:47,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:48:47,083 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:48:47,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:47" (1/1) ... [2019-12-18 20:48:47,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:47" (1/1) ... [2019-12-18 20:48:47,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:48:47,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:48:47,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:48:47,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:48:47,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:47" (1/1) ... [2019-12-18 20:48:47,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:47" (1/1) ... [2019-12-18 20:48:47,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:47" (1/1) ... [2019-12-18 20:48:47,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:47" (1/1) ... [2019-12-18 20:48:47,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:47" (1/1) ... [2019-12-18 20:48:47,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:47" (1/1) ... [2019-12-18 20:48:47,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:47" (1/1) ... [2019-12-18 20:48:47,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:48:47,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:48:47,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:48:47,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:48:47,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:48:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:48:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:48:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:48:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:48:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:48:47,256 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:48:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:48:47,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:48:47,257 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:48:47,258 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:48:47,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:48:47,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:48:47,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:48:47,261 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:48:48,060 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:48:48,061 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:48:48,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:48:48 BoogieIcfgContainer [2019-12-18 20:48:48,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:48:48,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:48:48,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:48:48,067 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:48:48,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:48:46" (1/3) ... [2019-12-18 20:48:48,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc51bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:48:48, skipping insertion in model container [2019-12-18 20:48:48,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:47" (2/3) ... [2019-12-18 20:48:48,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc51bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:48:48, skipping insertion in model container [2019-12-18 20:48:48,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:48:48" (3/3) ... [2019-12-18 20:48:48,071 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_power.oepc.i [2019-12-18 20:48:48,082 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:48:48,082 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:48:48,090 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:48:48,091 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:48:48,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,137 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,137 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,137 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,138 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,138 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,151 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,152 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,185 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,185 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,231 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,233 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,249 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,249 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,250 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,252 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,253 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:48,274 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:48:48,293 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:48:48,294 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:48:48,294 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:48:48,294 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:48:48,294 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:48:48,294 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:48:48,294 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:48:48,294 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:48:48,308 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 20:48:48,310 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 20:48:48,398 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 20:48:48,398 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:48:48,418 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 20:48:48,446 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 20:48:48,493 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 20:48:48,494 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:48:48,502 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 20:48:48,524 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 20:48:48,526 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:48:52,305 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 20:48:52,456 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 20:48:52,486 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84223 [2019-12-18 20:48:52,486 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 20:48:52,490 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-18 20:49:12,685 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122130 states. [2019-12-18 20:49:12,687 INFO L276 IsEmpty]: Start isEmpty. Operand 122130 states. [2019-12-18 20:49:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 20:49:12,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:49:12,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 20:49:12,694 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:49:12,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:49:12,701 INFO L82 PathProgramCache]: Analyzing trace with hash 912016, now seen corresponding path program 1 times [2019-12-18 20:49:12,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:49:12,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107663131] [2019-12-18 20:49:12,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:49:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:49:13,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:49:13,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107663131] [2019-12-18 20:49:13,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:49:13,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:49:13,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573803063] [2019-12-18 20:49:13,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:49:13,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:49:13,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:49:13,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:49:13,034 INFO L87 Difference]: Start difference. First operand 122130 states. Second operand 3 states. [2019-12-18 20:49:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:49:16,060 INFO L93 Difference]: Finished difference Result 120482 states and 514480 transitions. [2019-12-18 20:49:16,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:49:16,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 20:49:16,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:49:16,733 INFO L225 Difference]: With dead ends: 120482 [2019-12-18 20:49:16,733 INFO L226 Difference]: Without dead ends: 113384 [2019-12-18 20:49:16,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:49:23,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113384 states. [2019-12-18 20:49:26,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113384 to 113384. [2019-12-18 20:49:26,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113384 states. [2019-12-18 20:49:27,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113384 states to 113384 states and 483579 transitions. [2019-12-18 20:49:27,399 INFO L78 Accepts]: Start accepts. Automaton has 113384 states and 483579 transitions. Word has length 3 [2019-12-18 20:49:27,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:49:27,400 INFO L462 AbstractCegarLoop]: Abstraction has 113384 states and 483579 transitions. [2019-12-18 20:49:27,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:49:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 113384 states and 483579 transitions. [2019-12-18 20:49:27,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 20:49:27,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:49:27,404 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:49:27,405 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:49:27,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:49:27,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1106167815, now seen corresponding path program 1 times [2019-12-18 20:49:27,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:49:27,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808487484] [2019-12-18 20:49:27,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:49:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:49:27,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:49:27,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808487484] [2019-12-18 20:49:27,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:49:27,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:49:27,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015256703] [2019-12-18 20:49:27,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:49:27,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:49:27,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:49:27,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:49:27,525 INFO L87 Difference]: Start difference. First operand 113384 states and 483579 transitions. Second operand 4 states. [2019-12-18 20:49:33,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:49:33,130 INFO L93 Difference]: Finished difference Result 179498 states and 731972 transitions. [2019-12-18 20:49:33,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:49:33,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 20:49:33,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:49:33,929 INFO L225 Difference]: With dead ends: 179498 [2019-12-18 20:49:33,930 INFO L226 Difference]: Without dead ends: 179449 [2019-12-18 20:49:33,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:49:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179449 states. [2019-12-18 20:49:46,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179449 to 162546. [2019-12-18 20:49:46,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162546 states. [2019-12-18 20:49:47,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162546 states to 162546 states and 672884 transitions. [2019-12-18 20:49:47,502 INFO L78 Accepts]: Start accepts. Automaton has 162546 states and 672884 transitions. Word has length 11 [2019-12-18 20:49:47,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:49:47,503 INFO L462 AbstractCegarLoop]: Abstraction has 162546 states and 672884 transitions. [2019-12-18 20:49:47,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:49:47,503 INFO L276 IsEmpty]: Start isEmpty. Operand 162546 states and 672884 transitions. [2019-12-18 20:49:47,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:49:47,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:49:47,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:49:47,509 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:49:47,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:49:47,510 INFO L82 PathProgramCache]: Analyzing trace with hash 490332773, now seen corresponding path program 1 times [2019-12-18 20:49:47,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:49:47,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595017480] [2019-12-18 20:49:47,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:49:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:49:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:49:47,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595017480] [2019-12-18 20:49:47,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:49:47,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:49:47,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080066630] [2019-12-18 20:49:47,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:49:47,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:49:47,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:49:47,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:49:47,574 INFO L87 Difference]: Start difference. First operand 162546 states and 672884 transitions. Second operand 3 states. [2019-12-18 20:49:47,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:49:47,713 INFO L93 Difference]: Finished difference Result 34413 states and 111772 transitions. [2019-12-18 20:49:47,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:49:47,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 20:49:47,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:49:47,792 INFO L225 Difference]: With dead ends: 34413 [2019-12-18 20:49:47,792 INFO L226 Difference]: Without dead ends: 34413 [2019-12-18 20:49:47,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:49:47,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34413 states. [2019-12-18 20:49:48,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34413 to 34413. [2019-12-18 20:49:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34413 states. [2019-12-18 20:49:48,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34413 states to 34413 states and 111772 transitions. [2019-12-18 20:49:48,435 INFO L78 Accepts]: Start accepts. Automaton has 34413 states and 111772 transitions. Word has length 13 [2019-12-18 20:49:48,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:49:48,435 INFO L462 AbstractCegarLoop]: Abstraction has 34413 states and 111772 transitions. [2019-12-18 20:49:48,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:49:48,435 INFO L276 IsEmpty]: Start isEmpty. Operand 34413 states and 111772 transitions. [2019-12-18 20:49:48,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:49:48,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:49:48,438 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:49:48,438 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:49:48,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:49:48,439 INFO L82 PathProgramCache]: Analyzing trace with hash 562012763, now seen corresponding path program 1 times [2019-12-18 20:49:48,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:49:48,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279959018] [2019-12-18 20:49:48,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:49:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:49:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:49:48,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279959018] [2019-12-18 20:49:48,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:49:48,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:49:48,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044956704] [2019-12-18 20:49:48,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:49:48,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:49:48,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:49:48,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:49:48,500 INFO L87 Difference]: Start difference. First operand 34413 states and 111772 transitions. Second operand 3 states. [2019-12-18 20:49:51,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:49:51,028 INFO L93 Difference]: Finished difference Result 54627 states and 176362 transitions. [2019-12-18 20:49:51,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:49:51,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 20:49:51,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:49:51,117 INFO L225 Difference]: With dead ends: 54627 [2019-12-18 20:49:51,117 INFO L226 Difference]: Without dead ends: 54627 [2019-12-18 20:49:51,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:49:51,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54627 states. [2019-12-18 20:49:51,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54627 to 41131. [2019-12-18 20:49:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41131 states. [2019-12-18 20:49:51,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41131 states to 41131 states and 134258 transitions. [2019-12-18 20:49:51,862 INFO L78 Accepts]: Start accepts. Automaton has 41131 states and 134258 transitions. Word has length 16 [2019-12-18 20:49:51,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:49:51,863 INFO L462 AbstractCegarLoop]: Abstraction has 41131 states and 134258 transitions. [2019-12-18 20:49:51,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:49:51,863 INFO L276 IsEmpty]: Start isEmpty. Operand 41131 states and 134258 transitions. [2019-12-18 20:49:51,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:49:51,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:49:51,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:49:51,866 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:49:51,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:49:51,866 INFO L82 PathProgramCache]: Analyzing trace with hash 562138282, now seen corresponding path program 1 times [2019-12-18 20:49:51,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:49:51,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119249987] [2019-12-18 20:49:51,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:49:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:49:52,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:49:52,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119249987] [2019-12-18 20:49:52,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:49:52,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:49:52,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945874027] [2019-12-18 20:49:52,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:49:52,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:49:52,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:49:52,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:49:52,008 INFO L87 Difference]: Start difference. First operand 41131 states and 134258 transitions. Second operand 4 states. [2019-12-18 20:49:52,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:49:52,409 INFO L93 Difference]: Finished difference Result 48927 states and 157520 transitions. [2019-12-18 20:49:52,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:49:52,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:49:52,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:49:52,483 INFO L225 Difference]: With dead ends: 48927 [2019-12-18 20:49:52,484 INFO L226 Difference]: Without dead ends: 48927 [2019-12-18 20:49:52,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:49:53,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48927 states. [2019-12-18 20:49:53,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48927 to 44953. [2019-12-18 20:49:53,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44953 states. [2019-12-18 20:49:53,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44953 states to 44953 states and 145741 transitions. [2019-12-18 20:49:53,572 INFO L78 Accepts]: Start accepts. Automaton has 44953 states and 145741 transitions. Word has length 16 [2019-12-18 20:49:53,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:49:53,572 INFO L462 AbstractCegarLoop]: Abstraction has 44953 states and 145741 transitions. [2019-12-18 20:49:53,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:49:53,572 INFO L276 IsEmpty]: Start isEmpty. Operand 44953 states and 145741 transitions. [2019-12-18 20:49:53,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:49:53,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:49:53,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:49:53,576 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:49:53,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:49:53,576 INFO L82 PathProgramCache]: Analyzing trace with hash 173692215, now seen corresponding path program 1 times [2019-12-18 20:49:53,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:49:53,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397327315] [2019-12-18 20:49:53,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:49:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:49:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:49:53,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397327315] [2019-12-18 20:49:53,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:49:53,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:49:53,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151753180] [2019-12-18 20:49:53,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:49:53,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:49:53,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:49:53,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:49:53,656 INFO L87 Difference]: Start difference. First operand 44953 states and 145741 transitions. Second operand 4 states. [2019-12-18 20:49:54,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:49:54,033 INFO L93 Difference]: Finished difference Result 53251 states and 171579 transitions. [2019-12-18 20:49:54,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:49:54,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:49:54,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:49:54,120 INFO L225 Difference]: With dead ends: 53251 [2019-12-18 20:49:54,121 INFO L226 Difference]: Without dead ends: 53251 [2019-12-18 20:49:54,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:49:54,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53251 states. [2019-12-18 20:49:55,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53251 to 46409. [2019-12-18 20:49:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46409 states. [2019-12-18 20:49:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46409 states to 46409 states and 150674 transitions. [2019-12-18 20:49:55,302 INFO L78 Accepts]: Start accepts. Automaton has 46409 states and 150674 transitions. Word has length 16 [2019-12-18 20:49:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:49:55,302 INFO L462 AbstractCegarLoop]: Abstraction has 46409 states and 150674 transitions. [2019-12-18 20:49:55,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:49:55,302 INFO L276 IsEmpty]: Start isEmpty. Operand 46409 states and 150674 transitions. [2019-12-18 20:49:55,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:49:55,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:49:55,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:49:55,312 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:49:55,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:49:55,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1710143018, now seen corresponding path program 1 times [2019-12-18 20:49:55,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:49:55,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491052474] [2019-12-18 20:49:55,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:49:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:49:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:49:55,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491052474] [2019-12-18 20:49:55,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:49:55,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:49:55,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143538823] [2019-12-18 20:49:55,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:49:55,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:49:55,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:49:55,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:49:55,409 INFO L87 Difference]: Start difference. First operand 46409 states and 150674 transitions. Second operand 5 states. [2019-12-18 20:49:56,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:49:56,125 INFO L93 Difference]: Finished difference Result 63192 states and 200300 transitions. [2019-12-18 20:49:56,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:49:56,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:49:56,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:49:56,263 INFO L225 Difference]: With dead ends: 63192 [2019-12-18 20:49:56,264 INFO L226 Difference]: Without dead ends: 63185 [2019-12-18 20:49:56,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:49:56,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63185 states. [2019-12-18 20:49:57,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63185 to 47511. [2019-12-18 20:49:57,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47511 states. [2019-12-18 20:49:57,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47511 states to 47511 states and 154018 transitions. [2019-12-18 20:49:57,579 INFO L78 Accepts]: Start accepts. Automaton has 47511 states and 154018 transitions. Word has length 22 [2019-12-18 20:49:57,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:49:57,579 INFO L462 AbstractCegarLoop]: Abstraction has 47511 states and 154018 transitions. [2019-12-18 20:49:57,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:49:57,580 INFO L276 IsEmpty]: Start isEmpty. Operand 47511 states and 154018 transitions. [2019-12-18 20:49:57,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:49:57,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:49:57,589 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:49:57,589 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:49:57,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:49:57,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2075627383, now seen corresponding path program 1 times [2019-12-18 20:49:57,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:49:57,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475934724] [2019-12-18 20:49:57,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:49:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:49:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:49:57,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475934724] [2019-12-18 20:49:57,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:49:57,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:49:57,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445705342] [2019-12-18 20:49:57,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:49:57,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:49:57,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:49:57,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:49:57,699 INFO L87 Difference]: Start difference. First operand 47511 states and 154018 transitions. Second operand 5 states. [2019-12-18 20:49:58,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:49:58,412 INFO L93 Difference]: Finished difference Result 65538 states and 207239 transitions. [2019-12-18 20:49:58,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:49:58,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:49:58,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:49:58,522 INFO L225 Difference]: With dead ends: 65538 [2019-12-18 20:49:58,523 INFO L226 Difference]: Without dead ends: 65531 [2019-12-18 20:49:58,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:49:58,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65531 states. [2019-12-18 20:49:59,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65531 to 45771. [2019-12-18 20:49:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45771 states. [2019-12-18 20:49:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45771 states to 45771 states and 148366 transitions. [2019-12-18 20:49:59,988 INFO L78 Accepts]: Start accepts. Automaton has 45771 states and 148366 transitions. Word has length 22 [2019-12-18 20:49:59,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:49:59,988 INFO L462 AbstractCegarLoop]: Abstraction has 45771 states and 148366 transitions. [2019-12-18 20:49:59,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:49:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 45771 states and 148366 transitions. [2019-12-18 20:49:59,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:49:59,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:00,000 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:00,000 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:00,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:00,000 INFO L82 PathProgramCache]: Analyzing trace with hash -433341706, now seen corresponding path program 1 times [2019-12-18 20:50:00,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:00,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150296930] [2019-12-18 20:50:00,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:00,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150296930] [2019-12-18 20:50:00,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:00,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:50:00,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621947726] [2019-12-18 20:50:00,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:50:00,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:00,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:50:00,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:50:00,062 INFO L87 Difference]: Start difference. First operand 45771 states and 148366 transitions. Second operand 4 states. [2019-12-18 20:50:00,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:00,131 INFO L93 Difference]: Finished difference Result 17755 states and 54382 transitions. [2019-12-18 20:50:00,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:50:00,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 20:50:00,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:00,155 INFO L225 Difference]: With dead ends: 17755 [2019-12-18 20:50:00,155 INFO L226 Difference]: Without dead ends: 17755 [2019-12-18 20:50:00,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:50:00,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17755 states. [2019-12-18 20:50:00,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17755 to 17427. [2019-12-18 20:50:00,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17427 states. [2019-12-18 20:50:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17427 states to 17427 states and 53446 transitions. [2019-12-18 20:50:00,399 INFO L78 Accepts]: Start accepts. Automaton has 17427 states and 53446 transitions. Word has length 25 [2019-12-18 20:50:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:00,399 INFO L462 AbstractCegarLoop]: Abstraction has 17427 states and 53446 transitions. [2019-12-18 20:50:00,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:50:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand 17427 states and 53446 transitions. [2019-12-18 20:50:00,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:50:00,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:00,412 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:00,412 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:00,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:00,413 INFO L82 PathProgramCache]: Analyzing trace with hash -2045967469, now seen corresponding path program 1 times [2019-12-18 20:50:00,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:00,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780631415] [2019-12-18 20:50:00,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:00,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:00,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780631415] [2019-12-18 20:50:00,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:00,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:50:00,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594595464] [2019-12-18 20:50:00,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:50:00,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:00,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:50:00,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:00,502 INFO L87 Difference]: Start difference. First operand 17427 states and 53446 transitions. Second operand 5 states. [2019-12-18 20:50:00,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:00,898 INFO L93 Difference]: Finished difference Result 22078 states and 66584 transitions. [2019-12-18 20:50:00,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:50:00,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 20:50:00,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:00,941 INFO L225 Difference]: With dead ends: 22078 [2019-12-18 20:50:00,941 INFO L226 Difference]: Without dead ends: 22078 [2019-12-18 20:50:00,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:50:01,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22078 states. [2019-12-18 20:50:01,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22078 to 20690. [2019-12-18 20:50:01,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20690 states. [2019-12-18 20:50:01,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20690 states to 20690 states and 63094 transitions. [2019-12-18 20:50:01,256 INFO L78 Accepts]: Start accepts. Automaton has 20690 states and 63094 transitions. Word has length 27 [2019-12-18 20:50:01,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:01,257 INFO L462 AbstractCegarLoop]: Abstraction has 20690 states and 63094 transitions. [2019-12-18 20:50:01,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:50:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 20690 states and 63094 transitions. [2019-12-18 20:50:01,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:50:01,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:01,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:01,272 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:01,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:01,273 INFO L82 PathProgramCache]: Analyzing trace with hash -23775369, now seen corresponding path program 1 times [2019-12-18 20:50:01,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:01,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467484139] [2019-12-18 20:50:01,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:01,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467484139] [2019-12-18 20:50:01,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:01,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:50:01,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077745185] [2019-12-18 20:50:01,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:50:01,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:01,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:50:01,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:01,360 INFO L87 Difference]: Start difference. First operand 20690 states and 63094 transitions. Second operand 5 states. [2019-12-18 20:50:01,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:01,735 INFO L93 Difference]: Finished difference Result 23990 states and 72118 transitions. [2019-12-18 20:50:01,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:50:01,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 20:50:01,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:01,769 INFO L225 Difference]: With dead ends: 23990 [2019-12-18 20:50:01,769 INFO L226 Difference]: Without dead ends: 23990 [2019-12-18 20:50:01,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:50:01,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23990 states. [2019-12-18 20:50:02,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23990 to 20014. [2019-12-18 20:50:02,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20014 states. [2019-12-18 20:50:02,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20014 states to 20014 states and 61068 transitions. [2019-12-18 20:50:02,082 INFO L78 Accepts]: Start accepts. Automaton has 20014 states and 61068 transitions. Word has length 28 [2019-12-18 20:50:02,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:02,083 INFO L462 AbstractCegarLoop]: Abstraction has 20014 states and 61068 transitions. [2019-12-18 20:50:02,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:50:02,083 INFO L276 IsEmpty]: Start isEmpty. Operand 20014 states and 61068 transitions. [2019-12-18 20:50:02,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 20:50:02,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:02,104 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:02,104 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:02,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:02,104 INFO L82 PathProgramCache]: Analyzing trace with hash 454456511, now seen corresponding path program 1 times [2019-12-18 20:50:02,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:02,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150762695] [2019-12-18 20:50:02,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:02,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150762695] [2019-12-18 20:50:02,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:02,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:50:02,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942104302] [2019-12-18 20:50:02,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:50:02,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:02,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:50:02,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:50:02,213 INFO L87 Difference]: Start difference. First operand 20014 states and 61068 transitions. Second operand 6 states. [2019-12-18 20:50:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:03,095 INFO L93 Difference]: Finished difference Result 27389 states and 81711 transitions. [2019-12-18 20:50:03,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:50:03,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 20:50:03,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:03,150 INFO L225 Difference]: With dead ends: 27389 [2019-12-18 20:50:03,150 INFO L226 Difference]: Without dead ends: 27389 [2019-12-18 20:50:03,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:50:03,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27389 states. [2019-12-18 20:50:03,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27389 to 21157. [2019-12-18 20:50:03,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21157 states. [2019-12-18 20:50:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21157 states to 21157 states and 64374 transitions. [2019-12-18 20:50:03,516 INFO L78 Accepts]: Start accepts. Automaton has 21157 states and 64374 transitions. Word has length 33 [2019-12-18 20:50:03,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:03,516 INFO L462 AbstractCegarLoop]: Abstraction has 21157 states and 64374 transitions. [2019-12-18 20:50:03,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:50:03,516 INFO L276 IsEmpty]: Start isEmpty. Operand 21157 states and 64374 transitions. [2019-12-18 20:50:03,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 20:50:03,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:03,539 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:03,539 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:03,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:03,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1366250167, now seen corresponding path program 1 times [2019-12-18 20:50:03,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:03,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651752471] [2019-12-18 20:50:03,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:03,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:03,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651752471] [2019-12-18 20:50:03,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:03,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:50:03,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978869168] [2019-12-18 20:50:03,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:50:03,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:03,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:50:03,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:50:03,641 INFO L87 Difference]: Start difference. First operand 21157 states and 64374 transitions. Second operand 6 states. [2019-12-18 20:50:04,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:04,351 INFO L93 Difference]: Finished difference Result 26637 states and 79746 transitions. [2019-12-18 20:50:04,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:50:04,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 20:50:04,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:04,393 INFO L225 Difference]: With dead ends: 26637 [2019-12-18 20:50:04,393 INFO L226 Difference]: Without dead ends: 26637 [2019-12-18 20:50:04,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:50:04,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26637 states. [2019-12-18 20:50:04,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26637 to 18050. [2019-12-18 20:50:04,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18050 states. [2019-12-18 20:50:04,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18050 states to 18050 states and 55318 transitions. [2019-12-18 20:50:04,729 INFO L78 Accepts]: Start accepts. Automaton has 18050 states and 55318 transitions. Word has length 34 [2019-12-18 20:50:04,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:04,730 INFO L462 AbstractCegarLoop]: Abstraction has 18050 states and 55318 transitions. [2019-12-18 20:50:04,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:50:04,730 INFO L276 IsEmpty]: Start isEmpty. Operand 18050 states and 55318 transitions. [2019-12-18 20:50:04,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:50:04,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:04,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:04,748 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:04,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:04,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1485923537, now seen corresponding path program 1 times [2019-12-18 20:50:04,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:04,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163104245] [2019-12-18 20:50:04,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:04,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:04,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163104245] [2019-12-18 20:50:04,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:04,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:50:04,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943402166] [2019-12-18 20:50:04,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:50:04,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:04,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:50:04,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:04,816 INFO L87 Difference]: Start difference. First operand 18050 states and 55318 transitions. Second operand 3 states. [2019-12-18 20:50:04,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:04,949 INFO L93 Difference]: Finished difference Result 34099 states and 104605 transitions. [2019-12-18 20:50:04,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:50:04,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 20:50:04,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:04,984 INFO L225 Difference]: With dead ends: 34099 [2019-12-18 20:50:04,984 INFO L226 Difference]: Without dead ends: 18536 [2019-12-18 20:50:04,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:05,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18536 states. [2019-12-18 20:50:05,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18536 to 18472. [2019-12-18 20:50:05,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18472 states. [2019-12-18 20:50:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18472 states to 18472 states and 55193 transitions. [2019-12-18 20:50:05,426 INFO L78 Accepts]: Start accepts. Automaton has 18472 states and 55193 transitions. Word has length 39 [2019-12-18 20:50:05,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:05,428 INFO L462 AbstractCegarLoop]: Abstraction has 18472 states and 55193 transitions. [2019-12-18 20:50:05,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:50:05,428 INFO L276 IsEmpty]: Start isEmpty. Operand 18472 states and 55193 transitions. [2019-12-18 20:50:05,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:50:05,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:05,454 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:05,454 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:05,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:05,455 INFO L82 PathProgramCache]: Analyzing trace with hash 594517850, now seen corresponding path program 1 times [2019-12-18 20:50:05,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:05,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408601080] [2019-12-18 20:50:05,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:05,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408601080] [2019-12-18 20:50:05,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:05,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:50:05,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761552028] [2019-12-18 20:50:05,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:50:05,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:05,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:50:05,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:05,541 INFO L87 Difference]: Start difference. First operand 18472 states and 55193 transitions. Second operand 5 states. [2019-12-18 20:50:06,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:06,200 INFO L93 Difference]: Finished difference Result 26330 states and 77898 transitions. [2019-12-18 20:50:06,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:50:06,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 20:50:06,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:06,247 INFO L225 Difference]: With dead ends: 26330 [2019-12-18 20:50:06,247 INFO L226 Difference]: Without dead ends: 26330 [2019-12-18 20:50:06,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:50:06,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26330 states. [2019-12-18 20:50:06,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26330 to 24422. [2019-12-18 20:50:06,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24422 states. [2019-12-18 20:50:06,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24422 states to 24422 states and 72792 transitions. [2019-12-18 20:50:06,596 INFO L78 Accepts]: Start accepts. Automaton has 24422 states and 72792 transitions. Word has length 40 [2019-12-18 20:50:06,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:06,597 INFO L462 AbstractCegarLoop]: Abstraction has 24422 states and 72792 transitions. [2019-12-18 20:50:06,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:50:06,597 INFO L276 IsEmpty]: Start isEmpty. Operand 24422 states and 72792 transitions. [2019-12-18 20:50:06,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:50:06,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:06,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:06,626 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:06,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:06,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1706121534, now seen corresponding path program 2 times [2019-12-18 20:50:06,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:06,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697468193] [2019-12-18 20:50:06,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:06,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697468193] [2019-12-18 20:50:06,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:06,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:50:06,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642325258] [2019-12-18 20:50:06,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:50:06,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:06,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:50:06,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:06,701 INFO L87 Difference]: Start difference. First operand 24422 states and 72792 transitions. Second operand 3 states. [2019-12-18 20:50:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:06,782 INFO L93 Difference]: Finished difference Result 24422 states and 71972 transitions. [2019-12-18 20:50:06,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:50:06,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 20:50:06,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:06,812 INFO L225 Difference]: With dead ends: 24422 [2019-12-18 20:50:06,813 INFO L226 Difference]: Without dead ends: 24422 [2019-12-18 20:50:06,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:06,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24422 states. [2019-12-18 20:50:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24422 to 24358. [2019-12-18 20:50:07,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24358 states. [2019-12-18 20:50:07,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24358 states to 24358 states and 71794 transitions. [2019-12-18 20:50:07,145 INFO L78 Accepts]: Start accepts. Automaton has 24358 states and 71794 transitions. Word has length 40 [2019-12-18 20:50:07,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:07,145 INFO L462 AbstractCegarLoop]: Abstraction has 24358 states and 71794 transitions. [2019-12-18 20:50:07,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:50:07,145 INFO L276 IsEmpty]: Start isEmpty. Operand 24358 states and 71794 transitions. [2019-12-18 20:50:07,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 20:50:07,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:07,180 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] [2019-12-18 20:50:07,180 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:07,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:07,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1403753262, now seen corresponding path program 1 times [2019-12-18 20:50:07,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:07,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870232252] [2019-12-18 20:50:07,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:07,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870232252] [2019-12-18 20:50:07,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:07,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:50:07,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611586204] [2019-12-18 20:50:07,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:50:07,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:07,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:50:07,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:07,229 INFO L87 Difference]: Start difference. First operand 24358 states and 71794 transitions. Second operand 5 states. [2019-12-18 20:50:07,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:07,349 INFO L93 Difference]: Finished difference Result 22933 states and 68503 transitions. [2019-12-18 20:50:07,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:50:07,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 20:50:07,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:07,389 INFO L225 Difference]: With dead ends: 22933 [2019-12-18 20:50:07,389 INFO L226 Difference]: Without dead ends: 21188 [2019-12-18 20:50:07,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:07,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21188 states. [2019-12-18 20:50:07,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21188 to 20222. [2019-12-18 20:50:07,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20222 states. [2019-12-18 20:50:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20222 states to 20222 states and 62093 transitions. [2019-12-18 20:50:07,752 INFO L78 Accepts]: Start accepts. Automaton has 20222 states and 62093 transitions. Word has length 41 [2019-12-18 20:50:07,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:07,752 INFO L462 AbstractCegarLoop]: Abstraction has 20222 states and 62093 transitions. [2019-12-18 20:50:07,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:50:07,752 INFO L276 IsEmpty]: Start isEmpty. Operand 20222 states and 62093 transitions. [2019-12-18 20:50:07,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:50:07,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:07,775 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:07,775 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:07,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:07,775 INFO L82 PathProgramCache]: Analyzing trace with hash 384634377, now seen corresponding path program 1 times [2019-12-18 20:50:07,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:07,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488079823] [2019-12-18 20:50:07,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:07,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488079823] [2019-12-18 20:50:07,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:07,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:50:07,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874313331] [2019-12-18 20:50:07,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:50:07,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:07,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:50:07,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:50:07,867 INFO L87 Difference]: Start difference. First operand 20222 states and 62093 transitions. Second operand 6 states. [2019-12-18 20:50:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:08,752 INFO L93 Difference]: Finished difference Result 26541 states and 80606 transitions. [2019-12-18 20:50:08,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 20:50:08,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 20:50:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:08,799 INFO L225 Difference]: With dead ends: 26541 [2019-12-18 20:50:08,799 INFO L226 Difference]: Without dead ends: 26541 [2019-12-18 20:50:08,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:50:09,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26541 states. [2019-12-18 20:50:09,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26541 to 21349. [2019-12-18 20:50:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21349 states. [2019-12-18 20:50:09,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21349 states to 21349 states and 65525 transitions. [2019-12-18 20:50:09,274 INFO L78 Accepts]: Start accepts. Automaton has 21349 states and 65525 transitions. Word has length 65 [2019-12-18 20:50:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:09,274 INFO L462 AbstractCegarLoop]: Abstraction has 21349 states and 65525 transitions. [2019-12-18 20:50:09,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:50:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 21349 states and 65525 transitions. [2019-12-18 20:50:09,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:50:09,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:09,308 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:09,308 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:09,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:09,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1572101585, now seen corresponding path program 2 times [2019-12-18 20:50:09,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:09,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930013362] [2019-12-18 20:50:09,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:09,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930013362] [2019-12-18 20:50:09,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:09,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:50:09,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248582235] [2019-12-18 20:50:09,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:50:09,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:09,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:50:09,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:09,376 INFO L87 Difference]: Start difference. First operand 21349 states and 65525 transitions. Second operand 3 states. [2019-12-18 20:50:09,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:09,510 INFO L93 Difference]: Finished difference Result 27039 states and 82446 transitions. [2019-12-18 20:50:09,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:50:09,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 20:50:09,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:09,547 INFO L225 Difference]: With dead ends: 27039 [2019-12-18 20:50:09,548 INFO L226 Difference]: Without dead ends: 27039 [2019-12-18 20:50:09,548 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-18 20:50:09,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27039 states. [2019-12-18 20:50:09,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27039 to 22576. [2019-12-18 20:50:09,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22576 states. [2019-12-18 20:50:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22576 states to 22576 states and 69446 transitions. [2019-12-18 20:50:09,920 INFO L78 Accepts]: Start accepts. Automaton has 22576 states and 69446 transitions. Word has length 65 [2019-12-18 20:50:09,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:09,920 INFO L462 AbstractCegarLoop]: Abstraction has 22576 states and 69446 transitions. [2019-12-18 20:50:09,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:50:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand 22576 states and 69446 transitions. [2019-12-18 20:50:09,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:50:09,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:09,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:09,947 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:09,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:09,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1224939563, now seen corresponding path program 1 times [2019-12-18 20:50:09,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:09,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49587613] [2019-12-18 20:50:09,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:10,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49587613] [2019-12-18 20:50:10,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:10,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:50:10,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682823936] [2019-12-18 20:50:10,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:50:10,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:10,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:50:10,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:10,013 INFO L87 Difference]: Start difference. First operand 22576 states and 69446 transitions. Second operand 3 states. [2019-12-18 20:50:10,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:10,329 INFO L93 Difference]: Finished difference Result 32424 states and 100262 transitions. [2019-12-18 20:50:10,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:50:10,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 20:50:10,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:10,400 INFO L225 Difference]: With dead ends: 32424 [2019-12-18 20:50:10,400 INFO L226 Difference]: Without dead ends: 32424 [2019-12-18 20:50:10,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:10,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32424 states. [2019-12-18 20:50:10,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32424 to 23008. [2019-12-18 20:50:10,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23008 states. [2019-12-18 20:50:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23008 states to 23008 states and 70874 transitions. [2019-12-18 20:50:10,912 INFO L78 Accepts]: Start accepts. Automaton has 23008 states and 70874 transitions. Word has length 66 [2019-12-18 20:50:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:10,912 INFO L462 AbstractCegarLoop]: Abstraction has 23008 states and 70874 transitions. [2019-12-18 20:50:10,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:50:10,912 INFO L276 IsEmpty]: Start isEmpty. Operand 23008 states and 70874 transitions. [2019-12-18 20:50:10,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:50:10,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:10,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:10,940 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:10,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:10,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1882560525, now seen corresponding path program 2 times [2019-12-18 20:50:10,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:10,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42570185] [2019-12-18 20:50:10,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:11,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:11,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42570185] [2019-12-18 20:50:11,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:11,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:50:11,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044055447] [2019-12-18 20:50:11,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:50:11,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:11,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:50:11,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:50:11,008 INFO L87 Difference]: Start difference. First operand 23008 states and 70874 transitions. Second operand 4 states. [2019-12-18 20:50:11,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:11,173 INFO L93 Difference]: Finished difference Result 23008 states and 70666 transitions. [2019-12-18 20:50:11,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:50:11,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 20:50:11,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:11,214 INFO L225 Difference]: With dead ends: 23008 [2019-12-18 20:50:11,214 INFO L226 Difference]: Without dead ends: 23008 [2019-12-18 20:50:11,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:11,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23008 states. [2019-12-18 20:50:11,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23008 to 20881. [2019-12-18 20:50:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20881 states. [2019-12-18 20:50:11,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20881 states to 20881 states and 63949 transitions. [2019-12-18 20:50:11,673 INFO L78 Accepts]: Start accepts. Automaton has 20881 states and 63949 transitions. Word has length 66 [2019-12-18 20:50:11,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:11,673 INFO L462 AbstractCegarLoop]: Abstraction has 20881 states and 63949 transitions. [2019-12-18 20:50:11,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:50:11,674 INFO L276 IsEmpty]: Start isEmpty. Operand 20881 states and 63949 transitions. [2019-12-18 20:50:11,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:50:11,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:11,696 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:11,696 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:11,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:11,696 INFO L82 PathProgramCache]: Analyzing trace with hash 158811229, now seen corresponding path program 1 times [2019-12-18 20:50:11,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:11,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359540112] [2019-12-18 20:50:11,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:11,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:11,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359540112] [2019-12-18 20:50:11,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:11,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 20:50:11,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268804016] [2019-12-18 20:50:11,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:50:11,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:11,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:50:11,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:50:11,951 INFO L87 Difference]: Start difference. First operand 20881 states and 63949 transitions. Second operand 11 states. [2019-12-18 20:50:15,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:15,173 INFO L93 Difference]: Finished difference Result 36449 states and 109069 transitions. [2019-12-18 20:50:15,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 20:50:15,174 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 20:50:15,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:15,236 INFO L225 Difference]: With dead ends: 36449 [2019-12-18 20:50:15,237 INFO L226 Difference]: Without dead ends: 36449 [2019-12-18 20:50:15,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=278, Invalid=1204, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 20:50:15,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36449 states. [2019-12-18 20:50:15,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36449 to 24833. [2019-12-18 20:50:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24833 states. [2019-12-18 20:50:15,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24833 states to 24833 states and 75838 transitions. [2019-12-18 20:50:15,703 INFO L78 Accepts]: Start accepts. Automaton has 24833 states and 75838 transitions. Word has length 66 [2019-12-18 20:50:15,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:15,703 INFO L462 AbstractCegarLoop]: Abstraction has 24833 states and 75838 transitions. [2019-12-18 20:50:15,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:50:15,703 INFO L276 IsEmpty]: Start isEmpty. Operand 24833 states and 75838 transitions. [2019-12-18 20:50:15,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:50:15,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:15,727 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:15,727 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:15,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:15,727 INFO L82 PathProgramCache]: Analyzing trace with hash 27554715, now seen corresponding path program 2 times [2019-12-18 20:50:15,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:15,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607482109] [2019-12-18 20:50:15,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:15,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607482109] [2019-12-18 20:50:15,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:15,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:50:15,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677266355] [2019-12-18 20:50:15,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:50:15,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:15,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:50:15,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:15,800 INFO L87 Difference]: Start difference. First operand 24833 states and 75838 transitions. Second operand 3 states. [2019-12-18 20:50:15,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:15,884 INFO L93 Difference]: Finished difference Result 24832 states and 75836 transitions. [2019-12-18 20:50:15,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:50:15,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 20:50:15,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:15,917 INFO L225 Difference]: With dead ends: 24832 [2019-12-18 20:50:15,918 INFO L226 Difference]: Without dead ends: 24832 [2019-12-18 20:50:15,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:15,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24832 states. [2019-12-18 20:50:16,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24832 to 17283. [2019-12-18 20:50:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17283 states. [2019-12-18 20:50:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17283 states to 17283 states and 53446 transitions. [2019-12-18 20:50:16,226 INFO L78 Accepts]: Start accepts. Automaton has 17283 states and 53446 transitions. Word has length 66 [2019-12-18 20:50:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:16,227 INFO L462 AbstractCegarLoop]: Abstraction has 17283 states and 53446 transitions. [2019-12-18 20:50:16,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:50:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 17283 states and 53446 transitions. [2019-12-18 20:50:16,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:50:16,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:16,244 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:16,244 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:16,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:16,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1309527475, now seen corresponding path program 1 times [2019-12-18 20:50:16,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:16,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64093411] [2019-12-18 20:50:16,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:17,029 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 13 [2019-12-18 20:50:17,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:17,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64093411] [2019-12-18 20:50:17,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:17,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 20:50:17,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128261900] [2019-12-18 20:50:17,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 20:50:17,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:17,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 20:50:17,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-12-18 20:50:17,196 INFO L87 Difference]: Start difference. First operand 17283 states and 53446 transitions. Second operand 16 states. [2019-12-18 20:50:21,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:21,576 INFO L93 Difference]: Finished difference Result 38328 states and 116295 transitions. [2019-12-18 20:50:21,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 20:50:21,576 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 20:50:21,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:21,613 INFO L225 Difference]: With dead ends: 38328 [2019-12-18 20:50:21,613 INFO L226 Difference]: Without dead ends: 25531 [2019-12-18 20:50:21,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=390, Invalid=1772, Unknown=0, NotChecked=0, Total=2162 [2019-12-18 20:50:21,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25531 states. [2019-12-18 20:50:21,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25531 to 19257. [2019-12-18 20:50:21,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19257 states. [2019-12-18 20:50:21,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19257 states to 19257 states and 59364 transitions. [2019-12-18 20:50:21,930 INFO L78 Accepts]: Start accepts. Automaton has 19257 states and 59364 transitions. Word has length 67 [2019-12-18 20:50:21,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:21,930 INFO L462 AbstractCegarLoop]: Abstraction has 19257 states and 59364 transitions. [2019-12-18 20:50:21,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 20:50:21,930 INFO L276 IsEmpty]: Start isEmpty. Operand 19257 states and 59364 transitions. [2019-12-18 20:50:21,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:50:21,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:21,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:21,950 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:21,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:21,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1532450363, now seen corresponding path program 2 times [2019-12-18 20:50:21,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:21,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877064909] [2019-12-18 20:50:21,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:22,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:22,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877064909] [2019-12-18 20:50:22,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:22,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 20:50:22,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84228372] [2019-12-18 20:50:22,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 20:50:22,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:22,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 20:50:22,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-18 20:50:22,869 INFO L87 Difference]: Start difference. First operand 19257 states and 59364 transitions. Second operand 19 states. [2019-12-18 20:50:30,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:30,336 INFO L93 Difference]: Finished difference Result 32631 states and 99453 transitions. [2019-12-18 20:50:30,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-18 20:50:30,336 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-18 20:50:30,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:30,373 INFO L225 Difference]: With dead ends: 32631 [2019-12-18 20:50:30,374 INFO L226 Difference]: Without dead ends: 25499 [2019-12-18 20:50:30,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=514, Invalid=2908, Unknown=0, NotChecked=0, Total=3422 [2019-12-18 20:50:30,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25499 states. [2019-12-18 20:50:30,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25499 to 19839. [2019-12-18 20:50:30,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19839 states. [2019-12-18 20:50:30,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19839 states to 19839 states and 60727 transitions. [2019-12-18 20:50:30,715 INFO L78 Accepts]: Start accepts. Automaton has 19839 states and 60727 transitions. Word has length 67 [2019-12-18 20:50:30,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:30,715 INFO L462 AbstractCegarLoop]: Abstraction has 19839 states and 60727 transitions. [2019-12-18 20:50:30,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 20:50:30,716 INFO L276 IsEmpty]: Start isEmpty. Operand 19839 states and 60727 transitions. [2019-12-18 20:50:30,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:50:30,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:30,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:30,738 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:30,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:30,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2146626547, now seen corresponding path program 3 times [2019-12-18 20:50:30,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:30,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680903505] [2019-12-18 20:50:30,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:31,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:31,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680903505] [2019-12-18 20:50:31,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:31,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 20:50:31,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702411457] [2019-12-18 20:50:31,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 20:50:31,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:31,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 20:50:31,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:50:31,068 INFO L87 Difference]: Start difference. First operand 19839 states and 60727 transitions. Second operand 14 states. [2019-12-18 20:50:36,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:36,871 INFO L93 Difference]: Finished difference Result 40286 states and 121136 transitions. [2019-12-18 20:50:36,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-12-18 20:50:36,872 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-18 20:50:36,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:36,916 INFO L225 Difference]: With dead ends: 40286 [2019-12-18 20:50:36,916 INFO L226 Difference]: Without dead ends: 33371 [2019-12-18 20:50:36,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1555 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=773, Invalid=4483, Unknown=0, NotChecked=0, Total=5256 [2019-12-18 20:50:37,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33371 states. [2019-12-18 20:50:37,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33371 to 25132. [2019-12-18 20:50:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25132 states. [2019-12-18 20:50:37,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25132 states to 25132 states and 76113 transitions. [2019-12-18 20:50:37,322 INFO L78 Accepts]: Start accepts. Automaton has 25132 states and 76113 transitions. Word has length 67 [2019-12-18 20:50:37,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:37,322 INFO L462 AbstractCegarLoop]: Abstraction has 25132 states and 76113 transitions. [2019-12-18 20:50:37,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 20:50:37,323 INFO L276 IsEmpty]: Start isEmpty. Operand 25132 states and 76113 transitions. [2019-12-18 20:50:37,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:50:37,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:37,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:37,350 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:37,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:37,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1426167887, now seen corresponding path program 4 times [2019-12-18 20:50:37,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:37,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985661970] [2019-12-18 20:50:37,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:37,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985661970] [2019-12-18 20:50:37,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:37,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 20:50:37,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191351206] [2019-12-18 20:50:37,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 20:50:37,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:37,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 20:50:37,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:50:37,614 INFO L87 Difference]: Start difference. First operand 25132 states and 76113 transitions. Second operand 14 states. [2019-12-18 20:50:41,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:41,790 INFO L93 Difference]: Finished difference Result 38417 states and 115882 transitions. [2019-12-18 20:50:41,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 20:50:41,791 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-18 20:50:41,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:41,826 INFO L225 Difference]: With dead ends: 38417 [2019-12-18 20:50:41,826 INFO L226 Difference]: Without dead ends: 25016 [2019-12-18 20:50:41,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=468, Invalid=2082, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 20:50:41,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25016 states. [2019-12-18 20:50:42,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25016 to 19588. [2019-12-18 20:50:42,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19588 states. [2019-12-18 20:50:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19588 states to 19588 states and 59969 transitions. [2019-12-18 20:50:42,299 INFO L78 Accepts]: Start accepts. Automaton has 19588 states and 59969 transitions. Word has length 67 [2019-12-18 20:50:42,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:42,299 INFO L462 AbstractCegarLoop]: Abstraction has 19588 states and 59969 transitions. [2019-12-18 20:50:42,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 20:50:42,299 INFO L276 IsEmpty]: Start isEmpty. Operand 19588 states and 59969 transitions. [2019-12-18 20:50:42,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:50:42,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:42,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:42,319 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:42,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:42,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1973635833, now seen corresponding path program 5 times [2019-12-18 20:50:42,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:42,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962442115] [2019-12-18 20:50:42,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:42,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:42,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962442115] [2019-12-18 20:50:42,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:42,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:50:42,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106006896] [2019-12-18 20:50:42,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:50:42,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:42,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:50:42,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:50:42,382 INFO L87 Difference]: Start difference. First operand 19588 states and 59969 transitions. Second operand 7 states. [2019-12-18 20:50:42,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:42,782 INFO L93 Difference]: Finished difference Result 45897 states and 139416 transitions. [2019-12-18 20:50:42,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:50:42,782 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-18 20:50:42,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:42,829 INFO L225 Difference]: With dead ends: 45897 [2019-12-18 20:50:42,829 INFO L226 Difference]: Without dead ends: 34690 [2019-12-18 20:50:42,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:50:42,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34690 states. [2019-12-18 20:50:43,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34690 to 20098. [2019-12-18 20:50:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20098 states. [2019-12-18 20:50:43,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20098 states to 20098 states and 61590 transitions. [2019-12-18 20:50:43,200 INFO L78 Accepts]: Start accepts. Automaton has 20098 states and 61590 transitions. Word has length 67 [2019-12-18 20:50:43,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:43,200 INFO L462 AbstractCegarLoop]: Abstraction has 20098 states and 61590 transitions. [2019-12-18 20:50:43,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:50:43,201 INFO L276 IsEmpty]: Start isEmpty. Operand 20098 states and 61590 transitions. [2019-12-18 20:50:43,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:50:43,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:43,219 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:43,220 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:43,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:43,220 INFO L82 PathProgramCache]: Analyzing trace with hash 776047703, now seen corresponding path program 6 times [2019-12-18 20:50:43,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:43,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135835549] [2019-12-18 20:50:43,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:43,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:43,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135835549] [2019-12-18 20:50:43,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:43,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 20:50:43,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757945863] [2019-12-18 20:50:43,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 20:50:43,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:43,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 20:50:43,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-18 20:50:43,829 INFO L87 Difference]: Start difference. First operand 20098 states and 61590 transitions. Second operand 19 states. [2019-12-18 20:50:47,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:47,700 INFO L93 Difference]: Finished difference Result 28696 states and 86322 transitions. [2019-12-18 20:50:47,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-18 20:50:47,701 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-18 20:50:47,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:47,738 INFO L225 Difference]: With dead ends: 28696 [2019-12-18 20:50:47,738 INFO L226 Difference]: Without dead ends: 26983 [2019-12-18 20:50:47,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=362, Invalid=1618, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 20:50:47,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26983 states. [2019-12-18 20:50:48,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26983 to 20020. [2019-12-18 20:50:48,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20020 states. [2019-12-18 20:50:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20020 states to 20020 states and 61386 transitions. [2019-12-18 20:50:48,058 INFO L78 Accepts]: Start accepts. Automaton has 20020 states and 61386 transitions. Word has length 67 [2019-12-18 20:50:48,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:48,059 INFO L462 AbstractCegarLoop]: Abstraction has 20020 states and 61386 transitions. [2019-12-18 20:50:48,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 20:50:48,059 INFO L276 IsEmpty]: Start isEmpty. Operand 20020 states and 61386 transitions. [2019-12-18 20:50:48,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:50:48,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:48,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:48,245 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:48,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:48,245 INFO L82 PathProgramCache]: Analyzing trace with hash -221370411, now seen corresponding path program 7 times [2019-12-18 20:50:48,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:48,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288556972] [2019-12-18 20:50:48,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:48,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288556972] [2019-12-18 20:50:48,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:48,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:50:48,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809568808] [2019-12-18 20:50:48,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:50:48,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:48,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:50:48,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:50:48,491 INFO L87 Difference]: Start difference. First operand 20020 states and 61386 transitions. Second operand 11 states. [2019-12-18 20:50:49,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:49,627 INFO L93 Difference]: Finished difference Result 26111 states and 79625 transitions. [2019-12-18 20:50:49,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 20:50:49,628 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 20:50:49,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:49,660 INFO L225 Difference]: With dead ends: 26111 [2019-12-18 20:50:49,660 INFO L226 Difference]: Without dead ends: 23242 [2019-12-18 20:50:49,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-12-18 20:50:49,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23242 states. [2019-12-18 20:50:49,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23242 to 19800. [2019-12-18 20:50:49,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19800 states. [2019-12-18 20:50:49,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19800 states to 19800 states and 60770 transitions. [2019-12-18 20:50:49,956 INFO L78 Accepts]: Start accepts. Automaton has 19800 states and 60770 transitions. Word has length 67 [2019-12-18 20:50:49,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:49,956 INFO L462 AbstractCegarLoop]: Abstraction has 19800 states and 60770 transitions. [2019-12-18 20:50:49,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:50:49,956 INFO L276 IsEmpty]: Start isEmpty. Operand 19800 states and 60770 transitions. [2019-12-18 20:50:49,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:50:49,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:49,975 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:49,975 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:49,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:49,976 INFO L82 PathProgramCache]: Analyzing trace with hash -781205229, now seen corresponding path program 8 times [2019-12-18 20:50:49,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:49,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065620330] [2019-12-18 20:50:49,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:50,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:50,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065620330] [2019-12-18 20:50:50,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:50,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:50:50,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657037174] [2019-12-18 20:50:50,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:50:50,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:50,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:50:50,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:50:50,174 INFO L87 Difference]: Start difference. First operand 19800 states and 60770 transitions. Second operand 11 states. [2019-12-18 20:50:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:51,404 INFO L93 Difference]: Finished difference Result 26851 states and 81745 transitions. [2019-12-18 20:50:51,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 20:50:51,405 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 20:50:51,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:51,437 INFO L225 Difference]: With dead ends: 26851 [2019-12-18 20:50:51,438 INFO L226 Difference]: Without dead ends: 24043 [2019-12-18 20:50:51,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-18 20:50:51,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24043 states. [2019-12-18 20:50:51,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24043 to 19682. [2019-12-18 20:50:51,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19682 states. [2019-12-18 20:50:51,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19682 states to 19682 states and 60466 transitions. [2019-12-18 20:50:51,752 INFO L78 Accepts]: Start accepts. Automaton has 19682 states and 60466 transitions. Word has length 67 [2019-12-18 20:50:51,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:51,752 INFO L462 AbstractCegarLoop]: Abstraction has 19682 states and 60466 transitions. [2019-12-18 20:50:51,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:50:51,752 INFO L276 IsEmpty]: Start isEmpty. Operand 19682 states and 60466 transitions. [2019-12-18 20:50:51,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:50:51,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:51,772 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:51,773 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:51,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:51,773 INFO L82 PathProgramCache]: Analyzing trace with hash -185379867, now seen corresponding path program 9 times [2019-12-18 20:50:51,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:51,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098995788] [2019-12-18 20:50:51,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:50:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:50:51,892 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:50:51,892 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:50:51,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$r_buff1_thd2~0_19) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd0~0_24) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t657~0.base_21| 4) |v_#length_21|) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_cnt~0_20) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t657~0.base_21| 1)) (= |v_#NULL.offset_6| 0) (= 0 |v_ULTIMATE.start_main_~#t657~0.offset_16|) (= 0 v_~z$flush_delayed~0_13) (= v_~__unbuffered_p2_EBX~0_16 0) (= 0 v_~z$r_buff1_thd3~0_52) (= 0 v_~z$r_buff1_thd1~0_18) (= v_~x~0_10 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t657~0.base_21|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t657~0.base_21|)) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~z$w_buff1_used~0_73) (= v_~y~0_15 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~z$r_buff0_thd1~0_27 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd3~0_80 0) (= v_~main$tmp_guard1~0_14 0) (= v_~z~0_27 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t657~0.base_21| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t657~0.base_21|) |v_ULTIMATE.start_main_~#t657~0.offset_16| 0)) |v_#memory_int_19|) (= 0 v_~z$w_buff0~0_25) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~z$r_buff0_thd2~0_21 0) (= v_~z$w_buff0_used~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t658~0.offset=|v_ULTIMATE.start_main_~#t658~0.offset_15|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start_main_~#t659~0.base=|v_ULTIMATE.start_main_~#t659~0.base_19|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_~#t658~0.base=|v_ULTIMATE.start_main_~#t658~0.base_20|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_8, ULTIMATE.start_main_~#t657~0.base=|v_ULTIMATE.start_main_~#t657~0.base_21|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t657~0.offset=|v_ULTIMATE.start_main_~#t657~0.offset_16|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_18, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_80, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_10, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ULTIMATE.start_main_~#t659~0.offset=|v_ULTIMATE.start_main_~#t659~0.offset_15|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t658~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t659~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t658~0.base, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t657~0.base, ULTIMATE.start_main_~#t657~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t659~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:50:51,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd0~0_16 v_~z$r_buff1_thd0~0_11) (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff1_thd3~0_33) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_18 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6)) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_5) (= v_~z$r_buff0_thd1~0_19 v_~z$r_buff1_thd1~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_19, ~x~0=v_~x~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_18, ~x~0=v_~x~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:50:51,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L825-1-->L827: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t658~0.base_11| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t658~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t658~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t658~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t658~0.base_11|) |v_ULTIMATE.start_main_~#t658~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t658~0.base_11| 1) |v_#valid_31|) (= 0 |v_ULTIMATE.start_main_~#t658~0.offset_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t658~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t658~0.offset=|v_ULTIMATE.start_main_~#t658~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t658~0.base=|v_ULTIMATE.start_main_~#t658~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t658~0.offset, ULTIMATE.start_main_~#t658~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 20:50:51,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L827-1-->L829: Formula: (and (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t659~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t659~0.offset_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t659~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t659~0.base_12|) |v_ULTIMATE.start_main_~#t659~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t659~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t659~0.base_12| 0)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t659~0.base_12| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t659~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t659~0.offset=|v_ULTIMATE.start_main_~#t659~0.offset_10|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t659~0.base=|v_ULTIMATE.start_main_~#t659~0.base_12|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t659~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t659~0.base, #length] because there is no mapped edge [2019-12-18 20:50:51,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1718619258 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1718619258 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out1718619258| |P1Thread1of1ForFork2_#t~ite10_Out1718619258|))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out1718619258| ~z$w_buff1~0_In1718619258) (not .cse1) .cse2) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out1718619258| ~z~0_In1718619258) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1718619258, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1718619258, ~z$w_buff1~0=~z$w_buff1~0_In1718619258, ~z~0=~z~0_In1718619258} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1718619258|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1718619258, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1718619258|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1718619258, ~z$w_buff1~0=~z$w_buff1~0_In1718619258, ~z~0=~z~0_In1718619258} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 20:50:51,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L792-->L792-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In952686961 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_Out952686961| ~z$w_buff1~0_In952686961) (= |P2Thread1of1ForFork0_#t~ite24_Out952686961| |P2Thread1of1ForFork0_#t~ite23_Out952686961|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In952686961 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In952686961 256) 0)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In952686961 256))) (= 0 (mod ~z$w_buff0_used~0_In952686961 256))))) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite24_Out952686961| ~z$w_buff1~0_In952686961) (= |P2Thread1of1ForFork0_#t~ite23_In952686961| |P2Thread1of1ForFork0_#t~ite23_Out952686961|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In952686961, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In952686961, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In952686961|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In952686961, ~z$w_buff1~0=~z$w_buff1~0_In952686961, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In952686961, ~weak$$choice2~0=~weak$$choice2~0_In952686961} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In952686961, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out952686961|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In952686961, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out952686961|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In952686961, ~z$w_buff1~0=~z$w_buff1~0_In952686961, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In952686961, ~weak$$choice2~0=~weak$$choice2~0_In952686961} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 20:50:51,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L794-->L794-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1017164919 256))) (.cse4 (= 0 (mod ~z$w_buff1_used~0_In-1017164919 256))) (.cse6 (= 0 (mod ~z$r_buff0_thd3~0_In-1017164919 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-1017164919 256) 0)) (.cse5 (= 0 (mod ~z$w_buff0_used~0_In-1017164919 256))) (.cse3 (= |P2Thread1of1ForFork0_#t~ite29_Out-1017164919| |P2Thread1of1ForFork0_#t~ite30_Out-1017164919|))) (or (let ((.cse1 (not .cse6))) (and (= |P2Thread1of1ForFork0_#t~ite29_Out-1017164919| |P2Thread1of1ForFork0_#t~ite28_Out-1017164919|) (= 0 |P2Thread1of1ForFork0_#t~ite28_Out-1017164919|) .cse0 (or .cse1 (not .cse2)) .cse3 (or .cse1 (not .cse4)) (not .cse5))) (and (or (and (= ~z$w_buff1_used~0_In-1017164919 |P2Thread1of1ForFork0_#t~ite30_Out-1017164919|) (= |P2Thread1of1ForFork0_#t~ite29_In-1017164919| |P2Thread1of1ForFork0_#t~ite29_Out-1017164919|) (not .cse0)) (and .cse0 (or (and .cse4 .cse6) (and .cse6 .cse2) .cse5) .cse3 (= ~z$w_buff1_used~0_In-1017164919 |P2Thread1of1ForFork0_#t~ite29_Out-1017164919|))) (= |P2Thread1of1ForFork0_#t~ite28_In-1017164919| |P2Thread1of1ForFork0_#t~ite28_Out-1017164919|)))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In-1017164919|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1017164919, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1017164919, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1017164919, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1017164919, ~weak$$choice2~0=~weak$$choice2~0_In-1017164919, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1017164919|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1017164919|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1017164919, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1017164919, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1017164919, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1017164919, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1017164919|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1017164919|, ~weak$$choice2~0=~weak$$choice2~0_In-1017164919} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 20:50:51,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L795-->L796: Formula: (and (= v_~z$r_buff0_thd3~0_57 v_~z$r_buff0_thd3~0_56) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_8|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_56, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 20:50:51,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (= v_~z~0_21 v_~z$mem_tmp~0_5) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 20:50:51,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In-354702341 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-354702341 256) 0)) (.cse1 (= |P2Thread1of1ForFork0_#t~ite39_Out-354702341| |P2Thread1of1ForFork0_#t~ite38_Out-354702341|))) (or (and (not .cse0) .cse1 (not .cse2) (= |P2Thread1of1ForFork0_#t~ite38_Out-354702341| ~z$w_buff1~0_In-354702341)) (and (or .cse2 .cse0) (= ~z~0_In-354702341 |P2Thread1of1ForFork0_#t~ite38_Out-354702341|) .cse1))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-354702341, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-354702341, ~z$w_buff1~0=~z$w_buff1~0_In-354702341, ~z~0=~z~0_In-354702341} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-354702341|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-354702341|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-354702341, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-354702341, ~z$w_buff1~0=~z$w_buff1~0_In-354702341, ~z~0=~z~0_In-354702341} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 20:50:51,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-525963930 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-525963930 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-525963930|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-525963930 |P2Thread1of1ForFork0_#t~ite40_Out-525963930|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-525963930, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-525963930} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-525963930, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-525963930|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-525963930} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 20:50:51,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd3~0_In1699827279 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1699827279 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1699827279 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1699827279 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out1699827279| ~z$w_buff1_used~0_In1699827279) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out1699827279| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1699827279, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1699827279, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1699827279, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1699827279} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1699827279, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1699827279, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1699827279, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1699827279, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1699827279|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 20:50:51,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1250468876 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1250468876 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-1250468876| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1250468876| ~z$r_buff0_thd3~0_In-1250468876)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1250468876, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1250468876} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1250468876, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1250468876, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1250468876|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 20:50:51,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1489014090 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1489014090 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1489014090 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1489014090 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-1489014090| 0)) (and (= ~z$r_buff1_thd3~0_In-1489014090 |P2Thread1of1ForFork0_#t~ite43_Out-1489014090|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1489014090, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1489014090, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1489014090, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1489014090} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1489014090|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1489014090, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1489014090, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1489014090, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1489014090} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 20:50:51,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_47 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_47, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 20:50:51,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1461148915 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1461148915 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out-1461148915| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-1461148915| ~z$w_buff0_used~0_In-1461148915) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1461148915, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1461148915} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1461148915|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1461148915, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1461148915} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 20:50:51,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1323849154 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1323849154 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1323849154 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-1323849154 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1323849154| ~z$w_buff1_used~0_In-1323849154) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1323849154| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1323849154, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1323849154, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1323849154, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1323849154} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1323849154, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1323849154|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1323849154, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1323849154, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1323849154} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 20:50:51,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1762115332 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1762115332 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-1762115332)) (and (= ~z$r_buff0_thd1~0_In-1762115332 ~z$r_buff0_thd1~0_Out-1762115332) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1762115332, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1762115332} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1762115332, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1762115332|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1762115332} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:50:51,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-1489881932 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1489881932 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1489881932 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1489881932 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1489881932| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite8_Out-1489881932| ~z$r_buff1_thd1~0_In-1489881932)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1489881932, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1489881932, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1489881932, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1489881932} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1489881932|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1489881932, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1489881932, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1489881932, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1489881932} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 20:50:51,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_13 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_13, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:50:51,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In2110712697 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In2110712697 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out2110712697| ~z$w_buff0_used~0_In2110712697) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out2110712697|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2110712697, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2110712697} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2110712697, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out2110712697|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2110712697} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 20:50:51,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1301095949 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1301095949 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1301095949 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1301095949 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1301095949 |P1Thread1of1ForFork2_#t~ite12_Out1301095949|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1301095949|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1301095949, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1301095949, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1301095949, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1301095949} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1301095949, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1301095949, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1301095949, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1301095949|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1301095949} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 20:50:51,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-1587142159 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1587142159 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In-1587142159 |P1Thread1of1ForFork2_#t~ite13_Out-1587142159|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1587142159|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1587142159, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1587142159} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1587142159, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1587142159|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1587142159} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 20:50:51,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-770443067 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-770443067 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-770443067 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-770443067 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-770443067 |P1Thread1of1ForFork2_#t~ite14_Out-770443067|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-770443067|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-770443067, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-770443067, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-770443067, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-770443067} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-770443067, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-770443067, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-770443067, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-770443067|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-770443067} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 20:50:51,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_15) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 20:50:51,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:50:51,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1421129402 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1421129402 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In-1421129402 |ULTIMATE.start_main_#t~ite47_Out-1421129402|) (not .cse1)) (and (= ~z~0_In-1421129402 |ULTIMATE.start_main_#t~ite47_Out-1421129402|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1421129402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1421129402, ~z$w_buff1~0=~z$w_buff1~0_In-1421129402, ~z~0=~z~0_In-1421129402} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1421129402, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1421129402|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1421129402, ~z$w_buff1~0=~z$w_buff1~0_In-1421129402, ~z~0=~z~0_In-1421129402} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 20:50:51,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_20 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-18 20:50:51,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1406290256 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1406290256 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out1406290256|) (not .cse1)) (and (= ~z$w_buff0_used~0_In1406290256 |ULTIMATE.start_main_#t~ite49_Out1406290256|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1406290256, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1406290256} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1406290256, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1406290256, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1406290256|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 20:50:51,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1117195476 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1117195476 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1117195476 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1117195476 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1117195476 |ULTIMATE.start_main_#t~ite50_Out1117195476|)) (and (= |ULTIMATE.start_main_#t~ite50_Out1117195476| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1117195476, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1117195476, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1117195476, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1117195476} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1117195476|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1117195476, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1117195476, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1117195476, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1117195476} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 20:50:51,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1041698144 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1041698144 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1041698144 |ULTIMATE.start_main_#t~ite51_Out1041698144|)) (and (= |ULTIMATE.start_main_#t~ite51_Out1041698144| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1041698144, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1041698144} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1041698144, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1041698144|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1041698144} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 20:50:51,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In1695750034 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1695750034 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1695750034 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1695750034 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1695750034|)) (and (= ~z$r_buff1_thd0~0_In1695750034 |ULTIMATE.start_main_#t~ite52_Out1695750034|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1695750034, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1695750034, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1695750034, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1695750034} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1695750034|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1695750034, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1695750034, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1695750034, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1695750034} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 20:50:51,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_7 2) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EBX~0_9 0) (= 2 v_~y~0_8) (= v_~main$tmp_guard1~0_6 0) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y~0=v_~y~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y~0=v_~y~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:50:52,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:50:52 BasicIcfg [2019-12-18 20:50:52,012 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:50:52,013 INFO L168 Benchmark]: Toolchain (without parser) took 125676.39 ms. Allocated memory was 138.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 20:50:52,017 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 20:50:52,017 INFO L168 Benchmark]: CACSL2BoogieTranslator took 744.03 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 156.5 MB in the end (delta: -56.2 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:50:52,018 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.30 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:50:52,018 INFO L168 Benchmark]: Boogie Preprocessor took 40.09 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:50:52,019 INFO L168 Benchmark]: RCFGBuilder took 874.53 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 100.7 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-18 20:50:52,019 INFO L168 Benchmark]: TraceAbstraction took 123948.09 ms. Allocated memory was 202.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.7 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 20:50:52,024 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 744.03 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 156.5 MB in the end (delta: -56.2 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.30 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.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 40.09 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 874.53 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 100.7 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 123948.09 ms. Allocated memory was 202.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.7 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 31 ChoiceCompositions, 6462 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 84223 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t657, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t658, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t659, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L794] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 123.6s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 53.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7010 SDtfs, 8086 SDslu, 24920 SDs, 0 SdLazy, 28706 SolverSat, 465 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 507 GetRequests, 46 SyntacticMatches, 27 SemanticMatches, 434 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4445 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162546occurred 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: 39.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 195484 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1423 NumberOfCodeBlocks, 1423 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1325 ConstructedInterpolants, 0 QuantifiedInterpolants, 373163 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...