/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:34:08,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:34:08,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:34:09,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:34:09,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:34:09,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:34:09,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:34:09,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:34:09,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:34:09,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:34:09,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:34:09,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:34:09,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:34:09,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:34:09,017 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:34:09,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:34:09,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:34:09,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:34:09,027 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:34:09,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:34:09,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:34:09,036 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:34:09,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:34:09,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:34:09,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:34:09,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:34:09,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:34:09,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:34:09,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:34:09,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:34:09,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:34:09,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:34:09,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:34:09,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:34:09,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:34:09,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:34:09,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:34:09,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:34:09,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:34:09,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:34:09,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:34:09,059 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:34:09,072 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:34:09,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:34:09,074 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:34:09,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:34:09,074 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:34:09,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:34:09,074 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:34:09,075 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:34:09,075 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:34:09,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:34:09,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:34:09,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:34:09,076 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:34:09,076 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:34:09,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:34:09,076 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:34:09,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:34:09,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:34:09,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:34:09,077 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:34:09,077 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:34:09,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:34:09,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:34:09,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:34:09,078 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:34:09,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:34:09,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:34:09,078 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:34:09,079 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:34:09,079 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:34:09,359 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:34:09,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:34:09,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:34:09,376 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:34:09,376 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:34:09,377 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.oepc.i [2019-12-18 12:34:09,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da145effc/c095e86a5d5f41df8c3ceecad9abb5fc/FLAG83087af40 [2019-12-18 12:34:09,942 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:34:09,943 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_pso.oepc.i [2019-12-18 12:34:09,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da145effc/c095e86a5d5f41df8c3ceecad9abb5fc/FLAG83087af40 [2019-12-18 12:34:10,251 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da145effc/c095e86a5d5f41df8c3ceecad9abb5fc [2019-12-18 12:34:10,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:34:10,263 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:34:10,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:34:10,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:34:10,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:34:10,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:34:10" (1/1) ... [2019-12-18 12:34:10,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7669ec16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:10, skipping insertion in model container [2019-12-18 12:34:10,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:34:10" (1/1) ... [2019-12-18 12:34:10,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:34:10,341 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:34:10,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:34:10,822 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:34:10,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:34:11,010 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:34:11,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:11 WrapperNode [2019-12-18 12:34:11,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:34:11,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:34:11,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:34:11,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:34:11,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:11" (1/1) ... [2019-12-18 12:34:11,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:11" (1/1) ... [2019-12-18 12:34:11,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:34:11,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:34:11,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:34:11,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:34:11,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:11" (1/1) ... [2019-12-18 12:34:11,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:11" (1/1) ... [2019-12-18 12:34:11,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:11" (1/1) ... [2019-12-18 12:34:11,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:11" (1/1) ... [2019-12-18 12:34:11,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:11" (1/1) ... [2019-12-18 12:34:11,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:11" (1/1) ... [2019-12-18 12:34:11,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:11" (1/1) ... [2019-12-18 12:34:11,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:34:11,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:34:11,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:34:11,120 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:34:11,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:34:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:34:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:34:11,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:34:11,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:34:11,208 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:34:11,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:34:11,209 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:34:11,210 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:34:11,210 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:34:11,211 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:34:11,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:34:11,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:34:11,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:34:11,214 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 12:34:12,166 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:34:12,167 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:34:12,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:34:12 BoogieIcfgContainer [2019-12-18 12:34:12,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:34:12,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:34:12,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:34:12,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:34:12,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:34:10" (1/3) ... [2019-12-18 12:34:12,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2f5c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:34:12, skipping insertion in model container [2019-12-18 12:34:12,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:11" (2/3) ... [2019-12-18 12:34:12,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2f5c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:34:12, skipping insertion in model container [2019-12-18 12:34:12,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:34:12" (3/3) ... [2019-12-18 12:34:12,177 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_pso.oepc.i [2019-12-18 12:34:12,188 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:34:12,188 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:34:12,196 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:34:12,197 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:34:12,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,251 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,253 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,253 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,254 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,254 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,265 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,266 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,297 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,297 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,329 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,331 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,338 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,338 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,339 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,344 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,344 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:12,370 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:34:12,392 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:34:12,392 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:34:12,392 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:34:12,392 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:34:12,392 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:34:12,393 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:34:12,393 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:34:12,393 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:34:12,409 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-18 12:34:12,411 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 12:34:12,506 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 12:34:12,506 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:34:12,529 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:34:12,563 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 12:34:12,658 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 12:34:12,658 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:34:12,669 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:34:12,692 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:34:12,694 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:34:18,072 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-12-18 12:34:18,205 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-12-18 12:34:18,451 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 12:34:18,616 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 12:34:18,644 INFO L206 etLargeBlockEncoding]: Checked pairs total: 89688 [2019-12-18 12:34:18,644 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-18 12:34:18,648 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-18 12:34:35,067 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106864 states. [2019-12-18 12:34:35,069 INFO L276 IsEmpty]: Start isEmpty. Operand 106864 states. [2019-12-18 12:34:35,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:34:35,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:35,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:34:35,076 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 12:34:35,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:35,081 INFO L82 PathProgramCache]: Analyzing trace with hash 921701, now seen corresponding path program 1 times [2019-12-18 12:34:35,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:35,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359067644] [2019-12-18 12:34:35,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:35,296 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 12:34:35,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359067644] [2019-12-18 12:34:35,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:35,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:34:35,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575375927] [2019-12-18 12:34:35,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:34:35,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:35,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:34:35,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:35,326 INFO L87 Difference]: Start difference. First operand 106864 states. Second operand 3 states. [2019-12-18 12:34:38,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:38,894 INFO L93 Difference]: Finished difference Result 106034 states and 453004 transitions. [2019-12-18 12:34:38,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:34:38,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:34:38,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:39,492 INFO L225 Difference]: With dead ends: 106034 [2019-12-18 12:34:39,492 INFO L226 Difference]: Without dead ends: 99950 [2019-12-18 12:34:39,494 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 12:34:43,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99950 states. [2019-12-18 12:34:45,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99950 to 99950. [2019-12-18 12:34:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99950 states. [2019-12-18 12:34:46,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99950 states to 99950 states and 426445 transitions. [2019-12-18 12:34:46,374 INFO L78 Accepts]: Start accepts. Automaton has 99950 states and 426445 transitions. Word has length 3 [2019-12-18 12:34:46,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:46,374 INFO L462 AbstractCegarLoop]: Abstraction has 99950 states and 426445 transitions. [2019-12-18 12:34:46,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:34:46,375 INFO L276 IsEmpty]: Start isEmpty. Operand 99950 states and 426445 transitions. [2019-12-18 12:34:46,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:34:46,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:46,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:46,379 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 12:34:46,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:46,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1680645281, now seen corresponding path program 1 times [2019-12-18 12:34:46,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:46,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397505608] [2019-12-18 12:34:46,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:49,628 WARN L192 SmtUtils]: Spent 3.12 s on a formula simplification that was a NOOP. DAG size: 5 [2019-12-18 12:34:49,630 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 12:34:49,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397505608] [2019-12-18 12:34:49,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:49,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:34:49,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608723373] [2019-12-18 12:34:49,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:34:49,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:49,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:34:49,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:34:49,636 INFO L87 Difference]: Start difference. First operand 99950 states and 426445 transitions. Second operand 4 states. [2019-12-18 12:34:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:50,977 INFO L93 Difference]: Finished difference Result 159384 states and 652094 transitions. [2019-12-18 12:34:50,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:34:50,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:34:50,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:51,566 INFO L225 Difference]: With dead ends: 159384 [2019-12-18 12:34:51,566 INFO L226 Difference]: Without dead ends: 159335 [2019-12-18 12:34:51,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:34:56,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159335 states. [2019-12-18 12:35:03,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159335 to 143879. [2019-12-18 12:35:03,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143879 states. [2019-12-18 12:35:04,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143879 states to 143879 states and 597281 transitions. [2019-12-18 12:35:04,241 INFO L78 Accepts]: Start accepts. Automaton has 143879 states and 597281 transitions. Word has length 11 [2019-12-18 12:35:04,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:04,241 INFO L462 AbstractCegarLoop]: Abstraction has 143879 states and 597281 transitions. [2019-12-18 12:35:04,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:35:04,241 INFO L276 IsEmpty]: Start isEmpty. Operand 143879 states and 597281 transitions. [2019-12-18 12:35:04,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:35:04,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:04,247 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:04,248 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 12:35:04,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:04,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1535099311, now seen corresponding path program 1 times [2019-12-18 12:35:04,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:04,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566894579] [2019-12-18 12:35:04,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:04,393 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 12:35:04,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566894579] [2019-12-18 12:35:04,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:04,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:35:04,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611653266] [2019-12-18 12:35:04,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:35:04,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:04,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:35:04,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:35:04,395 INFO L87 Difference]: Start difference. First operand 143879 states and 597281 transitions. Second operand 4 states. [2019-12-18 12:35:04,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:04,680 INFO L93 Difference]: Finished difference Result 42595 states and 146341 transitions. [2019-12-18 12:35:04,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:35:04,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 12:35:04,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:04,748 INFO L225 Difference]: With dead ends: 42595 [2019-12-18 12:35:04,748 INFO L226 Difference]: Without dead ends: 32718 [2019-12-18 12:35:04,749 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 12:35:04,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32718 states. [2019-12-18 12:35:09,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32718 to 32622. [2019-12-18 12:35:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32622 states. [2019-12-18 12:35:10,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32622 states to 32622 states and 106518 transitions. [2019-12-18 12:35:10,022 INFO L78 Accepts]: Start accepts. Automaton has 32622 states and 106518 transitions. Word has length 13 [2019-12-18 12:35:10,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:10,023 INFO L462 AbstractCegarLoop]: Abstraction has 32622 states and 106518 transitions. [2019-12-18 12:35:10,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:35:10,023 INFO L276 IsEmpty]: Start isEmpty. Operand 32622 states and 106518 transitions. [2019-12-18 12:35:10,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:35:10,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:10,026 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:10,026 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 12:35:10,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:10,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1228744872, now seen corresponding path program 1 times [2019-12-18 12:35:10,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:10,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092059178] [2019-12-18 12:35:10,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:10,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:10,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092059178] [2019-12-18 12:35:10,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:10,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:35:10,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023893147] [2019-12-18 12:35:10,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:35:10,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:10,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:35:10,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:35:10,118 INFO L87 Difference]: Start difference. First operand 32622 states and 106518 transitions. Second operand 4 states. [2019-12-18 12:35:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:10,500 INFO L93 Difference]: Finished difference Result 41342 states and 134101 transitions. [2019-12-18 12:35:10,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:35:10,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:35:10,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:10,568 INFO L225 Difference]: With dead ends: 41342 [2019-12-18 12:35:10,568 INFO L226 Difference]: Without dead ends: 41342 [2019-12-18 12:35:10,568 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 12:35:10,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41342 states. [2019-12-18 12:35:11,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41342 to 37015. [2019-12-18 12:35:11,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37015 states. [2019-12-18 12:35:11,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37015 states to 37015 states and 120557 transitions. [2019-12-18 12:35:11,213 INFO L78 Accepts]: Start accepts. Automaton has 37015 states and 120557 transitions. Word has length 16 [2019-12-18 12:35:11,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:11,213 INFO L462 AbstractCegarLoop]: Abstraction has 37015 states and 120557 transitions. [2019-12-18 12:35:11,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:35:11,213 INFO L276 IsEmpty]: Start isEmpty. Operand 37015 states and 120557 transitions. [2019-12-18 12:35:11,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:35:11,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:11,215 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:11,216 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 12:35:11,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:11,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1228651655, now seen corresponding path program 1 times [2019-12-18 12:35:11,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:11,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571426872] [2019-12-18 12:35:11,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:11,300 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 12:35:11,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571426872] [2019-12-18 12:35:11,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:11,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:35:11,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533182120] [2019-12-18 12:35:11,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:35:11,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:11,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:35:11,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:35:11,302 INFO L87 Difference]: Start difference. First operand 37015 states and 120557 transitions. Second operand 4 states. [2019-12-18 12:35:12,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:12,003 INFO L93 Difference]: Finished difference Result 44892 states and 145334 transitions. [2019-12-18 12:35:12,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:35:12,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:35:12,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:12,074 INFO L225 Difference]: With dead ends: 44892 [2019-12-18 12:35:12,074 INFO L226 Difference]: Without dead ends: 44892 [2019-12-18 12:35:12,074 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 12:35:12,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44892 states. [2019-12-18 12:35:12,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44892 to 36810. [2019-12-18 12:35:12,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36810 states. [2019-12-18 12:35:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36810 states to 36810 states and 119696 transitions. [2019-12-18 12:35:12,724 INFO L78 Accepts]: Start accepts. Automaton has 36810 states and 119696 transitions. Word has length 16 [2019-12-18 12:35:12,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:12,725 INFO L462 AbstractCegarLoop]: Abstraction has 36810 states and 119696 transitions. [2019-12-18 12:35:12,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:35:12,725 INFO L276 IsEmpty]: Start isEmpty. Operand 36810 states and 119696 transitions. [2019-12-18 12:35:12,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:35:12,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:12,735 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 12:35:12,735 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 12:35:12,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:12,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1838789338, now seen corresponding path program 1 times [2019-12-18 12:35:12,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:12,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251054388] [2019-12-18 12:35:12,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:12,825 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 12:35:12,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251054388] [2019-12-18 12:35:12,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:12,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:35:12,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986948381] [2019-12-18 12:35:12,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:35:12,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:12,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:35:12,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:35:12,829 INFO L87 Difference]: Start difference. First operand 36810 states and 119696 transitions. Second operand 5 states. [2019-12-18 12:35:13,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:13,498 INFO L93 Difference]: Finished difference Result 55448 states and 177239 transitions. [2019-12-18 12:35:13,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:35:13,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:35:13,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:13,594 INFO L225 Difference]: With dead ends: 55448 [2019-12-18 12:35:13,595 INFO L226 Difference]: Without dead ends: 55392 [2019-12-18 12:35:13,595 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 12:35:13,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55392 states. [2019-12-18 12:35:14,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55392 to 38696. [2019-12-18 12:35:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38696 states. [2019-12-18 12:35:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38696 states to 38696 states and 125822 transitions. [2019-12-18 12:35:14,728 INFO L78 Accepts]: Start accepts. Automaton has 38696 states and 125822 transitions. Word has length 22 [2019-12-18 12:35:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:14,729 INFO L462 AbstractCegarLoop]: Abstraction has 38696 states and 125822 transitions. [2019-12-18 12:35:14,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:35:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 38696 states and 125822 transitions. [2019-12-18 12:35:14,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:35:14,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:14,739 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 12:35:14,739 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 12:35:14,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:14,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1838882555, now seen corresponding path program 1 times [2019-12-18 12:35:14,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:14,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964053614] [2019-12-18 12:35:14,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:14,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:14,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964053614] [2019-12-18 12:35:14,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:14,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:35:14,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570483251] [2019-12-18 12:35:14,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:35:14,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:14,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:35:14,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:35:14,852 INFO L87 Difference]: Start difference. First operand 38696 states and 125822 transitions. Second operand 5 states. [2019-12-18 12:35:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:15,541 INFO L93 Difference]: Finished difference Result 57418 states and 182937 transitions. [2019-12-18 12:35:15,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:35:15,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:35:15,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:15,647 INFO L225 Difference]: With dead ends: 57418 [2019-12-18 12:35:15,647 INFO L226 Difference]: Without dead ends: 57362 [2019-12-18 12:35:15,647 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 12:35:15,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57362 states. [2019-12-18 12:35:16,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57362 to 36190. [2019-12-18 12:35:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36190 states. [2019-12-18 12:35:17,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36190 states to 36190 states and 117443 transitions. [2019-12-18 12:35:17,029 INFO L78 Accepts]: Start accepts. Automaton has 36190 states and 117443 transitions. Word has length 22 [2019-12-18 12:35:17,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:17,030 INFO L462 AbstractCegarLoop]: Abstraction has 36190 states and 117443 transitions. [2019-12-18 12:35:17,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:35:17,030 INFO L276 IsEmpty]: Start isEmpty. Operand 36190 states and 117443 transitions. [2019-12-18 12:35:17,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:35:17,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:17,042 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 12:35:17,043 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 12:35:17,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:17,043 INFO L82 PathProgramCache]: Analyzing trace with hash 320469370, now seen corresponding path program 1 times [2019-12-18 12:35:17,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:17,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806684709] [2019-12-18 12:35:17,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:17,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806684709] [2019-12-18 12:35:17,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:17,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:35:17,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806547198] [2019-12-18 12:35:17,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:35:17,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:17,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:35:17,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:35:17,180 INFO L87 Difference]: Start difference. First operand 36190 states and 117443 transitions. Second operand 5 states. [2019-12-18 12:35:17,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:17,848 INFO L93 Difference]: Finished difference Result 50960 states and 161781 transitions. [2019-12-18 12:35:17,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:35:17,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 12:35:17,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:17,995 INFO L225 Difference]: With dead ends: 50960 [2019-12-18 12:35:17,995 INFO L226 Difference]: Without dead ends: 50947 [2019-12-18 12:35:17,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 3 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 12:35:18,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50947 states. [2019-12-18 12:35:18,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50947 to 41982. [2019-12-18 12:35:18,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41982 states. [2019-12-18 12:35:18,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41982 states to 41982 states and 135844 transitions. [2019-12-18 12:35:18,993 INFO L78 Accepts]: Start accepts. Automaton has 41982 states and 135844 transitions. Word has length 25 [2019-12-18 12:35:18,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:18,994 INFO L462 AbstractCegarLoop]: Abstraction has 41982 states and 135844 transitions. [2019-12-18 12:35:18,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:35:18,994 INFO L276 IsEmpty]: Start isEmpty. Operand 41982 states and 135844 transitions. [2019-12-18 12:35:19,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:35:19,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:19,008 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 12:35:19,008 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 12:35:19,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:19,008 INFO L82 PathProgramCache]: Analyzing trace with hash 270212897, now seen corresponding path program 1 times [2019-12-18 12:35:19,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:19,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036779037] [2019-12-18 12:35:19,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:19,044 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 12:35:19,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036779037] [2019-12-18 12:35:19,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:19,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:35:19,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997757312] [2019-12-18 12:35:19,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:35:19,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:19,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:35:19,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:19,046 INFO L87 Difference]: Start difference. First operand 41982 states and 135844 transitions. Second operand 3 states. [2019-12-18 12:35:19,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:19,412 INFO L93 Difference]: Finished difference Result 64909 states and 208822 transitions. [2019-12-18 12:35:19,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:35:19,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:35:19,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:19,596 INFO L225 Difference]: With dead ends: 64909 [2019-12-18 12:35:19,596 INFO L226 Difference]: Without dead ends: 64909 [2019-12-18 12:35:19,597 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 12:35:20,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64909 states. [2019-12-18 12:35:20,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64909 to 49315. [2019-12-18 12:35:20,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49315 states. [2019-12-18 12:35:20,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49315 states to 49315 states and 159887 transitions. [2019-12-18 12:35:20,984 INFO L78 Accepts]: Start accepts. Automaton has 49315 states and 159887 transitions. Word has length 27 [2019-12-18 12:35:20,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:20,984 INFO L462 AbstractCegarLoop]: Abstraction has 49315 states and 159887 transitions. [2019-12-18 12:35:20,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:35:20,984 INFO L276 IsEmpty]: Start isEmpty. Operand 49315 states and 159887 transitions. [2019-12-18 12:35:21,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:35:21,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:21,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, 1, 1] [2019-12-18 12:35:21,000 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 12:35:21,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:21,001 INFO L82 PathProgramCache]: Analyzing trace with hash 2064759266, now seen corresponding path program 1 times [2019-12-18 12:35:21,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:21,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494807077] [2019-12-18 12:35:21,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:21,049 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 12:35:21,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494807077] [2019-12-18 12:35:21,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:21,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:35:21,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703963034] [2019-12-18 12:35:21,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:35:21,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:21,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:35:21,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:21,052 INFO L87 Difference]: Start difference. First operand 49315 states and 159887 transitions. Second operand 3 states. [2019-12-18 12:35:21,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:21,314 INFO L93 Difference]: Finished difference Result 64909 states and 203873 transitions. [2019-12-18 12:35:21,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:35:21,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:35:21,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:21,416 INFO L225 Difference]: With dead ends: 64909 [2019-12-18 12:35:21,416 INFO L226 Difference]: Without dead ends: 64909 [2019-12-18 12:35:21,416 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 12:35:21,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64909 states. [2019-12-18 12:35:22,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64909 to 49315. [2019-12-18 12:35:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49315 states. [2019-12-18 12:35:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49315 states to 49315 states and 154938 transitions. [2019-12-18 12:35:22,760 INFO L78 Accepts]: Start accepts. Automaton has 49315 states and 154938 transitions. Word has length 27 [2019-12-18 12:35:22,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:22,760 INFO L462 AbstractCegarLoop]: Abstraction has 49315 states and 154938 transitions. [2019-12-18 12:35:22,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:35:22,760 INFO L276 IsEmpty]: Start isEmpty. Operand 49315 states and 154938 transitions. [2019-12-18 12:35:22,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:35:22,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:22,774 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 12:35:22,775 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 12:35:22,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:22,775 INFO L82 PathProgramCache]: Analyzing trace with hash 2010439622, now seen corresponding path program 1 times [2019-12-18 12:35:22,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:22,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626759321] [2019-12-18 12:35:22,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:22,890 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 12:35:22,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626759321] [2019-12-18 12:35:22,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:22,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:35:22,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598229007] [2019-12-18 12:35:22,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:35:22,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:22,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:35:22,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:35:22,892 INFO L87 Difference]: Start difference. First operand 49315 states and 154938 transitions. Second operand 5 states. [2019-12-18 12:35:23,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:23,436 INFO L93 Difference]: Finished difference Result 60684 states and 188418 transitions. [2019-12-18 12:35:23,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:35:23,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 12:35:23,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:23,533 INFO L225 Difference]: With dead ends: 60684 [2019-12-18 12:35:23,533 INFO L226 Difference]: Without dead ends: 60508 [2019-12-18 12:35:23,534 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 12:35:23,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60508 states. [2019-12-18 12:35:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60508 to 53763. [2019-12-18 12:35:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53763 states. [2019-12-18 12:35:24,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53763 states to 53763 states and 168544 transitions. [2019-12-18 12:35:24,419 INFO L78 Accepts]: Start accepts. Automaton has 53763 states and 168544 transitions. Word has length 27 [2019-12-18 12:35:24,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:24,419 INFO L462 AbstractCegarLoop]: Abstraction has 53763 states and 168544 transitions. [2019-12-18 12:35:24,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:35:24,419 INFO L276 IsEmpty]: Start isEmpty. Operand 53763 states and 168544 transitions. [2019-12-18 12:35:24,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:35:24,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:24,436 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 12:35:24,436 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 12:35:24,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:24,437 INFO L82 PathProgramCache]: Analyzing trace with hash -782285250, now seen corresponding path program 1 times [2019-12-18 12:35:24,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:24,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117916400] [2019-12-18 12:35:24,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:24,480 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 12:35:24,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117916400] [2019-12-18 12:35:24,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:24,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:35:24,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998043853] [2019-12-18 12:35:24,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:35:24,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:24,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:35:24,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:24,483 INFO L87 Difference]: Start difference. First operand 53763 states and 168544 transitions. Second operand 3 states. [2019-12-18 12:35:25,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:25,262 INFO L93 Difference]: Finished difference Result 53712 states and 168392 transitions. [2019-12-18 12:35:25,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:35:25,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-18 12:35:25,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:25,384 INFO L225 Difference]: With dead ends: 53712 [2019-12-18 12:35:25,384 INFO L226 Difference]: Without dead ends: 53712 [2019-12-18 12:35:25,385 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 12:35:25,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53712 states. [2019-12-18 12:35:26,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53712 to 53712. [2019-12-18 12:35:26,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53712 states. [2019-12-18 12:35:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53712 states to 53712 states and 168392 transitions. [2019-12-18 12:35:26,218 INFO L78 Accepts]: Start accepts. Automaton has 53712 states and 168392 transitions. Word has length 28 [2019-12-18 12:35:26,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:26,219 INFO L462 AbstractCegarLoop]: Abstraction has 53712 states and 168392 transitions. [2019-12-18 12:35:26,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:35:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 53712 states and 168392 transitions. [2019-12-18 12:35:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:35:26,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:26,238 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 12:35:26,238 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 12:35:26,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:26,239 INFO L82 PathProgramCache]: Analyzing trace with hash 773295241, now seen corresponding path program 1 times [2019-12-18 12:35:26,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:26,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659450502] [2019-12-18 12:35:26,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:26,317 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 12:35:26,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659450502] [2019-12-18 12:35:26,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:26,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:35:26,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767331384] [2019-12-18 12:35:26,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:35:26,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:26,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:35:26,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:35:26,319 INFO L87 Difference]: Start difference. First operand 53712 states and 168392 transitions. Second operand 5 states. [2019-12-18 12:35:26,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:26,879 INFO L93 Difference]: Finished difference Result 64178 states and 198922 transitions. [2019-12-18 12:35:26,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:35:26,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 12:35:26,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:26,999 INFO L225 Difference]: With dead ends: 64178 [2019-12-18 12:35:27,000 INFO L226 Difference]: Without dead ends: 63994 [2019-12-18 12:35:27,000 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 12:35:27,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63994 states. [2019-12-18 12:35:28,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63994 to 53604. [2019-12-18 12:35:28,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53604 states. [2019-12-18 12:35:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53604 states to 53604 states and 167863 transitions. [2019-12-18 12:35:28,468 INFO L78 Accepts]: Start accepts. Automaton has 53604 states and 167863 transitions. Word has length 28 [2019-12-18 12:35:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:28,469 INFO L462 AbstractCegarLoop]: Abstraction has 53604 states and 167863 transitions. [2019-12-18 12:35:28,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:35:28,469 INFO L276 IsEmpty]: Start isEmpty. Operand 53604 states and 167863 transitions. [2019-12-18 12:35:28,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 12:35:28,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:28,487 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] [2019-12-18 12:35:28,487 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 12:35:28,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:28,488 INFO L82 PathProgramCache]: Analyzing trace with hash -340313241, now seen corresponding path program 1 times [2019-12-18 12:35:28,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:28,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161489724] [2019-12-18 12:35:28,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:28,561 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 12:35:28,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161489724] [2019-12-18 12:35:28,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:28,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:35:28,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723783167] [2019-12-18 12:35:28,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:35:28,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:28,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:35:28,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:35:28,564 INFO L87 Difference]: Start difference. First operand 53604 states and 167863 transitions. Second operand 5 states. [2019-12-18 12:35:29,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:29,662 INFO L93 Difference]: Finished difference Result 73481 states and 227986 transitions. [2019-12-18 12:35:29,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:35:29,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 12:35:29,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:29,863 INFO L225 Difference]: With dead ends: 73481 [2019-12-18 12:35:29,863 INFO L226 Difference]: Without dead ends: 73481 [2019-12-18 12:35:29,866 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 12:35:30,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73481 states. [2019-12-18 12:35:30,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73481 to 64191. [2019-12-18 12:35:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64191 states. [2019-12-18 12:35:31,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64191 states to 64191 states and 200913 transitions. [2019-12-18 12:35:31,027 INFO L78 Accepts]: Start accepts. Automaton has 64191 states and 200913 transitions. Word has length 29 [2019-12-18 12:35:31,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:31,027 INFO L462 AbstractCegarLoop]: Abstraction has 64191 states and 200913 transitions. [2019-12-18 12:35:31,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:35:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 64191 states and 200913 transitions. [2019-12-18 12:35:31,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 12:35:31,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:31,053 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] [2019-12-18 12:35:31,053 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 12:35:31,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:31,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1820575072, now seen corresponding path program 1 times [2019-12-18 12:35:31,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:31,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510791646] [2019-12-18 12:35:31,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:31,759 WARN L192 SmtUtils]: Spent 657.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-18 12:35:31,785 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 12:35:31,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510791646] [2019-12-18 12:35:31,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:31,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:35:31,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570529171] [2019-12-18 12:35:31,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:35:31,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:31,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:35:31,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:35:31,787 INFO L87 Difference]: Start difference. First operand 64191 states and 200913 transitions. Second operand 5 states. [2019-12-18 12:35:31,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:31,941 INFO L93 Difference]: Finished difference Result 32040 states and 94871 transitions. [2019-12-18 12:35:31,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:35:31,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 12:35:31,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:31,982 INFO L225 Difference]: With dead ends: 32040 [2019-12-18 12:35:31,982 INFO L226 Difference]: Without dead ends: 27824 [2019-12-18 12:35:31,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:35:32,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27824 states. [2019-12-18 12:35:32,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27824 to 25820. [2019-12-18 12:35:32,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25820 states. [2019-12-18 12:35:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25820 states to 25820 states and 76265 transitions. [2019-12-18 12:35:32,378 INFO L78 Accepts]: Start accepts. Automaton has 25820 states and 76265 transitions. Word has length 30 [2019-12-18 12:35:32,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:32,378 INFO L462 AbstractCegarLoop]: Abstraction has 25820 states and 76265 transitions. [2019-12-18 12:35:32,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:35:32,378 INFO L276 IsEmpty]: Start isEmpty. Operand 25820 states and 76265 transitions. [2019-12-18 12:35:32,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:35:32,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:32,403 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 12:35:32,403 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 12:35:32,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:32,403 INFO L82 PathProgramCache]: Analyzing trace with hash -809721720, now seen corresponding path program 1 times [2019-12-18 12:35:32,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:32,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082094588] [2019-12-18 12:35:32,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:32,496 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 12:35:32,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082094588] [2019-12-18 12:35:32,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:32,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:35:32,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907939167] [2019-12-18 12:35:32,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:35:32,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:32,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:35:32,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:35:32,500 INFO L87 Difference]: Start difference. First operand 25820 states and 76265 transitions. Second operand 6 states. [2019-12-18 12:35:33,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:33,317 INFO L93 Difference]: Finished difference Result 32869 states and 95951 transitions. [2019-12-18 12:35:33,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:35:33,318 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 12:35:33,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:33,366 INFO L225 Difference]: With dead ends: 32869 [2019-12-18 12:35:33,366 INFO L226 Difference]: Without dead ends: 32555 [2019-12-18 12:35:33,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 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 12:35:33,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32555 states. [2019-12-18 12:35:33,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32555 to 26717. [2019-12-18 12:35:33,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26717 states. [2019-12-18 12:35:33,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26717 states to 26717 states and 78965 transitions. [2019-12-18 12:35:33,791 INFO L78 Accepts]: Start accepts. Automaton has 26717 states and 78965 transitions. Word has length 33 [2019-12-18 12:35:33,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:33,791 INFO L462 AbstractCegarLoop]: Abstraction has 26717 states and 78965 transitions. [2019-12-18 12:35:33,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:35:33,791 INFO L276 IsEmpty]: Start isEmpty. Operand 26717 states and 78965 transitions. [2019-12-18 12:35:33,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:35:33,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:33,818 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 12:35:33,819 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 12:35:33,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:33,819 INFO L82 PathProgramCache]: Analyzing trace with hash -752360441, now seen corresponding path program 1 times [2019-12-18 12:35:33,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:33,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648764544] [2019-12-18 12:35:33,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:33,911 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 12:35:33,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648764544] [2019-12-18 12:35:33,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:33,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:35:33,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432018428] [2019-12-18 12:35:33,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:35:33,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:33,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:35:33,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:35:33,914 INFO L87 Difference]: Start difference. First operand 26717 states and 78965 transitions. Second operand 6 states. [2019-12-18 12:35:34,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:34,676 INFO L93 Difference]: Finished difference Result 32289 states and 94110 transitions. [2019-12-18 12:35:34,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:35:34,677 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 12:35:34,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:34,722 INFO L225 Difference]: With dead ends: 32289 [2019-12-18 12:35:34,722 INFO L226 Difference]: Without dead ends: 31914 [2019-12-18 12:35:34,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 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 12:35:34,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31914 states. [2019-12-18 12:35:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31914 to 24404. [2019-12-18 12:35:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24404 states. [2019-12-18 12:35:35,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24404 states to 24404 states and 72058 transitions. [2019-12-18 12:35:35,119 INFO L78 Accepts]: Start accepts. Automaton has 24404 states and 72058 transitions. Word has length 34 [2019-12-18 12:35:35,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:35,119 INFO L462 AbstractCegarLoop]: Abstraction has 24404 states and 72058 transitions. [2019-12-18 12:35:35,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:35:35,119 INFO L276 IsEmpty]: Start isEmpty. Operand 24404 states and 72058 transitions. [2019-12-18 12:35:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:35:35,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:35,142 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 12:35:35,142 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 12:35:35,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:35,142 INFO L82 PathProgramCache]: Analyzing trace with hash 202654059, now seen corresponding path program 1 times [2019-12-18 12:35:35,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:35,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115265801] [2019-12-18 12:35:35,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:35,220 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 12:35:35,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115265801] [2019-12-18 12:35:35,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:35,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:35:35,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825785222] [2019-12-18 12:35:35,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:35:35,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:35,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:35:35,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:35:35,222 INFO L87 Difference]: Start difference. First operand 24404 states and 72058 transitions. Second operand 5 states. [2019-12-18 12:35:36,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:36,167 INFO L93 Difference]: Finished difference Result 35030 states and 102665 transitions. [2019-12-18 12:35:36,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:35:36,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:35:36,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:36,219 INFO L225 Difference]: With dead ends: 35030 [2019-12-18 12:35:36,219 INFO L226 Difference]: Without dead ends: 35030 [2019-12-18 12:35:36,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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 12:35:36,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35030 states. [2019-12-18 12:35:36,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35030 to 28580. [2019-12-18 12:35:36,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28580 states. [2019-12-18 12:35:36,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28580 states to 28580 states and 84897 transitions. [2019-12-18 12:35:36,687 INFO L78 Accepts]: Start accepts. Automaton has 28580 states and 84897 transitions. Word has length 40 [2019-12-18 12:35:36,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:36,688 INFO L462 AbstractCegarLoop]: Abstraction has 28580 states and 84897 transitions. [2019-12-18 12:35:36,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:35:36,688 INFO L276 IsEmpty]: Start isEmpty. Operand 28580 states and 84897 transitions. [2019-12-18 12:35:36,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:35:36,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:36,719 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 12:35:36,719 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 12:35:36,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:36,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1689924949, now seen corresponding path program 2 times [2019-12-18 12:35:36,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:36,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441317307] [2019-12-18 12:35:36,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:36,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:36,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441317307] [2019-12-18 12:35:36,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:36,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:35:36,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272082977] [2019-12-18 12:35:36,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:35:36,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:36,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:35:36,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:36,767 INFO L87 Difference]: Start difference. First operand 28580 states and 84897 transitions. Second operand 3 states. [2019-12-18 12:35:36,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:36,893 INFO L93 Difference]: Finished difference Result 28495 states and 84636 transitions. [2019-12-18 12:35:36,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:35:36,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 12:35:36,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:36,948 INFO L225 Difference]: With dead ends: 28495 [2019-12-18 12:35:36,948 INFO L226 Difference]: Without dead ends: 28495 [2019-12-18 12:35:36,948 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 12:35:37,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28495 states. [2019-12-18 12:35:37,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28495 to 23399. [2019-12-18 12:35:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23399 states. [2019-12-18 12:35:37,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23399 states to 23399 states and 70309 transitions. [2019-12-18 12:35:37,384 INFO L78 Accepts]: Start accepts. Automaton has 23399 states and 70309 transitions. Word has length 40 [2019-12-18 12:35:37,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:37,384 INFO L462 AbstractCegarLoop]: Abstraction has 23399 states and 70309 transitions. [2019-12-18 12:35:37,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:35:37,384 INFO L276 IsEmpty]: Start isEmpty. Operand 23399 states and 70309 transitions. [2019-12-18 12:35:37,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 12:35:37,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:37,407 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 12:35:37,407 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 12:35:37,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:37,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1472692188, now seen corresponding path program 1 times [2019-12-18 12:35:37,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:37,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192166127] [2019-12-18 12:35:37,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:37,496 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 12:35:37,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192166127] [2019-12-18 12:35:37,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:37,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:35:37,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559895731] [2019-12-18 12:35:37,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:35:37,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:37,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:35:37,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:35:37,498 INFO L87 Difference]: Start difference. First operand 23399 states and 70309 transitions. Second operand 6 states. [2019-12-18 12:35:37,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:37,622 INFO L93 Difference]: Finished difference Result 22060 states and 67413 transitions. [2019-12-18 12:35:37,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:35:37,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 12:35:37,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:37,650 INFO L225 Difference]: With dead ends: 22060 [2019-12-18 12:35:37,651 INFO L226 Difference]: Without dead ends: 21914 [2019-12-18 12:35:37,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:35:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21914 states. [2019-12-18 12:35:37,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21914 to 20368. [2019-12-18 12:35:37,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20368 states. [2019-12-18 12:35:37,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20368 states to 20368 states and 62666 transitions. [2019-12-18 12:35:37,942 INFO L78 Accepts]: Start accepts. Automaton has 20368 states and 62666 transitions. Word has length 41 [2019-12-18 12:35:37,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:37,943 INFO L462 AbstractCegarLoop]: Abstraction has 20368 states and 62666 transitions. [2019-12-18 12:35:37,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:35:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 20368 states and 62666 transitions. [2019-12-18 12:35:37,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:35:37,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:37,962 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 12:35:37,962 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 12:35:37,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:37,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1424537019, now seen corresponding path program 1 times [2019-12-18 12:35:37,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:37,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503146256] [2019-12-18 12:35:37,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:38,049 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 12:35:38,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503146256] [2019-12-18 12:35:38,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:38,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:35:38,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853506416] [2019-12-18 12:35:38,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:35:38,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:38,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:35:38,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:35:38,052 INFO L87 Difference]: Start difference. First operand 20368 states and 62666 transitions. Second operand 7 states. [2019-12-18 12:35:38,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:38,542 INFO L93 Difference]: Finished difference Result 56456 states and 172223 transitions. [2019-12-18 12:35:38,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:35:38,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:35:38,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:38,602 INFO L225 Difference]: With dead ends: 56456 [2019-12-18 12:35:38,602 INFO L226 Difference]: Without dead ends: 42233 [2019-12-18 12:35:38,602 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 12:35:38,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42233 states. [2019-12-18 12:35:39,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42233 to 24164. [2019-12-18 12:35:39,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24164 states. [2019-12-18 12:35:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24164 states to 24164 states and 73761 transitions. [2019-12-18 12:35:39,406 INFO L78 Accepts]: Start accepts. Automaton has 24164 states and 73761 transitions. Word has length 65 [2019-12-18 12:35:39,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:39,407 INFO L462 AbstractCegarLoop]: Abstraction has 24164 states and 73761 transitions. [2019-12-18 12:35:39,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:35:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand 24164 states and 73761 transitions. [2019-12-18 12:35:39,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:35:39,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:39,435 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 12:35:39,435 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 12:35:39,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:39,436 INFO L82 PathProgramCache]: Analyzing trace with hash 872536213, now seen corresponding path program 2 times [2019-12-18 12:35:39,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:39,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989398984] [2019-12-18 12:35:39,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:39,520 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 12:35:39,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989398984] [2019-12-18 12:35:39,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:39,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:35:39,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497494034] [2019-12-18 12:35:39,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:35:39,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:39,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:35:39,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:35:39,522 INFO L87 Difference]: Start difference. First operand 24164 states and 73761 transitions. Second operand 8 states. [2019-12-18 12:35:40,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:40,736 INFO L93 Difference]: Finished difference Result 85886 states and 260410 transitions. [2019-12-18 12:35:40,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:35:40,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 12:35:40,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:40,823 INFO L225 Difference]: With dead ends: 85886 [2019-12-18 12:35:40,823 INFO L226 Difference]: Without dead ends: 62131 [2019-12-18 12:35:40,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:35:40,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62131 states. [2019-12-18 12:35:41,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62131 to 28471. [2019-12-18 12:35:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28471 states. [2019-12-18 12:35:41,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28471 states to 28471 states and 86221 transitions. [2019-12-18 12:35:41,539 INFO L78 Accepts]: Start accepts. Automaton has 28471 states and 86221 transitions. Word has length 65 [2019-12-18 12:35:41,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:41,540 INFO L462 AbstractCegarLoop]: Abstraction has 28471 states and 86221 transitions. [2019-12-18 12:35:41,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:35:41,540 INFO L276 IsEmpty]: Start isEmpty. Operand 28471 states and 86221 transitions. [2019-12-18 12:35:41,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:35:41,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:41,576 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 12:35:41,576 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 12:35:41,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:41,576 INFO L82 PathProgramCache]: Analyzing trace with hash 45765331, now seen corresponding path program 3 times [2019-12-18 12:35:41,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:41,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049450003] [2019-12-18 12:35:41,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:41,701 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 12:35:41,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049450003] [2019-12-18 12:35:41,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:41,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:35:41,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461428604] [2019-12-18 12:35:41,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:35:41,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:41,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:35:41,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:35:41,703 INFO L87 Difference]: Start difference. First operand 28471 states and 86221 transitions. Second operand 9 states. [2019-12-18 12:35:43,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:43,117 INFO L93 Difference]: Finished difference Result 104220 states and 312531 transitions. [2019-12-18 12:35:43,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:35:43,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:35:43,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:43,667 INFO L225 Difference]: With dead ends: 104220 [2019-12-18 12:35:43,667 INFO L226 Difference]: Without dead ends: 99809 [2019-12-18 12:35:43,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:35:43,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99809 states. [2019-12-18 12:35:44,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99809 to 28914. [2019-12-18 12:35:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28914 states. [2019-12-18 12:35:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28914 states to 28914 states and 87502 transitions. [2019-12-18 12:35:44,586 INFO L78 Accepts]: Start accepts. Automaton has 28914 states and 87502 transitions. Word has length 65 [2019-12-18 12:35:44,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:44,586 INFO L462 AbstractCegarLoop]: Abstraction has 28914 states and 87502 transitions. [2019-12-18 12:35:44,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:35:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 28914 states and 87502 transitions. [2019-12-18 12:35:44,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:35:44,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:44,617 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 12:35:44,618 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 12:35:44,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:44,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1660891443, now seen corresponding path program 4 times [2019-12-18 12:35:44,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:44,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90080989] [2019-12-18 12:35:44,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:44,726 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 12:35:44,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90080989] [2019-12-18 12:35:44,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:44,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:35:44,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560221028] [2019-12-18 12:35:44,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:35:44,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:44,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:35:44,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:35:44,728 INFO L87 Difference]: Start difference. First operand 28914 states and 87502 transitions. Second operand 9 states. [2019-12-18 12:35:46,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:46,170 INFO L93 Difference]: Finished difference Result 80796 states and 243066 transitions. [2019-12-18 12:35:46,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:35:46,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:35:46,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:46,289 INFO L225 Difference]: With dead ends: 80796 [2019-12-18 12:35:46,289 INFO L226 Difference]: Without dead ends: 78469 [2019-12-18 12:35:46,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:35:46,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78469 states. [2019-12-18 12:35:47,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78469 to 28690. [2019-12-18 12:35:47,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28690 states. [2019-12-18 12:35:47,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28690 states to 28690 states and 87006 transitions. [2019-12-18 12:35:47,572 INFO L78 Accepts]: Start accepts. Automaton has 28690 states and 87006 transitions. Word has length 65 [2019-12-18 12:35:47,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:47,572 INFO L462 AbstractCegarLoop]: Abstraction has 28690 states and 87006 transitions. [2019-12-18 12:35:47,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:35:47,572 INFO L276 IsEmpty]: Start isEmpty. Operand 28690 states and 87006 transitions. [2019-12-18 12:35:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:35:47,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:47,603 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 12:35:47,604 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 12:35:47,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:47,604 INFO L82 PathProgramCache]: Analyzing trace with hash 937822065, now seen corresponding path program 5 times [2019-12-18 12:35:47,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:47,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074526517] [2019-12-18 12:35:47,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:47,675 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 12:35:47,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074526517] [2019-12-18 12:35:47,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:47,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:35:47,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58299866] [2019-12-18 12:35:47,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:35:47,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:47,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:35:47,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:35:47,677 INFO L87 Difference]: Start difference. First operand 28690 states and 87006 transitions. Second operand 7 states. [2019-12-18 12:35:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:48,310 INFO L93 Difference]: Finished difference Result 56388 states and 168461 transitions. [2019-12-18 12:35:48,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:35:48,310 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:35:48,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:48,404 INFO L225 Difference]: With dead ends: 56388 [2019-12-18 12:35:48,404 INFO L226 Difference]: Without dead ends: 47497 [2019-12-18 12:35:48,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:35:48,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47497 states. [2019-12-18 12:35:48,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47497 to 28702. [2019-12-18 12:35:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28702 states. [2019-12-18 12:35:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28702 states to 28702 states and 86977 transitions. [2019-12-18 12:35:49,005 INFO L78 Accepts]: Start accepts. Automaton has 28702 states and 86977 transitions. Word has length 65 [2019-12-18 12:35:49,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:49,005 INFO L462 AbstractCegarLoop]: Abstraction has 28702 states and 86977 transitions. [2019-12-18 12:35:49,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:35:49,005 INFO L276 IsEmpty]: Start isEmpty. Operand 28702 states and 86977 transitions. [2019-12-18 12:35:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:35:49,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:49,035 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 12:35:49,035 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 12:35:49,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:49,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1903736173, now seen corresponding path program 6 times [2019-12-18 12:35:49,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:49,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633420276] [2019-12-18 12:35:49,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:49,089 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 12:35:49,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633420276] [2019-12-18 12:35:49,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:49,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:35:49,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478870911] [2019-12-18 12:35:49,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:35:49,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:49,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:35:49,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:49,091 INFO L87 Difference]: Start difference. First operand 28702 states and 86977 transitions. Second operand 3 states. [2019-12-18 12:35:49,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:49,227 INFO L93 Difference]: Finished difference Result 32141 states and 97691 transitions. [2019-12-18 12:35:49,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:35:49,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:35:49,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:49,270 INFO L225 Difference]: With dead ends: 32141 [2019-12-18 12:35:49,271 INFO L226 Difference]: Without dead ends: 32141 [2019-12-18 12:35:49,271 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 12:35:49,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32141 states. [2019-12-18 12:35:49,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32141 to 26839. [2019-12-18 12:35:49,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26839 states. [2019-12-18 12:35:49,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26839 states to 26839 states and 82338 transitions. [2019-12-18 12:35:49,690 INFO L78 Accepts]: Start accepts. Automaton has 26839 states and 82338 transitions. Word has length 65 [2019-12-18 12:35:49,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:49,690 INFO L462 AbstractCegarLoop]: Abstraction has 26839 states and 82338 transitions. [2019-12-18 12:35:49,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:35:49,691 INFO L276 IsEmpty]: Start isEmpty. Operand 26839 states and 82338 transitions. [2019-12-18 12:35:49,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:35:49,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:49,720 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 12:35:49,720 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 12:35:49,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:49,720 INFO L82 PathProgramCache]: Analyzing trace with hash -450354812, now seen corresponding path program 1 times [2019-12-18 12:35:49,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:49,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791735427] [2019-12-18 12:35:49,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:49,816 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 12:35:49,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791735427] [2019-12-18 12:35:49,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:49,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:35:49,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747455676] [2019-12-18 12:35:49,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:35:49,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:49,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:35:49,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:35:49,818 INFO L87 Difference]: Start difference. First operand 26839 states and 82338 transitions. Second operand 8 states. [2019-12-18 12:35:51,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:51,099 INFO L93 Difference]: Finished difference Result 66040 states and 199818 transitions. [2019-12-18 12:35:51,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:35:51,100 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 12:35:51,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:51,214 INFO L225 Difference]: With dead ends: 66040 [2019-12-18 12:35:51,214 INFO L226 Difference]: Without dead ends: 60527 [2019-12-18 12:35:51,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:35:51,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60527 states. [2019-12-18 12:35:52,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60527 to 27119. [2019-12-18 12:35:52,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27119 states. [2019-12-18 12:35:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27119 states to 27119 states and 83379 transitions. [2019-12-18 12:35:52,173 INFO L78 Accepts]: Start accepts. Automaton has 27119 states and 83379 transitions. Word has length 66 [2019-12-18 12:35:52,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:52,173 INFO L462 AbstractCegarLoop]: Abstraction has 27119 states and 83379 transitions. [2019-12-18 12:35:52,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:35:52,173 INFO L276 IsEmpty]: Start isEmpty. Operand 27119 states and 83379 transitions. [2019-12-18 12:35:52,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:35:52,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:52,201 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 12:35:52,201 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 12:35:52,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:52,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1149732436, now seen corresponding path program 2 times [2019-12-18 12:35:52,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:52,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936469673] [2019-12-18 12:35:52,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:52,310 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 12:35:52,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936469673] [2019-12-18 12:35:52,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:52,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:35:52,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750027757] [2019-12-18 12:35:52,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:35:52,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:52,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:35:52,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:35:52,313 INFO L87 Difference]: Start difference. First operand 27119 states and 83379 transitions. Second operand 9 states. [2019-12-18 12:35:53,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:53,805 INFO L93 Difference]: Finished difference Result 81221 states and 243056 transitions. [2019-12-18 12:35:53,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:35:53,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 12:35:53,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:53,910 INFO L225 Difference]: With dead ends: 81221 [2019-12-18 12:35:53,910 INFO L226 Difference]: Without dead ends: 73455 [2019-12-18 12:35:53,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:35:54,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73455 states. [2019-12-18 12:35:54,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73455 to 27453. [2019-12-18 12:35:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27453 states. [2019-12-18 12:35:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27453 states to 27453 states and 83857 transitions. [2019-12-18 12:35:54,642 INFO L78 Accepts]: Start accepts. Automaton has 27453 states and 83857 transitions. Word has length 66 [2019-12-18 12:35:54,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:54,642 INFO L462 AbstractCegarLoop]: Abstraction has 27453 states and 83857 transitions. [2019-12-18 12:35:54,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:35:54,642 INFO L276 IsEmpty]: Start isEmpty. Operand 27453 states and 83857 transitions. [2019-12-18 12:35:54,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:35:54,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:54,670 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 12:35:54,670 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 12:35:54,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:54,671 INFO L82 PathProgramCache]: Analyzing trace with hash -989751768, now seen corresponding path program 3 times [2019-12-18 12:35:54,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:54,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549838148] [2019-12-18 12:35:54,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:54,767 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 12:35:54,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549838148] [2019-12-18 12:35:54,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:54,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:35:54,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584558283] [2019-12-18 12:35:54,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:35:54,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:54,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:35:54,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:35:54,768 INFO L87 Difference]: Start difference. First operand 27453 states and 83857 transitions. Second operand 9 states. [2019-12-18 12:35:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:56,000 INFO L93 Difference]: Finished difference Result 67625 states and 202912 transitions. [2019-12-18 12:35:56,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:35:56,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 12:35:56,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:56,093 INFO L225 Difference]: With dead ends: 67625 [2019-12-18 12:35:56,093 INFO L226 Difference]: Without dead ends: 65038 [2019-12-18 12:35:56,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:35:56,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65038 states. [2019-12-18 12:35:57,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65038 to 26710. [2019-12-18 12:35:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26710 states. [2019-12-18 12:35:57,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26710 states to 26710 states and 81793 transitions. [2019-12-18 12:35:57,088 INFO L78 Accepts]: Start accepts. Automaton has 26710 states and 81793 transitions. Word has length 66 [2019-12-18 12:35:57,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:57,088 INFO L462 AbstractCegarLoop]: Abstraction has 26710 states and 81793 transitions. [2019-12-18 12:35:57,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:35:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 26710 states and 81793 transitions. [2019-12-18 12:35:57,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:35:57,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:57,120 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 12:35:57,121 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 12:35:57,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:57,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1188317688, now seen corresponding path program 4 times [2019-12-18 12:35:57,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:57,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495235201] [2019-12-18 12:35:57,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:57,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495235201] [2019-12-18 12:35:57,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:57,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:35:57,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581492054] [2019-12-18 12:35:57,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:35:57,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:57,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:35:57,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:35:57,190 INFO L87 Difference]: Start difference. First operand 26710 states and 81793 transitions. Second operand 4 states. [2019-12-18 12:35:57,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:57,324 INFO L93 Difference]: Finished difference Result 26500 states and 80920 transitions. [2019-12-18 12:35:57,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:35:57,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 12:35:57,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:57,361 INFO L225 Difference]: With dead ends: 26500 [2019-12-18 12:35:57,361 INFO L226 Difference]: Without dead ends: 26500 [2019-12-18 12:35:57,361 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 12:35:57,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26500 states. [2019-12-18 12:35:57,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26500 to 24438. [2019-12-18 12:35:57,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24438 states. [2019-12-18 12:35:57,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24438 states to 24438 states and 74949 transitions. [2019-12-18 12:35:57,752 INFO L78 Accepts]: Start accepts. Automaton has 24438 states and 74949 transitions. Word has length 66 [2019-12-18 12:35:57,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:57,752 INFO L462 AbstractCegarLoop]: Abstraction has 24438 states and 74949 transitions. [2019-12-18 12:35:57,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:35:57,752 INFO L276 IsEmpty]: Start isEmpty. Operand 24438 states and 74949 transitions. [2019-12-18 12:35:57,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:35:57,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:57,777 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 12:35:57,777 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 12:35:57,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:57,777 INFO L82 PathProgramCache]: Analyzing trace with hash -243481851, now seen corresponding path program 1 times [2019-12-18 12:35:57,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:57,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18542343] [2019-12-18 12:35:57,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:57,873 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 12:35:57,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18542343] [2019-12-18 12:35:57,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:57,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:35:57,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469834616] [2019-12-18 12:35:57,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:35:57,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:57,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:35:57,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:35:57,875 INFO L87 Difference]: Start difference. First operand 24438 states and 74949 transitions. Second operand 6 states. [2019-12-18 12:35:58,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:58,799 INFO L93 Difference]: Finished difference Result 31944 states and 95881 transitions. [2019-12-18 12:35:58,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:35:58,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 12:35:58,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:58,847 INFO L225 Difference]: With dead ends: 31944 [2019-12-18 12:35:58,847 INFO L226 Difference]: Without dead ends: 31944 [2019-12-18 12:35:58,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 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 12:35:58,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31944 states. [2019-12-18 12:35:59,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31944 to 24452. [2019-12-18 12:35:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24452 states. [2019-12-18 12:35:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24452 states to 24452 states and 74989 transitions. [2019-12-18 12:35:59,283 INFO L78 Accepts]: Start accepts. Automaton has 24452 states and 74989 transitions. Word has length 66 [2019-12-18 12:35:59,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:59,283 INFO L462 AbstractCegarLoop]: Abstraction has 24452 states and 74989 transitions. [2019-12-18 12:35:59,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:35:59,283 INFO L276 IsEmpty]: Start isEmpty. Operand 24452 states and 74989 transitions. [2019-12-18 12:35:59,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:35:59,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:59,310 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 12:35:59,310 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 12:35:59,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:59,310 INFO L82 PathProgramCache]: Analyzing trace with hash -44744943, now seen corresponding path program 2 times [2019-12-18 12:35:59,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:59,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443232059] [2019-12-18 12:35:59,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:59,403 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 12:35:59,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443232059] [2019-12-18 12:35:59,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:59,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:35:59,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460554756] [2019-12-18 12:35:59,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:35:59,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:59,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:35:59,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:35:59,405 INFO L87 Difference]: Start difference. First operand 24452 states and 74989 transitions. Second operand 7 states. [2019-12-18 12:36:00,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:00,715 INFO L93 Difference]: Finished difference Result 32677 states and 97938 transitions. [2019-12-18 12:36:00,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:36:00,716 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 12:36:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:00,761 INFO L225 Difference]: With dead ends: 32677 [2019-12-18 12:36:00,762 INFO L226 Difference]: Without dead ends: 32677 [2019-12-18 12:36:00,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:36:00,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32677 states. [2019-12-18 12:36:01,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32677 to 24100. [2019-12-18 12:36:01,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24100 states. [2019-12-18 12:36:01,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24100 states to 24100 states and 73913 transitions. [2019-12-18 12:36:01,492 INFO L78 Accepts]: Start accepts. Automaton has 24100 states and 73913 transitions. Word has length 66 [2019-12-18 12:36:01,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:01,493 INFO L462 AbstractCegarLoop]: Abstraction has 24100 states and 73913 transitions. [2019-12-18 12:36:01,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:36:01,493 INFO L276 IsEmpty]: Start isEmpty. Operand 24100 states and 73913 transitions. [2019-12-18 12:36:01,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:36:01,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:01,522 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 12:36:01,522 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:01,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:01,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1480053167, now seen corresponding path program 3 times [2019-12-18 12:36:01,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:01,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849229271] [2019-12-18 12:36:01,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:01,585 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 12:36:01,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849229271] [2019-12-18 12:36:01,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:01,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:36:01,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807079057] [2019-12-18 12:36:01,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:36:01,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:01,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:36:01,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:36:01,587 INFO L87 Difference]: Start difference. First operand 24100 states and 73913 transitions. Second operand 3 states. [2019-12-18 12:36:01,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:01,662 INFO L93 Difference]: Finished difference Result 19084 states and 57555 transitions. [2019-12-18 12:36:01,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:36:01,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:36:01,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:01,687 INFO L225 Difference]: With dead ends: 19084 [2019-12-18 12:36:01,687 INFO L226 Difference]: Without dead ends: 19084 [2019-12-18 12:36:01,688 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 12:36:01,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19084 states. [2019-12-18 12:36:01,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19084 to 17258. [2019-12-18 12:36:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17258 states. [2019-12-18 12:36:01,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17258 states to 17258 states and 52021 transitions. [2019-12-18 12:36:01,945 INFO L78 Accepts]: Start accepts. Automaton has 17258 states and 52021 transitions. Word has length 66 [2019-12-18 12:36:01,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:01,945 INFO L462 AbstractCegarLoop]: Abstraction has 17258 states and 52021 transitions. [2019-12-18 12:36:01,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:36:01,945 INFO L276 IsEmpty]: Start isEmpty. Operand 17258 states and 52021 transitions. [2019-12-18 12:36:01,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:36:01,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:01,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:01,970 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:01,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:01,970 INFO L82 PathProgramCache]: Analyzing trace with hash 817808390, now seen corresponding path program 1 times [2019-12-18 12:36:01,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:01,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916339137] [2019-12-18 12:36:01,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:36:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:36:02,104 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:36:02,105 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:36:02,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] ULTIMATE.startENTRY-->L827: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= 0 |v_ULTIMATE.start_main_~#t415~0.offset_30|) (= v_~z$r_buff1_thd1~0_114 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~z$r_buff0_thd3~0_325) (= v_~z$mem_tmp~0_16 0) (= 0 v_~z$r_buff1_thd3~0_218) (= |v_#NULL.offset_3| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t415~0.base_44| 1) |v_#valid_71|) (= v_~z$read_delayed~0_8 0) (= 0 v_~weak$$choice0~0_15) (= v_~z$w_buff1~0_167 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t415~0.base_44| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t415~0.base_44|) |v_ULTIMATE.start_main_~#t415~0.offset_30| 0)) |v_#memory_int_21|) (= v_~z$r_buff0_thd0~0_136 0) (= v_~x~0_84 0) (= v_~z$r_buff0_thd1~0_185 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$read_delayed_var~0.base_6 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t415~0.base_44|) (= 0 v_~__unbuffered_p2_EAX~0_46) (= 0 v_~weak$$choice2~0_93) (= 0 v_~__unbuffered_p1_EAX~0_60) (= v_~z$w_buff0~0_229 0) (= 0 v_~__unbuffered_p0_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_63) (= v_~z$r_buff0_thd2~0_132 0) (= v_~z~0_167 0) (= v_~main$tmp_guard0~0_44 0) (= v_~y~0_39 0) (= v_~z$w_buff1_used~0_386 0) (= v_~__unbuffered_p2_EBX~0_54 0) (= v_~z$r_buff1_thd0~0_148 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t415~0.base_44|)) (= 0 |v_#NULL.base_3|) (= v_~z$w_buff0_used~0_680 0) (= v_~z$r_buff1_thd2~0_108 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t415~0.base_44| 4) |v_#length_23|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t415~0.offset=|v_ULTIMATE.start_main_~#t415~0.offset_30|, ULTIMATE.start_main_~#t417~0.base=|v_ULTIMATE.start_main_~#t417~0.base_24|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_108, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_86|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_44|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_140|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_82|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_136, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_95, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_46, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_11|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_386, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ULTIMATE.start_main_~#t416~0.base=|v_ULTIMATE.start_main_~#t416~0.base_44|, ULTIMATE.start_main_~#t416~0.offset=|v_ULTIMATE.start_main_~#t416~0.offset_30|, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_114, ~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_325, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_~#t415~0.base=|v_ULTIMATE.start_main_~#t415~0.base_44|, ~x~0=v_~x~0_84, ULTIMATE.start_main_~#t417~0.offset=|v_ULTIMATE.start_main_~#t417~0.offset_19|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_167, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_103|, ~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_42|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_148, ~y~0=v_~y~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_132, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_680, ~z$w_buff0~0=v_~z$w_buff0~0_229, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_218, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_93, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_185} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t415~0.offset, ULTIMATE.start_main_~#t417~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t416~0.base, ULTIMATE.start_main_~#t416~0.offset, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t415~0.base, ~x~0, ULTIMATE.start_main_~#t417~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:36:02,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L4-->L748: Formula: (and (= ~z$r_buff1_thd3~0_Out-1206074332 ~z$r_buff0_thd3~0_In-1206074332) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1206074332 0)) (= ~z$r_buff0_thd1~0_In-1206074332 ~z$r_buff1_thd1~0_Out-1206074332) (= ~z$r_buff0_thd1~0_Out-1206074332 1) (= ~z$r_buff0_thd0~0_In-1206074332 ~z$r_buff1_thd0~0_Out-1206074332) (= ~z$r_buff1_thd2~0_Out-1206074332 ~z$r_buff0_thd2~0_In-1206074332) (= ~__unbuffered_p0_EAX~0_Out-1206074332 ~x~0_In-1206074332)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1206074332, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1206074332, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1206074332, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1206074332, ~x~0=~x~0_In-1206074332, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1206074332} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1206074332, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1206074332, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1206074332, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1206074332, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1206074332, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1206074332, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1206074332, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1206074332, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1206074332, ~x~0=~x~0_In-1206074332, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1206074332} 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 12:36:02,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L827-1-->L829: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t416~0.base_13|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t416~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t416~0.base_13|) |v_ULTIMATE.start_main_~#t416~0.offset_11| 1)) |v_#memory_int_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t416~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t416~0.offset_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t416~0.base_13|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t416~0.base_13| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t416~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t416~0.base=|v_ULTIMATE.start_main_~#t416~0.base_13|, ULTIMATE.start_main_~#t416~0.offset=|v_ULTIMATE.start_main_~#t416~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t416~0.base, ULTIMATE.start_main_~#t416~0.offset] because there is no mapped edge [2019-12-18 12:36:02,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-2-->L768-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork2_#t~ite10_Out-1935342428| |P1Thread1of1ForFork2_#t~ite9_Out-1935342428|)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1935342428 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1935342428 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-1935342428| ~z$w_buff1~0_In-1935342428) .cse1 (not .cse2)) (and .cse1 (= |P1Thread1of1ForFork2_#t~ite9_Out-1935342428| ~z~0_In-1935342428) (or .cse0 .cse2)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1935342428, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1935342428, ~z$w_buff1~0=~z$w_buff1~0_In-1935342428, ~z~0=~z~0_In-1935342428} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1935342428|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1935342428, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1935342428|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1935342428, ~z$w_buff1~0=~z$w_buff1~0_In-1935342428, ~z~0=~z~0_In-1935342428} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:36:02,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In864601322 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In864601322 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out864601322|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In864601322 |P1Thread1of1ForFork2_#t~ite11_Out864601322|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In864601322, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In864601322} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In864601322, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out864601322|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In864601322} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:36:02,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-56705953 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-56705953 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-56705953 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-56705953 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-56705953| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-56705953| ~z$w_buff1_used~0_In-56705953) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-56705953, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-56705953, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-56705953, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-56705953} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-56705953, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-56705953, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-56705953, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-56705953|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-56705953} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:36:02,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L829-1-->L831: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t417~0.base_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t417~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t417~0.base_10|) |v_ULTIMATE.start_main_~#t417~0.offset_9| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t417~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t417~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t417~0.offset_9| 0) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t417~0.base_10| 1)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t417~0.base_10| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t417~0.base=|v_ULTIMATE.start_main_~#t417~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t417~0.offset=|v_ULTIMATE.start_main_~#t417~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t417~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t417~0.offset] because there is no mapped edge [2019-12-18 12:36:02,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L793-->L793-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In344269919 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In344269919| |P2Thread1of1ForFork0_#t~ite20_Out344269919|) (= |P2Thread1of1ForFork0_#t~ite21_Out344269919| ~z$w_buff0~0_In344269919)) (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In344269919 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In344269919 256) 0)) (= (mod ~z$w_buff0_used~0_In344269919 256) 0) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In344269919 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite21_Out344269919| |P2Thread1of1ForFork0_#t~ite20_Out344269919|) (= |P2Thread1of1ForFork0_#t~ite20_Out344269919| ~z$w_buff0~0_In344269919)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In344269919, ~z$w_buff0_used~0=~z$w_buff0_used~0_In344269919, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In344269919, ~z$w_buff1_used~0=~z$w_buff1_used~0_In344269919, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In344269919, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In344269919|, ~weak$$choice2~0=~weak$$choice2~0_In344269919} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out344269919|, ~z$w_buff0~0=~z$w_buff0~0_In344269919, ~z$w_buff0_used~0=~z$w_buff0_used~0_In344269919, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In344269919, ~z$w_buff1_used~0=~z$w_buff1_used~0_In344269919, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In344269919, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out344269919|, ~weak$$choice2~0=~weak$$choice2~0_In344269919} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 12:36:02,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L794-->L794-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1343491503 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite23_Out1343491503| |P2Thread1of1ForFork0_#t~ite24_Out1343491503|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1343491503 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In1343491503 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In1343491503 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In1343491503 256) 0)))) (= ~z$w_buff1~0_In1343491503 |P2Thread1of1ForFork0_#t~ite23_Out1343491503|)) (and (= ~z$w_buff1~0_In1343491503 |P2Thread1of1ForFork0_#t~ite24_Out1343491503|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In1343491503| |P2Thread1of1ForFork0_#t~ite23_Out1343491503|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1343491503, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1343491503, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1343491503|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1343491503, ~z$w_buff1~0=~z$w_buff1~0_In1343491503, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1343491503, ~weak$$choice2~0=~weak$$choice2~0_In1343491503} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1343491503, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1343491503|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1343491503, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1343491503|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1343491503, ~z$w_buff1~0=~z$w_buff1~0_In1343491503, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1343491503, ~weak$$choice2~0=~weak$$choice2~0_In1343491503} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 12:36:02,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L797-->L798: Formula: (and (not (= (mod v_~weak$$choice2~0_37 256) 0)) (= v_~z$r_buff0_thd3~0_160 v_~z$r_buff0_thd3~0_161)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_161, ~weak$$choice2~0=v_~weak$$choice2~0_37} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_8|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_160, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_12|, ~weak$$choice2~0=v_~weak$$choice2~0_37} 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 12:36:02,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L800-->L804: Formula: (and (= v_~z~0_54 v_~z$mem_tmp~0_7) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 12:36:02,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L804-2-->L804-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-882846577 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-882846577 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-882846577| ~z$w_buff1~0_In-882846577) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-882846577| ~z~0_In-882846577)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-882846577, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-882846577, ~z$w_buff1~0=~z$w_buff1~0_In-882846577, ~z~0=~z~0_In-882846577} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-882846577|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-882846577, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-882846577, ~z$w_buff1~0=~z$w_buff1~0_In-882846577, ~z~0=~z~0_In-882846577} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:36:02,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L804-4-->L805: Formula: (= v_~z~0_30 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|, ~z~0=v_~z~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-18 12:36:02,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1633485992 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1633485992 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out1633485992| 0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1633485992 |P2Thread1of1ForFork0_#t~ite40_Out1633485992|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1633485992, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1633485992} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1633485992, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1633485992|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1633485992} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:36:02,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L771-->L771-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In2004956924 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In2004956924 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out2004956924| 0)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out2004956924| ~z$r_buff0_thd2~0_In2004956924) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2004956924, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2004956924} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2004956924, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out2004956924|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2004956924} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:36:02,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In644286153 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In644286153 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In644286153 |P0Thread1of1ForFork1_#t~ite5_Out644286153|)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out644286153| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In644286153, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In644286153} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out644286153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In644286153, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In644286153} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:36:02,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In1747463303 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1747463303 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1747463303 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1747463303 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out1747463303| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite6_Out1747463303| ~z$w_buff1_used~0_In1747463303) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1747463303, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1747463303, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1747463303, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1747463303} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1747463303, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1747463303|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1747463303, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1747463303, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1747463303} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:36:02,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L751-->L752: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In647069897 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In647069897 256)))) (or (and (= 0 ~z$r_buff0_thd1~0_Out647069897) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In647069897 ~z$r_buff0_thd1~0_Out647069897)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In647069897, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In647069897} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In647069897, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out647069897|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out647069897} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:36:02,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L752-->L752-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In476024616 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In476024616 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd1~0_In476024616 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In476024616 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out476024616| 0)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out476024616| ~z$r_buff1_thd1~0_In476024616) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In476024616, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In476024616, ~z$w_buff1_used~0=~z$w_buff1_used~0_In476024616, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In476024616} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out476024616|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In476024616, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In476024616, ~z$w_buff1_used~0=~z$w_buff1_used~0_In476024616, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In476024616} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:36:02,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L752-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_77 |v_P0Thread1of1ForFork1_#t~ite8_24|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_23|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_77, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} 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 12:36:02,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1792766493 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1792766493 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-1792766493 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1792766493 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out-1792766493| ~z$w_buff1_used~0_In-1792766493) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork0_#t~ite41_Out-1792766493| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1792766493, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1792766493, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1792766493, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1792766493} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1792766493, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1792766493, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1792766493, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1792766493, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1792766493|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:36:02,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L807-->L807-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1686763622 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1686763622 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1686763622| ~z$r_buff0_thd3~0_In-1686763622) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1686763622| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1686763622, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1686763622} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1686763622, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1686763622, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1686763622|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:36:02,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-884642580 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-884642580 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-884642580 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-884642580 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-884642580 |P2Thread1of1ForFork0_#t~ite43_Out-884642580|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-884642580|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-884642580, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-884642580, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-884642580, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-884642580} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-884642580|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-884642580, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-884642580, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-884642580, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-884642580} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:36:02,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L808-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= v_~z$r_buff1_thd3~0_131 |v_P2Thread1of1ForFork0_#t~ite43_26|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_25|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, 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 12:36:02,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L772-->L772-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-1461261522 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1461261522 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1461261522 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1461261522 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-1461261522| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite14_Out-1461261522| ~z$r_buff1_thd2~0_In-1461261522) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1461261522, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1461261522, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1461261522, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1461261522} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1461261522, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1461261522, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1461261522, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1461261522|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1461261522} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:36:02,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L772-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= |v_P1Thread1of1ForFork2_#t~ite14_26| v_~z$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_26|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_56, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_25|, 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 12:36:02,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L835-->L837-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_51 256)) (= 0 (mod v_~z$w_buff0_used~0_293 256))) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_51, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_51, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 12:36:02,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L837-2-->L837-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1025738865 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1025738865 256)))) (or (and (= ~z$w_buff1~0_In-1025738865 |ULTIMATE.start_main_#t~ite47_Out-1025738865|) (not .cse0) (not .cse1)) (and (= ~z~0_In-1025738865 |ULTIMATE.start_main_#t~ite47_Out-1025738865|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1025738865, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1025738865, ~z$w_buff1~0=~z$w_buff1~0_In-1025738865, ~z~0=~z~0_In-1025738865} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1025738865, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1025738865|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1025738865, ~z$w_buff1~0=~z$w_buff1~0_In-1025738865, ~z~0=~z~0_In-1025738865} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:36:02,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L837-4-->L838: Formula: (= v_~z~0_20 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_14|, ~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 12:36:02,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1061289322 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1061289322 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1061289322 |ULTIMATE.start_main_#t~ite49_Out-1061289322|)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-1061289322|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1061289322, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1061289322} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1061289322, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1061289322, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1061289322|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:36:02,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L839-->L839-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1018574144 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1018574144 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1018574144 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1018574144 256) 0))) (or (and (= ~z$w_buff1_used~0_In-1018574144 |ULTIMATE.start_main_#t~ite50_Out-1018574144|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-1018574144|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1018574144, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1018574144, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1018574144, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1018574144} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1018574144|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1018574144, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1018574144, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1018574144, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1018574144} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:36:02,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In353930741 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In353930741 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out353930741| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In353930741 |ULTIMATE.start_main_#t~ite51_Out353930741|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In353930741, ~z$w_buff0_used~0=~z$w_buff0_used~0_In353930741} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In353930741, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out353930741|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In353930741} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:36:02,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In2048295246 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In2048295246 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In2048295246 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2048295246 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out2048295246|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In2048295246 |ULTIMATE.start_main_#t~ite52_Out2048295246|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2048295246, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2048295246, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2048295246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2048295246} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out2048295246|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2048295246, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2048295246, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2048295246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2048295246} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:36:02,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] L841-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p0_EAX~0_72) (= v_~z$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_~__unbuffered_p2_EBX~0_32 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~main$tmp_guard1~0_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= 1 v_~__unbuffered_p2_EAX~0_25)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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 12:36:02,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:36:02 BasicIcfg [2019-12-18 12:36:02,244 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:36:02,245 INFO L168 Benchmark]: Toolchain (without parser) took 111983.57 ms. Allocated memory was 145.2 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 100.4 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 12:36:02,246 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 12:36:02,247 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.24 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.0 MB in the beginning and 156.3 MB in the end (delta: -56.3 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:36:02,248 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.85 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 153.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:36:02,248 INFO L168 Benchmark]: Boogie Preprocessor took 48.09 ms. Allocated memory is still 202.4 MB. Free memory was 153.6 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:36:02,248 INFO L168 Benchmark]: RCFGBuilder took 1048.25 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 100.7 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-18 12:36:02,248 INFO L168 Benchmark]: TraceAbstraction took 110074.58 ms. Allocated memory was 202.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.0 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 12:36:02,250 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.21 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 747.24 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.0 MB in the beginning and 156.3 MB in the end (delta: -56.3 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.85 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 153.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.09 ms. Allocated memory is still 202.4 MB. Free memory was 153.6 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1048.25 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 100.7 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 110074.58 ms. Allocated memory was 202.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.0 MB in the beginning and 2.0 GB in the end (delta: -1.9 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: 6.2s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 7082 VarBasedMoverChecksPositive, 219 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 89688 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L827] FCALL, FORK 0 pthread_create(&t415, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L829] FCALL, FORK 0 pthread_create(&t416, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L762] 2 x = 1 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=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] [L768] 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_p1_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=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] [L768] 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) [L769] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L831] FCALL, FORK 0 pthread_create(&t417, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=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_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 1 [L785] 3 __unbuffered_p2_EAX = y [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 z$flush_delayed = weak$$choice2 [L791] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=9, weak$$choice2=1, x=1, y=1, 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_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L792] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=9, weak$$choice2=1, x=1, y=1, 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_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L792] 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) [L793] 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)) [L794] 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)) [L795] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=9, 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=1, 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_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=9, weak$$choice2=1, 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))=0, x=1, y=1, 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_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 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)) [L798] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=9, 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=1, 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_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 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)) [L799] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=9, weak$$choice2=1, x=1, y=1, 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_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=9, weak$$choice2=1, 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_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 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 [L771] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=9, weak$$choice2=1, 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_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 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) [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 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 [L805] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L806] 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 [L807] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=9, weak$$choice2=1, x=1, y=1, 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=1, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L839] 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 [L840] 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, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 109.7s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 30.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7775 SDtfs, 10019 SDslu, 20832 SDs, 0 SdLazy, 9965 SolverSat, 462 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 379 GetRequests, 73 SyntacticMatches, 24 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143879occurred 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: 48.3s AutomataMinimizationTime, 33 MinimizatonAttempts, 495046 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 1431 NumberOfCodeBlocks, 1431 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1331 ConstructedInterpolants, 0 QuantifiedInterpolants, 230598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...