/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:54:19,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:54:19,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:54:19,991 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:54:19,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:54:19,994 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:54:19,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:54:20,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:54:20,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:54:20,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:54:20,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:54:20,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:54:20,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:54:20,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:54:20,019 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:54:20,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:54:20,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:54:20,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:54:20,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:54:20,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:54:20,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:54:20,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:54:20,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:54:20,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:54:20,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:54:20,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:54:20,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:54:20,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:54:20,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:54:20,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:54:20,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:54:20,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:54:20,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:54:20,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:54:20,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:54:20,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:54:20,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:54:20,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:54:20,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:54:20,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:54:20,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:54:20,063 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:54:20,087 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:54:20,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:54:20,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:54:20,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:54:20,091 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:54:20,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:54:20,092 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:54:20,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:54:20,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:54:20,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:54:20,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:54:20,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:54:20,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:54:20,094 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:54:20,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:54:20,095 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:54:20,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:54:20,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:54:20,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:54:20,096 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:54:20,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:54:20,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:54:20,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:54:20,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:54:20,097 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:54:20,097 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:54:20,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:54:20,098 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:54:20,098 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:54:20,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:54:20,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:54:20,450 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:54:20,451 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:54:20,451 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:54:20,452 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_pso.oepc.i [2019-12-27 01:54:20,518 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/959437e68/b4bd36da843b4ec2aaa6e3f9d9ec5253/FLAGb190cc6a8 [2019-12-27 01:54:21,095 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:54:21,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_pso.oepc.i [2019-12-27 01:54:21,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/959437e68/b4bd36da843b4ec2aaa6e3f9d9ec5253/FLAGb190cc6a8 [2019-12-27 01:54:21,344 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/959437e68/b4bd36da843b4ec2aaa6e3f9d9ec5253 [2019-12-27 01:54:21,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:54:21,358 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:54:21,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:54:21,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:54:21,363 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:54:21,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:54:21" (1/1) ... [2019-12-27 01:54:21,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61be2d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:21, skipping insertion in model container [2019-12-27 01:54:21,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:54:21" (1/1) ... [2019-12-27 01:54:21,375 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:54:21,428 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:54:21,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:54:21,905 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:54:22,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:54:22,119 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:54:22,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:22 WrapperNode [2019-12-27 01:54:22,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:54:22,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:54:22,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:54:22,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:54:22,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:22" (1/1) ... [2019-12-27 01:54:22,159 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:22" (1/1) ... [2019-12-27 01:54:22,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:54:22,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:54:22,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:54:22,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:54:22,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:22" (1/1) ... [2019-12-27 01:54:22,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:22" (1/1) ... [2019-12-27 01:54:22,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:22" (1/1) ... [2019-12-27 01:54:22,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:22" (1/1) ... [2019-12-27 01:54:22,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:22" (1/1) ... [2019-12-27 01:54:22,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:22" (1/1) ... [2019-12-27 01:54:22,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:22" (1/1) ... [2019-12-27 01:54:22,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:54:22,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:54:22,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:54:22,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:54:22,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:54:22,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:54:22,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:54:22,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:54:22,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:54:22,300 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:54:22,300 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:54:22,301 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:54:22,301 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:54:22,302 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:54:22,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:54:22,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:54:22,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:54:22,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:54:22,308 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:54:23,138 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:54:23,139 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:54:23,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:54:23 BoogieIcfgContainer [2019-12-27 01:54:23,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:54:23,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:54:23,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:54:23,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:54:23,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:54:21" (1/3) ... [2019-12-27 01:54:23,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f20fed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:54:23, skipping insertion in model container [2019-12-27 01:54:23,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:22" (2/3) ... [2019-12-27 01:54:23,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f20fed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:54:23, skipping insertion in model container [2019-12-27 01:54:23,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:54:23" (3/3) ... [2019-12-27 01:54:23,149 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_pso.oepc.i [2019-12-27 01:54:23,160 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:54:23,161 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:54:23,169 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:54:23,170 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:54:23,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,216 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,217 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,217 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,218 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,218 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,248 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,249 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,256 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,256 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,284 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,287 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,294 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,294 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,295 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,300 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,301 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:23,320 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:54:23,341 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:54:23,342 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:54:23,342 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:54:23,342 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:54:23,342 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:54:23,342 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:54:23,342 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:54:23,342 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:54:23,360 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 01:54:23,362 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 01:54:23,466 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 01:54:23,467 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:54:23,486 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:54:23,513 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 01:54:23,583 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 01:54:23,583 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:54:23,598 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:54:23,625 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 01:54:23,626 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:54:28,359 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-12-27 01:54:28,769 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 01:54:28,917 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 01:54:28,936 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78858 [2019-12-27 01:54:28,937 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 01:54:28,940 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 01:54:46,927 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115112 states. [2019-12-27 01:54:46,929 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states. [2019-12-27 01:54:46,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:54:46,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:46,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:54:46,935 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:46,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:46,940 INFO L82 PathProgramCache]: Analyzing trace with hash 917918, now seen corresponding path program 1 times [2019-12-27 01:54:46,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:46,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869814993] [2019-12-27 01:54:46,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:54:47,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869814993] [2019-12-27 01:54:47,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:47,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:54:47,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115947144] [2019-12-27 01:54:47,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:54:47,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:47,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:54:47,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:54:47,243 INFO L87 Difference]: Start difference. First operand 115112 states. Second operand 3 states. [2019-12-27 01:54:48,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:48,850 INFO L93 Difference]: Finished difference Result 114110 states and 484570 transitions. [2019-12-27 01:54:48,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:54:48,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:54:48,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:49,589 INFO L225 Difference]: With dead ends: 114110 [2019-12-27 01:54:49,589 INFO L226 Difference]: Without dead ends: 107012 [2019-12-27 01:54:49,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:54:56,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107012 states. [2019-12-27 01:54:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107012 to 107012. [2019-12-27 01:54:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107012 states. [2019-12-27 01:55:04,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107012 states to 107012 states and 453812 transitions. [2019-12-27 01:55:04,159 INFO L78 Accepts]: Start accepts. Automaton has 107012 states and 453812 transitions. Word has length 3 [2019-12-27 01:55:04,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:04,160 INFO L462 AbstractCegarLoop]: Abstraction has 107012 states and 453812 transitions. [2019-12-27 01:55:04,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:55:04,160 INFO L276 IsEmpty]: Start isEmpty. Operand 107012 states and 453812 transitions. [2019-12-27 01:55:04,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:55:04,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:04,165 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:04,166 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:04,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:04,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1578322365, now seen corresponding path program 1 times [2019-12-27 01:55:04,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:04,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760627989] [2019-12-27 01:55:04,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:04,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:04,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760627989] [2019-12-27 01:55:04,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:04,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:55:04,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023933665] [2019-12-27 01:55:04,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:55:04,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:04,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:55:04,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:55:04,263 INFO L87 Difference]: Start difference. First operand 107012 states and 453812 transitions. Second operand 4 states. [2019-12-27 01:55:09,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:09,963 INFO L93 Difference]: Finished difference Result 166210 states and 677236 transitions. [2019-12-27 01:55:09,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:55:09,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:55:09,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:10,689 INFO L225 Difference]: With dead ends: 166210 [2019-12-27 01:55:10,690 INFO L226 Difference]: Without dead ends: 166161 [2019-12-27 01:55:10,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:55:15,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166161 states. [2019-12-27 01:55:18,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166161 to 151748. [2019-12-27 01:55:18,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151748 states. [2019-12-27 01:55:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151748 states to 151748 states and 626089 transitions. [2019-12-27 01:55:19,291 INFO L78 Accepts]: Start accepts. Automaton has 151748 states and 626089 transitions. Word has length 11 [2019-12-27 01:55:19,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:19,291 INFO L462 AbstractCegarLoop]: Abstraction has 151748 states and 626089 transitions. [2019-12-27 01:55:19,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:55:19,291 INFO L276 IsEmpty]: Start isEmpty. Operand 151748 states and 626089 transitions. [2019-12-27 01:55:19,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:55:19,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:19,299 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:19,299 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:19,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:19,300 INFO L82 PathProgramCache]: Analyzing trace with hash 608601994, now seen corresponding path program 1 times [2019-12-27 01:55:19,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:19,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919937190] [2019-12-27 01:55:19,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:19,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:19,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919937190] [2019-12-27 01:55:19,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:19,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:55:19,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039067336] [2019-12-27 01:55:19,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:55:19,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:19,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:55:19,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:55:19,371 INFO L87 Difference]: Start difference. First operand 151748 states and 626089 transitions. Second operand 3 states. [2019-12-27 01:55:24,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:24,078 INFO L93 Difference]: Finished difference Result 33068 states and 106908 transitions. [2019-12-27 01:55:24,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:55:24,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:55:24,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:24,170 INFO L225 Difference]: With dead ends: 33068 [2019-12-27 01:55:24,170 INFO L226 Difference]: Without dead ends: 33068 [2019-12-27 01:55:24,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:55:24,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33068 states. [2019-12-27 01:55:24,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33068 to 33068. [2019-12-27 01:55:24,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-27 01:55:24,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 106908 transitions. [2019-12-27 01:55:24,738 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 106908 transitions. Word has length 13 [2019-12-27 01:55:24,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:24,738 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 106908 transitions. [2019-12-27 01:55:24,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:55:24,739 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 106908 transitions. [2019-12-27 01:55:24,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:55:24,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:24,742 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:24,742 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:24,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:24,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1174763718, now seen corresponding path program 1 times [2019-12-27 01:55:24,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:24,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691434285] [2019-12-27 01:55:24,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:24,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691434285] [2019-12-27 01:55:24,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:24,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:55:24,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435825230] [2019-12-27 01:55:24,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:55:24,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:24,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:55:24,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:55:24,864 INFO L87 Difference]: Start difference. First operand 33068 states and 106908 transitions. Second operand 5 states. [2019-12-27 01:55:25,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:25,379 INFO L93 Difference]: Finished difference Result 45410 states and 145082 transitions. [2019-12-27 01:55:25,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:55:25,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 01:55:25,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:25,489 INFO L225 Difference]: With dead ends: 45410 [2019-12-27 01:55:25,489 INFO L226 Difference]: Without dead ends: 45410 [2019-12-27 01:55:25,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:55:25,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45410 states. [2019-12-27 01:55:26,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45410 to 38207. [2019-12-27 01:55:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38207 states. [2019-12-27 01:55:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38207 states to 38207 states and 123094 transitions. [2019-12-27 01:55:26,477 INFO L78 Accepts]: Start accepts. Automaton has 38207 states and 123094 transitions. Word has length 16 [2019-12-27 01:55:26,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:26,478 INFO L462 AbstractCegarLoop]: Abstraction has 38207 states and 123094 transitions. [2019-12-27 01:55:26,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:55:26,478 INFO L276 IsEmpty]: Start isEmpty. Operand 38207 states and 123094 transitions. [2019-12-27 01:55:26,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:55:26,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:26,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:26,489 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:26,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:26,489 INFO L82 PathProgramCache]: Analyzing trace with hash -219431606, now seen corresponding path program 1 times [2019-12-27 01:55:26,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:26,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746889721] [2019-12-27 01:55:26,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:26,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746889721] [2019-12-27 01:55:26,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:26,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:55:26,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782579567] [2019-12-27 01:55:26,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:55:26,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:26,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:55:26,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:55:26,594 INFO L87 Difference]: Start difference. First operand 38207 states and 123094 transitions. Second operand 6 states. [2019-12-27 01:55:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:27,650 INFO L93 Difference]: Finished difference Result 56872 states and 178934 transitions. [2019-12-27 01:55:27,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:55:27,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 01:55:27,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:27,744 INFO L225 Difference]: With dead ends: 56872 [2019-12-27 01:55:27,744 INFO L226 Difference]: Without dead ends: 56865 [2019-12-27 01:55:27,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:55:27,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56865 states. [2019-12-27 01:55:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56865 to 38602. [2019-12-27 01:55:28,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38602 states. [2019-12-27 01:55:28,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38602 states to 38602 states and 123793 transitions. [2019-12-27 01:55:28,819 INFO L78 Accepts]: Start accepts. Automaton has 38602 states and 123793 transitions. Word has length 22 [2019-12-27 01:55:28,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:28,819 INFO L462 AbstractCegarLoop]: Abstraction has 38602 states and 123793 transitions. [2019-12-27 01:55:28,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:55:28,819 INFO L276 IsEmpty]: Start isEmpty. Operand 38602 states and 123793 transitions. [2019-12-27 01:55:28,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:55:28,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:28,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:28,833 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:28,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:28,834 INFO L82 PathProgramCache]: Analyzing trace with hash -2132778958, now seen corresponding path program 1 times [2019-12-27 01:55:28,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:28,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804177801] [2019-12-27 01:55:28,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:28,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804177801] [2019-12-27 01:55:28,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:28,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:55:28,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662714976] [2019-12-27 01:55:28,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:55:28,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:28,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:55:28,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:55:28,898 INFO L87 Difference]: Start difference. First operand 38602 states and 123793 transitions. Second operand 4 states. [2019-12-27 01:55:28,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:28,964 INFO L93 Difference]: Finished difference Result 16014 states and 48574 transitions. [2019-12-27 01:55:28,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:55:28,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:55:28,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:28,987 INFO L225 Difference]: With dead ends: 16014 [2019-12-27 01:55:28,987 INFO L226 Difference]: Without dead ends: 16014 [2019-12-27 01:55:28,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:55:29,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2019-12-27 01:55:29,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 15686. [2019-12-27 01:55:29,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15686 states. [2019-12-27 01:55:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15686 states to 15686 states and 47638 transitions. [2019-12-27 01:55:29,222 INFO L78 Accepts]: Start accepts. Automaton has 15686 states and 47638 transitions. Word has length 25 [2019-12-27 01:55:29,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:29,222 INFO L462 AbstractCegarLoop]: Abstraction has 15686 states and 47638 transitions. [2019-12-27 01:55:29,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:55:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand 15686 states and 47638 transitions. [2019-12-27 01:55:29,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:55:29,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:29,236 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:29,236 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:29,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:29,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1790545903, now seen corresponding path program 1 times [2019-12-27 01:55:29,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:29,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444178319] [2019-12-27 01:55:29,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:29,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444178319] [2019-12-27 01:55:29,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:29,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:55:29,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575548748] [2019-12-27 01:55:29,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:55:29,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:29,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:55:29,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:55:29,333 INFO L87 Difference]: Start difference. First operand 15686 states and 47638 transitions. Second operand 6 states. [2019-12-27 01:55:29,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:29,966 INFO L93 Difference]: Finished difference Result 22624 states and 66983 transitions. [2019-12-27 01:55:29,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 01:55:29,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 01:55:29,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:29,998 INFO L225 Difference]: With dead ends: 22624 [2019-12-27 01:55:29,998 INFO L226 Difference]: Without dead ends: 22624 [2019-12-27 01:55:29,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:55:30,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22624 states. [2019-12-27 01:55:30,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22624 to 18003. [2019-12-27 01:55:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18003 states. [2019-12-27 01:55:30,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18003 states to 18003 states and 54460 transitions. [2019-12-27 01:55:30,429 INFO L78 Accepts]: Start accepts. Automaton has 18003 states and 54460 transitions. Word has length 27 [2019-12-27 01:55:30,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:30,430 INFO L462 AbstractCegarLoop]: Abstraction has 18003 states and 54460 transitions. [2019-12-27 01:55:30,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:55:30,430 INFO L276 IsEmpty]: Start isEmpty. Operand 18003 states and 54460 transitions. [2019-12-27 01:55:30,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:55:30,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:30,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:30,448 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:30,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:30,448 INFO L82 PathProgramCache]: Analyzing trace with hash -718999585, now seen corresponding path program 1 times [2019-12-27 01:55:30,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:30,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760796328] [2019-12-27 01:55:30,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:30,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:30,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760796328] [2019-12-27 01:55:30,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:30,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:55:30,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448356183] [2019-12-27 01:55:30,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:55:30,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:30,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:55:30,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:55:30,561 INFO L87 Difference]: Start difference. First operand 18003 states and 54460 transitions. Second operand 7 states. [2019-12-27 01:55:31,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:31,674 INFO L93 Difference]: Finished difference Result 24689 states and 72792 transitions. [2019-12-27 01:55:31,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:55:31,675 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 01:55:31,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:31,709 INFO L225 Difference]: With dead ends: 24689 [2019-12-27 01:55:31,710 INFO L226 Difference]: Without dead ends: 24689 [2019-12-27 01:55:31,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:55:31,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24689 states. [2019-12-27 01:55:31,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24689 to 16556. [2019-12-27 01:55:31,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16556 states. [2019-12-27 01:55:32,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16556 states to 16556 states and 50149 transitions. [2019-12-27 01:55:32,003 INFO L78 Accepts]: Start accepts. Automaton has 16556 states and 50149 transitions. Word has length 33 [2019-12-27 01:55:32,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:32,004 INFO L462 AbstractCegarLoop]: Abstraction has 16556 states and 50149 transitions. [2019-12-27 01:55:32,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:55:32,004 INFO L276 IsEmpty]: Start isEmpty. Operand 16556 states and 50149 transitions. [2019-12-27 01:55:32,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:55:32,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:32,026 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:32,026 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:32,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:32,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1488715022, now seen corresponding path program 1 times [2019-12-27 01:55:32,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:32,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734964782] [2019-12-27 01:55:32,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:32,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:32,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734964782] [2019-12-27 01:55:32,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:32,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:55:32,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116319330] [2019-12-27 01:55:32,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:55:32,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:32,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:55:32,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:55:32,099 INFO L87 Difference]: Start difference. First operand 16556 states and 50149 transitions. Second operand 3 states. [2019-12-27 01:55:32,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:32,207 INFO L93 Difference]: Finished difference Result 31245 states and 94721 transitions. [2019-12-27 01:55:32,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:55:32,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:55:32,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:32,232 INFO L225 Difference]: With dead ends: 31245 [2019-12-27 01:55:32,233 INFO L226 Difference]: Without dead ends: 17019 [2019-12-27 01:55:32,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:55:32,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2019-12-27 01:55:32,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 16954. [2019-12-27 01:55:32,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-27 01:55:32,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50123 transitions. [2019-12-27 01:55:32,475 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50123 transitions. Word has length 39 [2019-12-27 01:55:32,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:32,476 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50123 transitions. [2019-12-27 01:55:32,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:55:32,476 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50123 transitions. [2019-12-27 01:55:32,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:55:32,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:32,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:32,497 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:32,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:32,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1258899919, now seen corresponding path program 1 times [2019-12-27 01:55:32,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:32,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086174457] [2019-12-27 01:55:32,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:32,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086174457] [2019-12-27 01:55:32,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:32,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:55:32,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134293306] [2019-12-27 01:55:32,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:55:32,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:32,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:55:32,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:55:32,745 INFO L87 Difference]: Start difference. First operand 16954 states and 50123 transitions. Second operand 4 states. [2019-12-27 01:55:32,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:32,849 INFO L93 Difference]: Finished difference Result 24032 states and 72414 transitions. [2019-12-27 01:55:32,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:55:32,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 01:55:32,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:32,867 INFO L225 Difference]: With dead ends: 24032 [2019-12-27 01:55:32,868 INFO L226 Difference]: Without dead ends: 10093 [2019-12-27 01:55:32,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:55:32,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2019-12-27 01:55:33,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 10019. [2019-12-27 01:55:33,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10019 states. [2019-12-27 01:55:33,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10019 states to 10019 states and 28985 transitions. [2019-12-27 01:55:33,020 INFO L78 Accepts]: Start accepts. Automaton has 10019 states and 28985 transitions. Word has length 40 [2019-12-27 01:55:33,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:33,020 INFO L462 AbstractCegarLoop]: Abstraction has 10019 states and 28985 transitions. [2019-12-27 01:55:33,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:55:33,020 INFO L276 IsEmpty]: Start isEmpty. Operand 10019 states and 28985 transitions. [2019-12-27 01:55:33,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:55:33,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:33,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:33,033 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:33,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:33,034 INFO L82 PathProgramCache]: Analyzing trace with hash -328554267, now seen corresponding path program 2 times [2019-12-27 01:55:33,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:33,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685933393] [2019-12-27 01:55:33,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:33,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:33,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685933393] [2019-12-27 01:55:33,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:33,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:55:33,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719556687] [2019-12-27 01:55:33,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:55:33,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:33,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:55:33,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:55:33,114 INFO L87 Difference]: Start difference. First operand 10019 states and 28985 transitions. Second operand 5 states. [2019-12-27 01:55:33,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:33,164 INFO L93 Difference]: Finished difference Result 9224 states and 27210 transitions. [2019-12-27 01:55:33,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:55:33,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:55:33,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:33,175 INFO L225 Difference]: With dead ends: 9224 [2019-12-27 01:55:33,175 INFO L226 Difference]: Without dead ends: 6480 [2019-12-27 01:55:33,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:55:33,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6480 states. [2019-12-27 01:55:33,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6480 to 6480. [2019-12-27 01:55:33,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6480 states. [2019-12-27 01:55:33,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6480 states to 6480 states and 20925 transitions. [2019-12-27 01:55:33,283 INFO L78 Accepts]: Start accepts. Automaton has 6480 states and 20925 transitions. Word has length 40 [2019-12-27 01:55:33,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:33,283 INFO L462 AbstractCegarLoop]: Abstraction has 6480 states and 20925 transitions. [2019-12-27 01:55:33,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:55:33,283 INFO L276 IsEmpty]: Start isEmpty. Operand 6480 states and 20925 transitions. [2019-12-27 01:55:33,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:55:33,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:33,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:33,291 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:33,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:33,291 INFO L82 PathProgramCache]: Analyzing trace with hash -195559637, now seen corresponding path program 1 times [2019-12-27 01:55:33,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:33,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969912704] [2019-12-27 01:55:33,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:33,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:33,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969912704] [2019-12-27 01:55:33,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:33,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:55:33,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862396593] [2019-12-27 01:55:33,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:55:33,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:33,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:55:33,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:55:33,348 INFO L87 Difference]: Start difference. First operand 6480 states and 20925 transitions. Second operand 3 states. [2019-12-27 01:55:33,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:33,416 INFO L93 Difference]: Finished difference Result 9612 states and 30454 transitions. [2019-12-27 01:55:33,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:55:33,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:55:33,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:33,434 INFO L225 Difference]: With dead ends: 9612 [2019-12-27 01:55:33,434 INFO L226 Difference]: Without dead ends: 9612 [2019-12-27 01:55:33,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:55:33,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9612 states. [2019-12-27 01:55:33,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9612 to 7416. [2019-12-27 01:55:33,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7416 states. [2019-12-27 01:55:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7416 states to 7416 states and 23733 transitions. [2019-12-27 01:55:33,592 INFO L78 Accepts]: Start accepts. Automaton has 7416 states and 23733 transitions. Word has length 64 [2019-12-27 01:55:33,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:33,592 INFO L462 AbstractCegarLoop]: Abstraction has 7416 states and 23733 transitions. [2019-12-27 01:55:33,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:55:33,593 INFO L276 IsEmpty]: Start isEmpty. Operand 7416 states and 23733 transitions. [2019-12-27 01:55:33,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:55:33,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:33,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:33,601 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:33,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:33,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1426110435, now seen corresponding path program 1 times [2019-12-27 01:55:33,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:33,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300607629] [2019-12-27 01:55:33,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:33,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:33,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300607629] [2019-12-27 01:55:33,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:33,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:55:33,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593819470] [2019-12-27 01:55:33,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:55:33,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:33,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:55:33,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:55:33,720 INFO L87 Difference]: Start difference. First operand 7416 states and 23733 transitions. Second operand 7 states. [2019-12-27 01:55:34,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:34,006 INFO L93 Difference]: Finished difference Result 14786 states and 46379 transitions. [2019-12-27 01:55:34,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:55:34,007 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:55:34,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:34,027 INFO L225 Difference]: With dead ends: 14786 [2019-12-27 01:55:34,027 INFO L226 Difference]: Without dead ends: 11103 [2019-12-27 01:55:34,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:55:34,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11103 states. [2019-12-27 01:55:34,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11103 to 9096. [2019-12-27 01:55:34,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9096 states. [2019-12-27 01:55:34,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9096 states to 9096 states and 28970 transitions. [2019-12-27 01:55:34,191 INFO L78 Accepts]: Start accepts. Automaton has 9096 states and 28970 transitions. Word has length 64 [2019-12-27 01:55:34,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:34,191 INFO L462 AbstractCegarLoop]: Abstraction has 9096 states and 28970 transitions. [2019-12-27 01:55:34,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:55:34,191 INFO L276 IsEmpty]: Start isEmpty. Operand 9096 states and 28970 transitions. [2019-12-27 01:55:34,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:55:34,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:34,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:34,202 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:34,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:34,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1226826331, now seen corresponding path program 2 times [2019-12-27 01:55:34,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:34,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662655063] [2019-12-27 01:55:34,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:34,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:34,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662655063] [2019-12-27 01:55:34,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:34,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:55:34,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616943261] [2019-12-27 01:55:34,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:55:34,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:34,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:55:34,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:55:34,297 INFO L87 Difference]: Start difference. First operand 9096 states and 28970 transitions. Second operand 7 states. [2019-12-27 01:55:34,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:34,572 INFO L93 Difference]: Finished difference Result 16709 states and 52072 transitions. [2019-12-27 01:55:34,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:55:34,572 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:55:34,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:34,595 INFO L225 Difference]: With dead ends: 16709 [2019-12-27 01:55:34,595 INFO L226 Difference]: Without dead ends: 12623 [2019-12-27 01:55:34,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:55:34,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12623 states. [2019-12-27 01:55:34,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12623 to 10382. [2019-12-27 01:55:34,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10382 states. [2019-12-27 01:55:34,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10382 states to 10382 states and 32866 transitions. [2019-12-27 01:55:34,797 INFO L78 Accepts]: Start accepts. Automaton has 10382 states and 32866 transitions. Word has length 64 [2019-12-27 01:55:34,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:34,798 INFO L462 AbstractCegarLoop]: Abstraction has 10382 states and 32866 transitions. [2019-12-27 01:55:34,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:55:34,798 INFO L276 IsEmpty]: Start isEmpty. Operand 10382 states and 32866 transitions. [2019-12-27 01:55:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:55:34,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:34,931 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:34,932 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:34,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:34,932 INFO L82 PathProgramCache]: Analyzing trace with hash -2098893209, now seen corresponding path program 3 times [2019-12-27 01:55:34,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:34,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10047035] [2019-12-27 01:55:34,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:35,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10047035] [2019-12-27 01:55:35,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:35,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:55:35,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443896515] [2019-12-27 01:55:35,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:55:35,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:35,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:55:35,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:55:35,050 INFO L87 Difference]: Start difference. First operand 10382 states and 32866 transitions. Second operand 9 states. [2019-12-27 01:55:36,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:36,234 INFO L93 Difference]: Finished difference Result 36233 states and 111090 transitions. [2019-12-27 01:55:36,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 01:55:36,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:55:36,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:36,291 INFO L225 Difference]: With dead ends: 36233 [2019-12-27 01:55:36,292 INFO L226 Difference]: Without dead ends: 32009 [2019-12-27 01:55:36,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-12-27 01:55:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32009 states. [2019-12-27 01:55:36,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32009 to 10214. [2019-12-27 01:55:36,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10214 states. [2019-12-27 01:55:36,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10214 states to 10214 states and 32290 transitions. [2019-12-27 01:55:36,597 INFO L78 Accepts]: Start accepts. Automaton has 10214 states and 32290 transitions. Word has length 64 [2019-12-27 01:55:36,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:36,598 INFO L462 AbstractCegarLoop]: Abstraction has 10214 states and 32290 transitions. [2019-12-27 01:55:36,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:55:36,598 INFO L276 IsEmpty]: Start isEmpty. Operand 10214 states and 32290 transitions. [2019-12-27 01:55:36,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:55:36,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:36,613 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:36,613 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:36,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:36,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1900940369, now seen corresponding path program 1 times [2019-12-27 01:55:36,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:36,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332396076] [2019-12-27 01:55:36,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:36,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:36,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332396076] [2019-12-27 01:55:36,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:36,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:55:36,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857131861] [2019-12-27 01:55:36,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:55:36,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:36,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:55:36,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:55:36,674 INFO L87 Difference]: Start difference. First operand 10214 states and 32290 transitions. Second operand 3 states. [2019-12-27 01:55:36,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:36,770 INFO L93 Difference]: Finished difference Result 12867 states and 40113 transitions. [2019-12-27 01:55:36,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:55:36,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:55:36,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:36,795 INFO L225 Difference]: With dead ends: 12867 [2019-12-27 01:55:36,795 INFO L226 Difference]: Without dead ends: 12867 [2019-12-27 01:55:36,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:55:36,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12867 states. [2019-12-27 01:55:37,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12867 to 10671. [2019-12-27 01:55:37,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10671 states. [2019-12-27 01:55:37,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10671 states to 10671 states and 33392 transitions. [2019-12-27 01:55:37,067 INFO L78 Accepts]: Start accepts. Automaton has 10671 states and 33392 transitions. Word has length 64 [2019-12-27 01:55:37,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:37,068 INFO L462 AbstractCegarLoop]: Abstraction has 10671 states and 33392 transitions. [2019-12-27 01:55:37,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:55:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 10671 states and 33392 transitions. [2019-12-27 01:55:37,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:55:37,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:37,086 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:37,087 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:37,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:37,087 INFO L82 PathProgramCache]: Analyzing trace with hash -612356637, now seen corresponding path program 4 times [2019-12-27 01:55:37,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:37,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183378933] [2019-12-27 01:55:37,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:37,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:37,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183378933] [2019-12-27 01:55:37,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:37,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:55:37,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422695348] [2019-12-27 01:55:37,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:55:37,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:37,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:55:37,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:55:37,213 INFO L87 Difference]: Start difference. First operand 10671 states and 33392 transitions. Second operand 9 states. [2019-12-27 01:55:38,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:38,159 INFO L93 Difference]: Finished difference Result 28791 states and 88355 transitions. [2019-12-27 01:55:38,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:55:38,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:55:38,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:38,195 INFO L225 Difference]: With dead ends: 28791 [2019-12-27 01:55:38,195 INFO L226 Difference]: Without dead ends: 26476 [2019-12-27 01:55:38,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:55:38,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26476 states. [2019-12-27 01:55:38,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26476 to 10699. [2019-12-27 01:55:38,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10699 states. [2019-12-27 01:55:38,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10699 states to 10699 states and 33546 transitions. [2019-12-27 01:55:38,576 INFO L78 Accepts]: Start accepts. Automaton has 10699 states and 33546 transitions. Word has length 64 [2019-12-27 01:55:38,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:38,576 INFO L462 AbstractCegarLoop]: Abstraction has 10699 states and 33546 transitions. [2019-12-27 01:55:38,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:55:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 10699 states and 33546 transitions. [2019-12-27 01:55:38,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:55:38,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:38,589 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:38,589 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:38,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:38,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1413769055, now seen corresponding path program 5 times [2019-12-27 01:55:38,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:38,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123102762] [2019-12-27 01:55:38,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:38,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123102762] [2019-12-27 01:55:38,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:38,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:55:38,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860454454] [2019-12-27 01:55:38,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:55:38,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:38,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:55:38,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:55:38,674 INFO L87 Difference]: Start difference. First operand 10699 states and 33546 transitions. Second operand 5 states. [2019-12-27 01:55:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:38,980 INFO L93 Difference]: Finished difference Result 12384 states and 38249 transitions. [2019-12-27 01:55:38,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:55:38,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-27 01:55:38,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:38,999 INFO L225 Difference]: With dead ends: 12384 [2019-12-27 01:55:38,999 INFO L226 Difference]: Without dead ends: 12384 [2019-12-27 01:55:38,999 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-27 01:55:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12384 states. [2019-12-27 01:55:39,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12384 to 11630. [2019-12-27 01:55:39,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11630 states. [2019-12-27 01:55:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11630 states to 11630 states and 36167 transitions. [2019-12-27 01:55:39,188 INFO L78 Accepts]: Start accepts. Automaton has 11630 states and 36167 transitions. Word has length 64 [2019-12-27 01:55:39,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:39,188 INFO L462 AbstractCegarLoop]: Abstraction has 11630 states and 36167 transitions. [2019-12-27 01:55:39,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:55:39,188 INFO L276 IsEmpty]: Start isEmpty. Operand 11630 states and 36167 transitions. [2019-12-27 01:55:39,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:55:39,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:39,208 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:39,208 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:39,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:39,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1714079827, now seen corresponding path program 6 times [2019-12-27 01:55:39,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:39,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556188160] [2019-12-27 01:55:39,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:39,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:39,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556188160] [2019-12-27 01:55:39,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:39,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:55:39,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830907640] [2019-12-27 01:55:39,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:55:39,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:39,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:55:39,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:55:39,311 INFO L87 Difference]: Start difference. First operand 11630 states and 36167 transitions. Second operand 7 states. [2019-12-27 01:55:40,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:40,261 INFO L93 Difference]: Finished difference Result 20495 states and 61153 transitions. [2019-12-27 01:55:40,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 01:55:40,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:55:40,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:40,292 INFO L225 Difference]: With dead ends: 20495 [2019-12-27 01:55:40,292 INFO L226 Difference]: Without dead ends: 20327 [2019-12-27 01:55:40,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:55:40,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20327 states. [2019-12-27 01:55:40,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20327 to 17055. [2019-12-27 01:55:40,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17055 states. [2019-12-27 01:55:40,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17055 states to 17055 states and 51675 transitions. [2019-12-27 01:55:40,564 INFO L78 Accepts]: Start accepts. Automaton has 17055 states and 51675 transitions. Word has length 64 [2019-12-27 01:55:40,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:40,564 INFO L462 AbstractCegarLoop]: Abstraction has 17055 states and 51675 transitions. [2019-12-27 01:55:40,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:55:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 17055 states and 51675 transitions. [2019-12-27 01:55:40,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:55:40,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:40,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:40,584 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:40,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:40,584 INFO L82 PathProgramCache]: Analyzing trace with hash 768567647, now seen corresponding path program 7 times [2019-12-27 01:55:40,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:40,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796147452] [2019-12-27 01:55:40,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:40,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796147452] [2019-12-27 01:55:40,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:40,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:55:40,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894307050] [2019-12-27 01:55:40,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:55:40,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:40,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:55:40,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:55:40,673 INFO L87 Difference]: Start difference. First operand 17055 states and 51675 transitions. Second operand 6 states. [2019-12-27 01:55:41,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:41,418 INFO L93 Difference]: Finished difference Result 30832 states and 92113 transitions. [2019-12-27 01:55:41,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 01:55:41,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 01:55:41,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:41,460 INFO L225 Difference]: With dead ends: 30832 [2019-12-27 01:55:41,461 INFO L226 Difference]: Without dead ends: 30612 [2019-12-27 01:55:41,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:55:41,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30612 states. [2019-12-27 01:55:41,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30612 to 22076. [2019-12-27 01:55:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22076 states. [2019-12-27 01:55:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22076 states to 22076 states and 66013 transitions. [2019-12-27 01:55:42,020 INFO L78 Accepts]: Start accepts. Automaton has 22076 states and 66013 transitions. Word has length 64 [2019-12-27 01:55:42,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:42,021 INFO L462 AbstractCegarLoop]: Abstraction has 22076 states and 66013 transitions. [2019-12-27 01:55:42,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:55:42,021 INFO L276 IsEmpty]: Start isEmpty. Operand 22076 states and 66013 transitions. [2019-12-27 01:55:42,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:55:42,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:42,046 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:42,046 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:42,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:42,046 INFO L82 PathProgramCache]: Analyzing trace with hash 908702963, now seen corresponding path program 8 times [2019-12-27 01:55:42,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:42,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629689174] [2019-12-27 01:55:42,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:42,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629689174] [2019-12-27 01:55:42,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:42,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:55:42,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217287676] [2019-12-27 01:55:42,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:55:42,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:42,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:55:42,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:55:42,153 INFO L87 Difference]: Start difference. First operand 22076 states and 66013 transitions. Second operand 3 states. [2019-12-27 01:55:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:42,244 INFO L93 Difference]: Finished difference Result 22076 states and 66012 transitions. [2019-12-27 01:55:42,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:55:42,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:55:42,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:42,293 INFO L225 Difference]: With dead ends: 22076 [2019-12-27 01:55:42,293 INFO L226 Difference]: Without dead ends: 22076 [2019-12-27 01:55:42,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:55:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22076 states. [2019-12-27 01:55:42,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22076 to 20293. [2019-12-27 01:55:42,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20293 states. [2019-12-27 01:55:42,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20293 states to 20293 states and 61028 transitions. [2019-12-27 01:55:42,903 INFO L78 Accepts]: Start accepts. Automaton has 20293 states and 61028 transitions. Word has length 64 [2019-12-27 01:55:42,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:42,903 INFO L462 AbstractCegarLoop]: Abstraction has 20293 states and 61028 transitions. [2019-12-27 01:55:42,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:55:42,903 INFO L276 IsEmpty]: Start isEmpty. Operand 20293 states and 61028 transitions. [2019-12-27 01:55:42,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:55:42,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:42,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:42,936 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:42,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:42,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1480180120, now seen corresponding path program 1 times [2019-12-27 01:55:42,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:42,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182407630] [2019-12-27 01:55:42,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:43,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182407630] [2019-12-27 01:55:43,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:43,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:55:43,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080505557] [2019-12-27 01:55:43,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:55:43,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:43,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:55:43,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:55:43,075 INFO L87 Difference]: Start difference. First operand 20293 states and 61028 transitions. Second operand 6 states. [2019-12-27 01:55:43,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:43,757 INFO L93 Difference]: Finished difference Result 26332 states and 77690 transitions. [2019-12-27 01:55:43,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 01:55:43,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 01:55:43,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:43,790 INFO L225 Difference]: With dead ends: 26332 [2019-12-27 01:55:43,790 INFO L226 Difference]: Without dead ends: 26092 [2019-12-27 01:55:43,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:55:43,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26092 states. [2019-12-27 01:55:44,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26092 to 21007. [2019-12-27 01:55:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21007 states. [2019-12-27 01:55:44,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21007 states to 21007 states and 62973 transitions. [2019-12-27 01:55:44,372 INFO L78 Accepts]: Start accepts. Automaton has 21007 states and 62973 transitions. Word has length 65 [2019-12-27 01:55:44,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:44,373 INFO L462 AbstractCegarLoop]: Abstraction has 21007 states and 62973 transitions. [2019-12-27 01:55:44,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:55:44,373 INFO L276 IsEmpty]: Start isEmpty. Operand 21007 states and 62973 transitions. [2019-12-27 01:55:44,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:55:44,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:44,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:44,397 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:44,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:44,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2117464962, now seen corresponding path program 2 times [2019-12-27 01:55:44,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:44,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330722955] [2019-12-27 01:55:44,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:44,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330722955] [2019-12-27 01:55:44,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:44,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:55:44,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983253860] [2019-12-27 01:55:44,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:55:44,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:44,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:55:44,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:55:44,463 INFO L87 Difference]: Start difference. First operand 21007 states and 62973 transitions. Second operand 3 states. [2019-12-27 01:55:44,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:44,529 INFO L93 Difference]: Finished difference Result 14534 states and 43150 transitions. [2019-12-27 01:55:44,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:55:44,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 01:55:44,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:44,554 INFO L225 Difference]: With dead ends: 14534 [2019-12-27 01:55:44,554 INFO L226 Difference]: Without dead ends: 14534 [2019-12-27 01:55:44,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:55:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14534 states. [2019-12-27 01:55:44,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14534 to 14345. [2019-12-27 01:55:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14345 states. [2019-12-27 01:55:44,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 42613 transitions. [2019-12-27 01:55:44,779 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 42613 transitions. Word has length 65 [2019-12-27 01:55:44,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:44,779 INFO L462 AbstractCegarLoop]: Abstraction has 14345 states and 42613 transitions. [2019-12-27 01:55:44,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:55:44,779 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 42613 transitions. [2019-12-27 01:55:44,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:55:44,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:44,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:44,794 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:44,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:44,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1338482558, now seen corresponding path program 1 times [2019-12-27 01:55:44,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:44,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343861413] [2019-12-27 01:55:44,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:44,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:44,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343861413] [2019-12-27 01:55:44,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:44,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:55:44,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556290087] [2019-12-27 01:55:44,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:55:44,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:44,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:55:44,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:55:44,908 INFO L87 Difference]: Start difference. First operand 14345 states and 42613 transitions. Second operand 8 states. [2019-12-27 01:55:45,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:45,709 INFO L93 Difference]: Finished difference Result 25482 states and 74721 transitions. [2019-12-27 01:55:45,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 01:55:45,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 01:55:45,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:45,733 INFO L225 Difference]: With dead ends: 25482 [2019-12-27 01:55:45,733 INFO L226 Difference]: Without dead ends: 18758 [2019-12-27 01:55:45,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:55:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18758 states. [2019-12-27 01:55:45,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18758 to 15008. [2019-12-27 01:55:45,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15008 states. [2019-12-27 01:55:45,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15008 states to 15008 states and 44099 transitions. [2019-12-27 01:55:45,973 INFO L78 Accepts]: Start accepts. Automaton has 15008 states and 44099 transitions. Word has length 66 [2019-12-27 01:55:45,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:45,973 INFO L462 AbstractCegarLoop]: Abstraction has 15008 states and 44099 transitions. [2019-12-27 01:55:45,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:55:45,973 INFO L276 IsEmpty]: Start isEmpty. Operand 15008 states and 44099 transitions. [2019-12-27 01:55:45,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:55:45,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:45,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:45,987 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:45,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:45,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1029826500, now seen corresponding path program 2 times [2019-12-27 01:55:45,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:45,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559305590] [2019-12-27 01:55:45,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:46,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:46,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559305590] [2019-12-27 01:55:46,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:46,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:55:46,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058467620] [2019-12-27 01:55:46,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:55:46,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:46,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:55:46,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:55:46,090 INFO L87 Difference]: Start difference. First operand 15008 states and 44099 transitions. Second operand 9 states. [2019-12-27 01:55:46,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:46,973 INFO L93 Difference]: Finished difference Result 24021 states and 69932 transitions. [2019-12-27 01:55:46,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 01:55:46,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 01:55:46,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:46,997 INFO L225 Difference]: With dead ends: 24021 [2019-12-27 01:55:46,998 INFO L226 Difference]: Without dead ends: 17577 [2019-12-27 01:55:46,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:55:47,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17577 states. [2019-12-27 01:55:47,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17577 to 14770. [2019-12-27 01:55:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14770 states. [2019-12-27 01:55:47,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14770 states to 14770 states and 43349 transitions. [2019-12-27 01:55:47,240 INFO L78 Accepts]: Start accepts. Automaton has 14770 states and 43349 transitions. Word has length 66 [2019-12-27 01:55:47,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:47,240 INFO L462 AbstractCegarLoop]: Abstraction has 14770 states and 43349 transitions. [2019-12-27 01:55:47,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:55:47,240 INFO L276 IsEmpty]: Start isEmpty. Operand 14770 states and 43349 transitions. [2019-12-27 01:55:47,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:55:47,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:47,256 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:47,256 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:47,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:47,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1662390436, now seen corresponding path program 3 times [2019-12-27 01:55:47,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:47,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003524274] [2019-12-27 01:55:47,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:47,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:47,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003524274] [2019-12-27 01:55:47,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:47,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:55:47,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538148189] [2019-12-27 01:55:47,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:55:47,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:47,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:55:47,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:55:47,629 INFO L87 Difference]: Start difference. First operand 14770 states and 43349 transitions. Second operand 10 states. [2019-12-27 01:55:49,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:49,073 INFO L93 Difference]: Finished difference Result 25274 states and 72784 transitions. [2019-12-27 01:55:49,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 01:55:49,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 01:55:49,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:49,107 INFO L225 Difference]: With dead ends: 25274 [2019-12-27 01:55:49,107 INFO L226 Difference]: Without dead ends: 25274 [2019-12-27 01:55:49,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-27 01:55:49,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25274 states. [2019-12-27 01:55:49,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25274 to 16246. [2019-12-27 01:55:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16246 states. [2019-12-27 01:55:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16246 states to 16246 states and 47556 transitions. [2019-12-27 01:55:49,403 INFO L78 Accepts]: Start accepts. Automaton has 16246 states and 47556 transitions. Word has length 66 [2019-12-27 01:55:49,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:49,403 INFO L462 AbstractCegarLoop]: Abstraction has 16246 states and 47556 transitions. [2019-12-27 01:55:49,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:55:49,403 INFO L276 IsEmpty]: Start isEmpty. Operand 16246 states and 47556 transitions. [2019-12-27 01:55:49,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:55:49,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:49,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:49,420 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:49,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:49,420 INFO L82 PathProgramCache]: Analyzing trace with hash -848717318, now seen corresponding path program 4 times [2019-12-27 01:55:49,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:49,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300040012] [2019-12-27 01:55:49,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:49,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:49,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300040012] [2019-12-27 01:55:49,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:49,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 01:55:49,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674212953] [2019-12-27 01:55:49,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:55:49,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:49,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:55:49,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:55:49,597 INFO L87 Difference]: Start difference. First operand 16246 states and 47556 transitions. Second operand 11 states. [2019-12-27 01:55:50,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:50,952 INFO L93 Difference]: Finished difference Result 24229 states and 69793 transitions. [2019-12-27 01:55:50,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 01:55:50,952 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:55:50,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:50,984 INFO L225 Difference]: With dead ends: 24229 [2019-12-27 01:55:50,984 INFO L226 Difference]: Without dead ends: 24229 [2019-12-27 01:55:50,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:55:51,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24229 states. [2019-12-27 01:55:51,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24229 to 16318. [2019-12-27 01:55:51,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16318 states. [2019-12-27 01:55:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16318 states to 16318 states and 47756 transitions. [2019-12-27 01:55:51,269 INFO L78 Accepts]: Start accepts. Automaton has 16318 states and 47756 transitions. Word has length 66 [2019-12-27 01:55:51,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:51,269 INFO L462 AbstractCegarLoop]: Abstraction has 16318 states and 47756 transitions. [2019-12-27 01:55:51,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:55:51,269 INFO L276 IsEmpty]: Start isEmpty. Operand 16318 states and 47756 transitions. [2019-12-27 01:55:51,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:55:51,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:51,285 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:51,286 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:51,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:51,286 INFO L82 PathProgramCache]: Analyzing trace with hash 150910970, now seen corresponding path program 5 times [2019-12-27 01:55:51,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:51,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129168666] [2019-12-27 01:55:51,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:51,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:51,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129168666] [2019-12-27 01:55:51,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:51,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 01:55:51,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915308764] [2019-12-27 01:55:51,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:55:51,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:51,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:55:51,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:55:51,469 INFO L87 Difference]: Start difference. First operand 16318 states and 47756 transitions. Second operand 11 states. [2019-12-27 01:55:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:53,539 INFO L93 Difference]: Finished difference Result 25237 states and 72487 transitions. [2019-12-27 01:55:53,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:55:53,540 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:55:53,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:53,571 INFO L225 Difference]: With dead ends: 25237 [2019-12-27 01:55:53,571 INFO L226 Difference]: Without dead ends: 25237 [2019-12-27 01:55:53,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2019-12-27 01:55:53,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25237 states. [2019-12-27 01:55:53,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25237 to 15766. [2019-12-27 01:55:53,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15766 states. [2019-12-27 01:55:53,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15766 states to 15766 states and 46172 transitions. [2019-12-27 01:55:53,860 INFO L78 Accepts]: Start accepts. Automaton has 15766 states and 46172 transitions. Word has length 66 [2019-12-27 01:55:53,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:53,861 INFO L462 AbstractCegarLoop]: Abstraction has 15766 states and 46172 transitions. [2019-12-27 01:55:53,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:55:53,861 INFO L276 IsEmpty]: Start isEmpty. Operand 15766 states and 46172 transitions. [2019-12-27 01:55:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:55:53,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:53,876 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:53,877 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:53,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:53,877 INFO L82 PathProgramCache]: Analyzing trace with hash 312790614, now seen corresponding path program 6 times [2019-12-27 01:55:53,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:53,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798845304] [2019-12-27 01:55:53,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:54,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798845304] [2019-12-27 01:55:54,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:54,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:55:54,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30645891] [2019-12-27 01:55:54,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:55:54,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:54,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:55:54,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:55:54,048 INFO L87 Difference]: Start difference. First operand 15766 states and 46172 transitions. Second operand 12 states. [2019-12-27 01:55:55,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:55,270 INFO L93 Difference]: Finished difference Result 20899 states and 60570 transitions. [2019-12-27 01:55:55,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 01:55:55,271 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 01:55:55,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:55,294 INFO L225 Difference]: With dead ends: 20899 [2019-12-27 01:55:55,295 INFO L226 Difference]: Without dead ends: 17669 [2019-12-27 01:55:55,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-27 01:55:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17669 states. [2019-12-27 01:55:55,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17669 to 15994. [2019-12-27 01:55:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15994 states. [2019-12-27 01:55:55,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15994 states to 15994 states and 46693 transitions. [2019-12-27 01:55:55,529 INFO L78 Accepts]: Start accepts. Automaton has 15994 states and 46693 transitions. Word has length 66 [2019-12-27 01:55:55,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:55,529 INFO L462 AbstractCegarLoop]: Abstraction has 15994 states and 46693 transitions. [2019-12-27 01:55:55,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:55:55,529 INFO L276 IsEmpty]: Start isEmpty. Operand 15994 states and 46693 transitions. [2019-12-27 01:55:55,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:55:55,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:55,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:55,546 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:55,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:55,546 INFO L82 PathProgramCache]: Analyzing trace with hash -667839678, now seen corresponding path program 7 times [2019-12-27 01:55:55,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:55,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689877455] [2019-12-27 01:55:55,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:55,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:55,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689877455] [2019-12-27 01:55:55,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:55,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:55:55,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713902999] [2019-12-27 01:55:55,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:55:55,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:55,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:55:55,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:55:55,726 INFO L87 Difference]: Start difference. First operand 15994 states and 46693 transitions. Second operand 11 states. [2019-12-27 01:55:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:56,633 INFO L93 Difference]: Finished difference Result 23245 states and 67100 transitions. [2019-12-27 01:55:56,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 01:55:56,633 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:55:56,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:56,657 INFO L225 Difference]: With dead ends: 23245 [2019-12-27 01:55:56,657 INFO L226 Difference]: Without dead ends: 18005 [2019-12-27 01:55:56,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-12-27 01:55:56,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18005 states. [2019-12-27 01:55:57,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18005 to 15208. [2019-12-27 01:55:57,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15208 states. [2019-12-27 01:55:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15208 states to 15208 states and 44534 transitions. [2019-12-27 01:55:57,029 INFO L78 Accepts]: Start accepts. Automaton has 15208 states and 44534 transitions. Word has length 66 [2019-12-27 01:55:57,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:57,029 INFO L462 AbstractCegarLoop]: Abstraction has 15208 states and 44534 transitions. [2019-12-27 01:55:57,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:55:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand 15208 states and 44534 transitions. [2019-12-27 01:55:57,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:55:57,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:57,044 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:57,044 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:57,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:57,044 INFO L82 PathProgramCache]: Analyzing trace with hash 777925054, now seen corresponding path program 8 times [2019-12-27 01:55:57,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:57,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982365771] [2019-12-27 01:55:57,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:57,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:57,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982365771] [2019-12-27 01:55:57,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:57,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:55:57,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579256925] [2019-12-27 01:55:57,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:55:57,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:57,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:55:57,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:55:57,215 INFO L87 Difference]: Start difference. First operand 15208 states and 44534 transitions. Second operand 10 states. [2019-12-27 01:55:59,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:59,587 INFO L93 Difference]: Finished difference Result 28214 states and 80972 transitions. [2019-12-27 01:55:59,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 01:55:59,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 01:55:59,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:59,623 INFO L225 Difference]: With dead ends: 28214 [2019-12-27 01:55:59,623 INFO L226 Difference]: Without dead ends: 28214 [2019-12-27 01:55:59,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:55:59,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28214 states. [2019-12-27 01:55:59,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28214 to 13004. [2019-12-27 01:55:59,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13004 states. [2019-12-27 01:55:59,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13004 states to 13004 states and 38434 transitions. [2019-12-27 01:55:59,905 INFO L78 Accepts]: Start accepts. Automaton has 13004 states and 38434 transitions. Word has length 66 [2019-12-27 01:55:59,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:59,905 INFO L462 AbstractCegarLoop]: Abstraction has 13004 states and 38434 transitions. [2019-12-27 01:55:59,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:55:59,905 INFO L276 IsEmpty]: Start isEmpty. Operand 13004 states and 38434 transitions. [2019-12-27 01:55:59,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:55:59,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:59,917 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:59,917 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:59,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:59,918 INFO L82 PathProgramCache]: Analyzing trace with hash -124195356, now seen corresponding path program 9 times [2019-12-27 01:55:59,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:59,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027920621] [2019-12-27 01:55:59,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:00,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:00,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027920621] [2019-12-27 01:56:00,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:00,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:56:00,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450913116] [2019-12-27 01:56:00,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:56:00,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:00,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:56:00,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:56:00,033 INFO L87 Difference]: Start difference. First operand 13004 states and 38434 transitions. Second operand 4 states. [2019-12-27 01:56:00,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:00,142 INFO L93 Difference]: Finished difference Result 14948 states and 44329 transitions. [2019-12-27 01:56:00,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:56:00,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 01:56:00,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:00,165 INFO L225 Difference]: With dead ends: 14948 [2019-12-27 01:56:00,165 INFO L226 Difference]: Without dead ends: 14948 [2019-12-27 01:56:00,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:56:00,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14948 states. [2019-12-27 01:56:00,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14948 to 12181. [2019-12-27 01:56:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12181 states. [2019-12-27 01:56:00,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12181 states to 12181 states and 36301 transitions. [2019-12-27 01:56:00,545 INFO L78 Accepts]: Start accepts. Automaton has 12181 states and 36301 transitions. Word has length 66 [2019-12-27 01:56:00,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:00,546 INFO L462 AbstractCegarLoop]: Abstraction has 12181 states and 36301 transitions. [2019-12-27 01:56:00,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:56:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 12181 states and 36301 transitions. [2019-12-27 01:56:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:56:00,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:00,566 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:00,567 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:56:00,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:00,567 INFO L82 PathProgramCache]: Analyzing trace with hash 8609018, now seen corresponding path program 1 times [2019-12-27 01:56:00,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:00,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683588979] [2019-12-27 01:56:00,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:00,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:00,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683588979] [2019-12-27 01:56:00,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:00,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:56:00,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849550200] [2019-12-27 01:56:00,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:56:00,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:00,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:56:00,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:56:00,773 INFO L87 Difference]: Start difference. First operand 12181 states and 36301 transitions. Second operand 12 states. [2019-12-27 01:56:01,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:01,584 INFO L93 Difference]: Finished difference Result 14914 states and 44027 transitions. [2019-12-27 01:56:01,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:56:01,584 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 01:56:01,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:01,611 INFO L225 Difference]: With dead ends: 14914 [2019-12-27 01:56:01,611 INFO L226 Difference]: Without dead ends: 14493 [2019-12-27 01:56:01,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 01:56:01,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14493 states. [2019-12-27 01:56:01,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14493 to 11927. [2019-12-27 01:56:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11927 states. [2019-12-27 01:56:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11927 states to 11927 states and 35657 transitions. [2019-12-27 01:56:01,968 INFO L78 Accepts]: Start accepts. Automaton has 11927 states and 35657 transitions. Word has length 67 [2019-12-27 01:56:01,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:01,968 INFO L462 AbstractCegarLoop]: Abstraction has 11927 states and 35657 transitions. [2019-12-27 01:56:01,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:56:01,968 INFO L276 IsEmpty]: Start isEmpty. Operand 11927 states and 35657 transitions. [2019-12-27 01:56:01,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:56:01,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:01,980 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:01,980 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:56:01,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:01,981 INFO L82 PathProgramCache]: Analyzing trace with hash -919262302, now seen corresponding path program 2 times [2019-12-27 01:56:01,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:01,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558827288] [2019-12-27 01:56:01,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:56:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:56:02,112 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:56:02,113 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:56:02,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 v_~a$w_buff1~0_266) (= 0 v_~__unbuffered_p2_EAX~0_32) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t639~0.base_24| 1)) (= |v_ULTIMATE.start_main_~#t639~0.offset_19| 0) (= 0 v_~weak$$choice0~0_14) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t639~0.base_24| 4)) (= |v_#NULL.offset_6| 0) (= 0 v_~a$w_buff0_used~0_826) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~a$r_buff0_thd2~0_102) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t639~0.base_24| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t639~0.base_24|) |v_ULTIMATE.start_main_~#t639~0.offset_19| 0)) |v_#memory_int_21|) (< 0 |v_#StackHeapBarrier_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t639~0.base_24|) 0) (= v_~a$r_buff0_thd0~0_110 0) (= v_~__unbuffered_cnt~0_102 0) (= v_~main$tmp_guard1~0_29 0) (= v_~a$w_buff0~0_397 0) (= v_~a$flush_delayed~0_27 0) (= 0 |v_#NULL.base_6|) (= v_~y~0_39 0) (= v_~a$mem_tmp~0_16 0) (= v_~__unbuffered_p2_EBX~0_42 0) (= 0 v_~a$r_buff1_thd1~0_142) (= v_~a~0_178 0) (= v_~weak$$choice2~0_137 0) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~z~0_40 0) (= 0 v_~a$w_buff1_used~0_523) (= 0 v_~a$r_buff1_thd2~0_138) (= v_~a$r_buff1_thd3~0_297 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t639~0.base_24|) (= v_~a$r_buff0_thd3~0_334 0) (= v_~a$r_buff1_thd0~0_145 0) (= v_~__unbuffered_p0_EBX~0_105 0) (= 0 v_~a$r_buff0_thd1~0_183) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_138, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_47|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_110, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_137|, ~a~0=v_~a~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_105, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_297, ULTIMATE.start_main_~#t640~0.offset=|v_ULTIMATE.start_main_~#t640~0.offset_19|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_826, ULTIMATE.start_main_~#t640~0.base=|v_ULTIMATE.start_main_~#t640~0.base_26|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_183, ULTIMATE.start_main_~#t641~0.base=|v_ULTIMATE.start_main_~#t641~0.base_27|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_397, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_145, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_88, ULTIMATE.start_main_~#t639~0.base=|v_ULTIMATE.start_main_~#t639~0.base_24|, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_102, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_129|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_~#t639~0.offset=|v_ULTIMATE.start_main_~#t639~0.offset_19|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~a$w_buff1~0=v_~a$w_buff1~0_266, ULTIMATE.start_main_~#t641~0.offset=|v_ULTIMATE.start_main_~#t641~0.offset_20|, ~y~0=v_~y~0_39, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_29|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_142, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_334, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_40, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_523, ~weak$$choice2~0=v_~weak$$choice2~0_137, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ULTIMATE.start_main_~#t640~0.offset, ~a$w_buff0_used~0, ULTIMATE.start_main_~#t640~0.base, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t641~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t639~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_~#t639~0.offset, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t641~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 01:56:02,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t640~0.base_10| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t640~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t640~0.base_10|) |v_ULTIMATE.start_main_~#t640~0.offset_9| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t640~0.base_10| 4)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t640~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t640~0.offset_9|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t640~0.base_10|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t640~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t640~0.offset=|v_ULTIMATE.start_main_~#t640~0.offset_9|, ULTIMATE.start_main_~#t640~0.base=|v_ULTIMATE.start_main_~#t640~0.base_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t640~0.offset, ULTIMATE.start_main_~#t640~0.base, #length] because there is no mapped edge [2019-12-27 01:56:02,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L837-1-->L839: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t641~0.base_13|)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t641~0.base_13| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t641~0.base_13|) (= |v_ULTIMATE.start_main_~#t641~0.offset_11| 0) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t641~0.base_13|) 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t641~0.base_13| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t641~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t641~0.base_13|) |v_ULTIMATE.start_main_~#t641~0.offset_11| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t641~0.base=|v_ULTIMATE.start_main_~#t641~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t641~0.offset=|v_ULTIMATE.start_main_~#t641~0.offset_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t641~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t641~0.offset, #length] because there is no mapped edge [2019-12-27 01:56:02,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_30 |v_P0Thread1of1ForFork1_#in~arg.offset_30|) (= v_~a$w_buff0_used~0_232 v_~a$w_buff1_used~0_149) (= 1 v_~a$w_buff0_used~0_231) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= v_~a$w_buff0~0_80 v_~a$w_buff1~0_62) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= 1 v_~a$w_buff0~0_79) (= |v_P0Thread1of1ForFork1_#in~arg.base_30| v_P0Thread1of1ForFork1_~arg.base_30) (= (mod v_~a$w_buff1_used~0_149 256) 0)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_80, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_232, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_62, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_79, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_231, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_30} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 01:56:02,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L776-2-->L776-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1982044410 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1982044410 256)))) (or (and (not .cse0) (= ~a$w_buff1~0_In-1982044410 |P1Thread1of1ForFork2_#t~ite9_Out-1982044410|) (not .cse1)) (and (= ~a~0_In-1982044410 |P1Thread1of1ForFork2_#t~ite9_Out-1982044410|) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In-1982044410, ~a$w_buff1~0=~a$w_buff1~0_In-1982044410, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1982044410, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1982044410} OutVars{~a~0=~a~0_In-1982044410, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1982044410|, ~a$w_buff1~0=~a$w_buff1~0_In-1982044410, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1982044410, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1982044410} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 01:56:02,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1104001800 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1104001800 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out1104001800| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In1104001800 |P0Thread1of1ForFork1_#t~ite5_Out1104001800|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1104001800, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1104001800} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1104001800|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1104001800, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1104001800} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 01:56:02,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In1818489648 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In1818489648 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In1818489648 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In1818489648 256)))) (or (and (= ~a$w_buff1_used~0_In1818489648 |P0Thread1of1ForFork1_#t~ite6_Out1818489648|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1818489648|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1818489648, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1818489648, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1818489648, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1818489648} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1818489648|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1818489648, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1818489648, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1818489648, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1818489648} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 01:56:02,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L759-->L760: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1066408243 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1066408243 256)))) (or (and (= ~a$r_buff0_thd1~0_Out-1066408243 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd1~0_In-1066408243 ~a$r_buff0_thd1~0_Out-1066408243)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1066408243, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1066408243} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1066408243|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1066408243, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1066408243} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:56:02,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L760-->L760-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In-649683303 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In-649683303 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-649683303 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-649683303 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd1~0_In-649683303 |P0Thread1of1ForFork1_#t~ite8_Out-649683303|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-649683303|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-649683303, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-649683303, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-649683303, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-649683303} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-649683303|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-649683303, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-649683303, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-649683303, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-649683303} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 01:56:02,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L760-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork1_#t~ite8_52|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_51|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_80, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 01:56:02,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-803399860 256) 0))) (or (and .cse0 (= ~a$w_buff0~0_In-803399860 |P2Thread1of1ForFork0_#t~ite20_Out-803399860|) (= |P2Thread1of1ForFork0_#t~ite21_Out-803399860| |P2Thread1of1ForFork0_#t~ite20_Out-803399860|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-803399860 256)))) (or (and (= (mod ~a$r_buff1_thd3~0_In-803399860 256) 0) .cse1) (= (mod ~a$w_buff0_used~0_In-803399860 256) 0) (and (= 0 (mod ~a$w_buff1_used~0_In-803399860 256)) .cse1)))) (and (= |P2Thread1of1ForFork0_#t~ite21_Out-803399860| ~a$w_buff0~0_In-803399860) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In-803399860| |P2Thread1of1ForFork0_#t~ite20_Out-803399860|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-803399860, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-803399860, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-803399860, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-803399860, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-803399860, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-803399860|, ~weak$$choice2~0=~weak$$choice2~0_In-803399860} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-803399860|, ~a$w_buff0~0=~a$w_buff0~0_In-803399860, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-803399860, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-803399860, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-803399860, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-803399860|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-803399860, ~weak$$choice2~0=~weak$$choice2~0_In-803399860} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 01:56:02,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L803-->L803-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1039185864 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out1039185864| ~a$w_buff0_used~0_In1039185864) (= |P2Thread1of1ForFork0_#t~ite26_In1039185864| |P2Thread1of1ForFork0_#t~ite26_Out1039185864|)) (and (= |P2Thread1of1ForFork0_#t~ite26_Out1039185864| |P2Thread1of1ForFork0_#t~ite27_Out1039185864|) (= |P2Thread1of1ForFork0_#t~ite26_Out1039185864| ~a$w_buff0_used~0_In1039185864) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1039185864 256)))) (or (and (= (mod ~a$r_buff1_thd3~0_In1039185864 256) 0) .cse1) (and .cse1 (= (mod ~a$w_buff1_used~0_In1039185864 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In1039185864 256))))))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1039185864|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1039185864, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1039185864, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1039185864, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1039185864, ~weak$$choice2~0=~weak$$choice2~0_In1039185864} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1039185864|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1039185864|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1039185864, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1039185864, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1039185864, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1039185864, ~weak$$choice2~0=~weak$$choice2~0_In1039185864} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 01:56:02,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L804-->L804-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In2102372734 256)))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In2102372734 256)))) (or (= (mod ~a$w_buff0_used~0_In2102372734 256) 0) (and (= 0 (mod ~a$r_buff1_thd3~0_In2102372734 256)) .cse0) (and (= (mod ~a$w_buff1_used~0_In2102372734 256) 0) .cse0))) (= |P2Thread1of1ForFork0_#t~ite30_Out2102372734| |P2Thread1of1ForFork0_#t~ite29_Out2102372734|) (= |P2Thread1of1ForFork0_#t~ite29_Out2102372734| ~a$w_buff1_used~0_In2102372734) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite30_Out2102372734| ~a$w_buff1_used~0_In2102372734) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite29_In2102372734| |P2Thread1of1ForFork0_#t~ite29_Out2102372734|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2102372734, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2102372734, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2102372734, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2102372734, ~weak$$choice2~0=~weak$$choice2~0_In2102372734, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In2102372734|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2102372734, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2102372734, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2102372734, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out2102372734|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2102372734, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out2102372734|, ~weak$$choice2~0=~weak$$choice2~0_In2102372734} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 01:56:02,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L805-->L806: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 01:56:02,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L776-4-->L777: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_20| v_~a~0_46) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_20|} OutVars{~a~0=v_~a~0_46, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_19|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_25|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 01:56:02,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In508718800 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In508718800 256)))) (or (and (= ~a$w_buff0_used~0_In508718800 |P1Thread1of1ForFork2_#t~ite11_Out508718800|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out508718800| 0) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In508718800, ~a$w_buff0_used~0=~a$w_buff0_used~0_In508718800} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In508718800, ~a$w_buff0_used~0=~a$w_buff0_used~0_In508718800, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out508718800|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 01:56:02,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In1505041072 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In1505041072 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1505041072 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1505041072 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In1505041072 |P1Thread1of1ForFork2_#t~ite12_Out1505041072|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1505041072|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1505041072, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1505041072, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1505041072, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1505041072} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1505041072, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1505041072, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1505041072, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1505041072|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1505041072} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 01:56:02,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-648029015 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-648029015 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out-648029015| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out-648029015| ~a$r_buff0_thd2~0_In-648029015) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-648029015, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-648029015} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-648029015, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-648029015, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-648029015|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 01:56:02,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd2~0_In842368628 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In842368628 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In842368628 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In842368628 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out842368628| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite14_Out842368628| ~a$r_buff1_thd2~0_In842368628) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In842368628, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In842368628, ~a$w_buff0_used~0=~a$w_buff0_used~0_In842368628, ~a$w_buff1_used~0=~a$w_buff1_used~0_In842368628} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In842368628, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In842368628, ~a$w_buff0_used~0=~a$w_buff0_used~0_In842368628, ~a$w_buff1_used~0=~a$w_buff1_used~0_In842368628, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out842368628|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 01:56:02,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_30| v_~a$r_buff1_thd2~0_61) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_30|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_61, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_29|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 01:56:02,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L808-->L812: Formula: (and (= v_~a$flush_delayed~0_8 0) (= v_~a~0_52 v_~a$mem_tmp~0_6) (not (= (mod v_~a$flush_delayed~0_9 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_9} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_52, ~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 01:56:02,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L812-2-->L812-5: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In941248042 256))) (.cse0 (= (mod ~a$r_buff1_thd3~0_In941248042 256) 0)) (.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out941248042| |P2Thread1of1ForFork0_#t~ite38_Out941248042|))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out941248042| ~a$w_buff1~0_In941248042) (not .cse1) .cse2) (and (or .cse1 .cse0) .cse2 (= ~a~0_In941248042 |P2Thread1of1ForFork0_#t~ite38_Out941248042|)))) InVars {~a~0=~a~0_In941248042, ~a$w_buff1~0=~a$w_buff1~0_In941248042, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In941248042, ~a$w_buff1_used~0=~a$w_buff1_used~0_In941248042} OutVars{~a~0=~a~0_In941248042, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out941248042|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out941248042|, ~a$w_buff1~0=~a$w_buff1~0_In941248042, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In941248042, ~a$w_buff1_used~0=~a$w_buff1_used~0_In941248042} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:56:02,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In2014909276 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In2014909276 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out2014909276| ~a$w_buff0_used~0_In2014909276)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out2014909276| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2014909276, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2014909276} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out2014909276|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2014909276, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2014909276} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 01:56:02,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In895576475 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd3~0_In895576475 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In895576475 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd3~0_In895576475 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out895576475| ~a$w_buff1_used~0_In895576475) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out895576475| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In895576475, ~a$w_buff0_used~0=~a$w_buff0_used~0_In895576475, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In895576475, ~a$w_buff1_used~0=~a$w_buff1_used~0_In895576475} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In895576475, ~a$w_buff0_used~0=~a$w_buff0_used~0_In895576475, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In895576475, ~a$w_buff1_used~0=~a$w_buff1_used~0_In895576475, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out895576475|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 01:56:02,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1120053865 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-1120053865 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1120053865| ~a$r_buff0_thd3~0_In-1120053865) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-1120053865| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1120053865, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1120053865} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1120053865, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1120053865, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1120053865|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 01:56:02,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In-281148393 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-281148393 256))) (.cse2 (= (mod ~a$r_buff0_thd3~0_In-281148393 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-281148393 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-281148393|)) (and (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In-281148393 |P2Thread1of1ForFork0_#t~ite43_Out-281148393|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-281148393, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-281148393, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-281148393, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-281148393} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-281148393|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-281148393, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-281148393, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-281148393, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-281148393} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 01:56:02,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_127 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_59 (+ v_~__unbuffered_cnt~0_60 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 01:56:02,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 01:56:02,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L845-2-->L845-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out-574286888| |ULTIMATE.start_main_#t~ite48_Out-574286888|)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-574286888 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-574286888 256)))) (or (and .cse0 (not .cse1) (= ~a$w_buff1~0_In-574286888 |ULTIMATE.start_main_#t~ite47_Out-574286888|) (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite47_Out-574286888| ~a~0_In-574286888) .cse0 (or .cse1 .cse2)))) InVars {~a~0=~a~0_In-574286888, ~a$w_buff1~0=~a$w_buff1~0_In-574286888, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-574286888, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-574286888} OutVars{~a~0=~a~0_In-574286888, ~a$w_buff1~0=~a$w_buff1~0_In-574286888, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-574286888|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-574286888, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-574286888|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-574286888} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 01:56:02,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In1090389008 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1090389008 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out1090389008|)) (and (= ~a$w_buff0_used~0_In1090389008 |ULTIMATE.start_main_#t~ite49_Out1090389008|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1090389008, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1090389008} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1090389008, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1090389008|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1090389008} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 01:56:02,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L847-->L847-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In2119662081 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In2119662081 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In2119662081 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In2119662081 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out2119662081|)) (and (or .cse1 .cse0) (= ~a$w_buff1_used~0_In2119662081 |ULTIMATE.start_main_#t~ite50_Out2119662081|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2119662081, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2119662081, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2119662081, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2119662081} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out2119662081|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2119662081, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2119662081, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2119662081, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2119662081} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 01:56:02,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-2120711115 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-2120711115 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-2120711115 |ULTIMATE.start_main_#t~ite51_Out-2120711115|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-2120711115|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2120711115, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2120711115} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-2120711115|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2120711115, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2120711115} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 01:56:02,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In-2131586423 256))) (.cse3 (= (mod ~a$r_buff1_thd0~0_In-2131586423 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-2131586423 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-2131586423 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-2131586423| ~a$r_buff1_thd0~0_In-2131586423)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite52_Out-2131586423| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2131586423, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2131586423, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2131586423, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2131586423} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-2131586423|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2131586423, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2131586423, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2131586423, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2131586423} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 01:56:02,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_17 0) (= 1 v_~__unbuffered_p0_EAX~0_40) (= 2 v_~__unbuffered_p2_EAX~0_20) (= |v_ULTIMATE.start_main_#t~ite52_35| v_~a$r_buff1_thd0~0_75) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~__unbuffered_p0_EBX~0_40 0) (= v_~z~0_25 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:56:02,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:56:02 BasicIcfg [2019-12-27 01:56:02,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:56:02,262 INFO L168 Benchmark]: Toolchain (without parser) took 100901.70 ms. Allocated memory was 139.5 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 102.3 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 01:56:02,263 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 01:56:02,263 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.71 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 101.9 MB in the beginning and 156.0 MB in the end (delta: -54.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 01:56:02,264 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.04 ms. Allocated memory is still 202.9 MB. Free memory was 156.0 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:56:02,264 INFO L168 Benchmark]: Boogie Preprocessor took 38.61 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:56:02,264 INFO L168 Benchmark]: RCFGBuilder took 901.72 ms. Allocated memory is still 202.9 MB. Free memory was 150.8 MB in the beginning and 100.3 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 01:56:02,265 INFO L168 Benchmark]: TraceAbstraction took 99116.26 ms. Allocated memory was 202.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.3 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 01:56:02,268 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.17 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 760.71 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 101.9 MB in the beginning and 156.0 MB in the end (delta: -54.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.04 ms. Allocated memory is still 202.9 MB. Free memory was 156.0 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.61 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 901.72 ms. Allocated memory is still 202.9 MB. Free memory was 150.8 MB in the beginning and 100.3 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 99116.26 ms. Allocated memory was 202.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.3 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 178 ProgramPointsBefore, 93 ProgramPointsAfterwards, 215 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 32 ChoiceCompositions, 7050 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 249 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 78858 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t639, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t640, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t641, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L740] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L741] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L742] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L743] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L744] 1 a$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 [L750] 1 __unbuffered_p0_EAX = x [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 y = 1 [L773] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L776] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L756] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L757] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L790] 3 z = 2 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=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=2] [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=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=2] [L758] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=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 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=2] [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=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 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=2] [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L812] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L845] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L845] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 98.7s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 35.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7161 SDtfs, 10003 SDslu, 24649 SDs, 0 SdLazy, 15513 SolverSat, 453 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 447 GetRequests, 91 SyntacticMatches, 21 SemanticMatches, 335 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151748occurred 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: 34.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 176913 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1767 NumberOfCodeBlocks, 1767 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1667 ConstructedInterpolants, 0 QuantifiedInterpolants, 393988 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...