/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/mix019_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:42:02,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:42:02,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:42:02,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:42:02,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:42:02,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:42:02,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:42:02,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:42:02,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:42:02,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:42:02,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:42:02,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:42:02,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:42:02,198 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:42:02,199 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:42:02,200 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:42:02,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:42:02,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:42:02,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:42:02,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:42:02,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:42:02,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:42:02,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:42:02,218 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:42:02,221 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:42:02,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:42:02,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:42:02,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:42:02,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:42:02,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:42:02,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:42:02,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:42:02,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:42:02,231 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:42:02,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:42:02,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:42:02,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:42:02,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:42:02,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:42:02,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:42:02,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:42:02,242 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:42:02,262 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:42:02,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:42:02,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:42:02,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:42:02,265 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:42:02,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:42:02,266 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:42:02,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:42:02,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:42:02,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:42:02,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:42:02,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:42:02,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:42:02,268 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:42:02,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:42:02,269 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:42:02,269 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:42:02,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:42:02,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:42:02,270 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:42:02,270 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:42:02,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:42:02,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:42:02,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:42:02,271 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:42:02,271 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:42:02,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:42:02,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:42:02,271 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:42:02,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:42:02,563 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:42:02,566 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:42:02,567 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:42:02,568 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:42:02,568 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_power.oepc.i [2019-12-27 01:42:02,641 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59253b84c/c2c2fa60e9074f38ae4e67318485cb69/FLAGa47d50962 [2019-12-27 01:42:03,202 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:42:03,203 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_power.oepc.i [2019-12-27 01:42:03,227 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59253b84c/c2c2fa60e9074f38ae4e67318485cb69/FLAGa47d50962 [2019-12-27 01:42:03,492 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59253b84c/c2c2fa60e9074f38ae4e67318485cb69 [2019-12-27 01:42:03,500 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:42:03,501 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:42:03,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:42:03,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:42:03,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:42:03,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:42:03" (1/1) ... [2019-12-27 01:42:03,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b1666ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:42:03, skipping insertion in model container [2019-12-27 01:42:03,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:42:03" (1/1) ... [2019-12-27 01:42:03,518 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:42:03,583 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:42:04,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:42:04,119 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:42:04,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:42:04,307 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:42:04,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:42:04 WrapperNode [2019-12-27 01:42:04,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:42:04,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:42:04,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:42:04,309 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:42:04,317 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:42:04" (1/1) ... [2019-12-27 01:42:04,342 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:42:04" (1/1) ... [2019-12-27 01:42:04,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:42:04,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:42:04,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:42:04,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:42:04,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:42:04" (1/1) ... [2019-12-27 01:42:04,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:42:04" (1/1) ... [2019-12-27 01:42:04,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:42:04" (1/1) ... [2019-12-27 01:42:04,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:42:04" (1/1) ... [2019-12-27 01:42:04,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:42:04" (1/1) ... [2019-12-27 01:42:04,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:42:04" (1/1) ... [2019-12-27 01:42:04,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:42:04" (1/1) ... [2019-12-27 01:42:04,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:42:04,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:42:04,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:42:04,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:42:04,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:42:04" (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:42:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:42:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:42:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:42:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:42:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:42:04,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:42:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:42:04,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:42:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:42:04,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:42:04,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:42:04,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:42:04,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:42:04,505 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:42:05,285 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:42:05,285 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:42:05,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:42:05 BoogieIcfgContainer [2019-12-27 01:42:05,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:42:05,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:42:05,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:42:05,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:42:05,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:42:03" (1/3) ... [2019-12-27 01:42:05,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9884f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:42:05, skipping insertion in model container [2019-12-27 01:42:05,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:42:04" (2/3) ... [2019-12-27 01:42:05,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9884f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:42:05, skipping insertion in model container [2019-12-27 01:42:05,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:42:05" (3/3) ... [2019-12-27 01:42:05,296 INFO L109 eAbstractionObserver]: Analyzing ICFG mix019_power.oepc.i [2019-12-27 01:42:05,307 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:42:05,307 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:42:05,315 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:42:05,316 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:42:05,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,360 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,360 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,360 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,361 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,361 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,373 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,374 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,391 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,392 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,458 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,460 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,475 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,475 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,475 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,477 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,477 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:42:05,496 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:42:05,511 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:42:05,511 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:42:05,512 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:42:05,512 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:42:05,512 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:42:05,512 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:42:05,512 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:42:05,512 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:42:05,526 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 01:42:05,528 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 01:42:05,643 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 01:42:05,644 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:42:05,660 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:42:05,684 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 01:42:05,741 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 01:42:05,741 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:42:05,749 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:42:05,771 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 01:42:05,773 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:42:11,099 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 01:42:11,218 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 01:42:11,464 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-27 01:42:11,465 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 01:42:11,468 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-27 01:42:32,469 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-27 01:42:32,471 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-27 01:42:32,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:42:32,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:42:32,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:42:32,478 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:42:32,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:42:32,485 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-27 01:42:32,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:42:32,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033420234] [2019-12-27 01:42:32,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:42:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:42:32,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:42:32,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033420234] [2019-12-27 01:42:32,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:42:32,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:42:32,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922883426] [2019-12-27 01:42:32,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:42:32,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:42:32,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:42:32,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:42:32,730 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-27 01:42:35,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:42:35,823 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-27 01:42:35,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:42:35,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:42:35,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:42:36,709 INFO L225 Difference]: With dead ends: 121140 [2019-12-27 01:42:36,709 INFO L226 Difference]: Without dead ends: 107958 [2019-12-27 01:42:36,711 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:42:43,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-27 01:42:45,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-27 01:42:45,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-27 01:42:50,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-27 01:42:50,570 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-27 01:42:50,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:42:50,570 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-27 01:42:50,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:42:50,570 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-27 01:42:50,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:42:50,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:42:50,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:42:50,583 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:42:50,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:42:50,584 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-27 01:42:50,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:42:50,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184327360] [2019-12-27 01:42:50,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:42:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:42:50,739 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:42:50,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184327360] [2019-12-27 01:42:50,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:42:50,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:42:50,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243362846] [2019-12-27 01:42:50,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:42:50,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:42:50,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:42:50,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:42:50,742 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-27 01:42:51,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:42:51,970 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-27 01:42:51,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:42:51,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:42:51,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:42:52,565 INFO L225 Difference]: With dead ends: 172022 [2019-12-27 01:42:52,566 INFO L226 Difference]: Without dead ends: 171924 [2019-12-27 01:42:52,567 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:43:02,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-27 01:43:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-27 01:43:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-27 01:43:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-27 01:43:06,173 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-27 01:43:06,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:06,173 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-27 01:43:06,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:43:06,174 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-27 01:43:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:43:06,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:06,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:43:06,178 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:43:06,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:06,178 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-27 01:43:06,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:06,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240728298] [2019-12-27 01:43:06,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:06,242 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:43:06,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240728298] [2019-12-27 01:43:06,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:06,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:43:06,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927736493] [2019-12-27 01:43:06,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:43:06,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:06,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:43:06,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:43:06,245 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-27 01:43:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:06,380 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-27 01:43:06,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:43:06,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:43:06,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:06,481 INFO L225 Difference]: With dead ends: 33388 [2019-12-27 01:43:06,481 INFO L226 Difference]: Without dead ends: 33388 [2019-12-27 01:43:06,482 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:43:06,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-27 01:43:12,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-27 01:43:12,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-27 01:43:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-27 01:43:12,249 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-27 01:43:12,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:12,249 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-27 01:43:12,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:43:12,249 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-27 01:43:12,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:43:12,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:12,252 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:43:12,253 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:43:12,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:12,253 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-27 01:43:12,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:12,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006546818] [2019-12-27 01:43:12,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:12,313 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:43:12,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006546818] [2019-12-27 01:43:12,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:12,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:43:12,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772444513] [2019-12-27 01:43:12,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:43:12,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:12,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:43:12,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:43:12,316 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-27 01:43:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:12,512 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-27 01:43:12,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:43:12,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 01:43:12,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:12,626 INFO L225 Difference]: With dead ends: 52822 [2019-12-27 01:43:12,626 INFO L226 Difference]: Without dead ends: 52822 [2019-12-27 01:43:12,627 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:43:12,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-27 01:43:13,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-27 01:43:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-27 01:43:13,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-27 01:43:13,431 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-27 01:43:13,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:13,432 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-27 01:43:13,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:43:13,433 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-27 01:43:13,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:43:13,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:13,436 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:43:13,436 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:43:13,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:13,437 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-27 01:43:13,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:13,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376532690] [2019-12-27 01:43:13,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:43:13,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376532690] [2019-12-27 01:43:13,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:13,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:43:13,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770605955] [2019-12-27 01:43:13,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:43:13,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:13,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:43:13,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:43:13,516 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-27 01:43:13,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:13,857 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-27 01:43:13,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:43:13,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:43:13,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:13,930 INFO L225 Difference]: With dead ends: 46903 [2019-12-27 01:43:13,930 INFO L226 Difference]: Without dead ends: 46903 [2019-12-27 01:43:13,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:43:14,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-27 01:43:14,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-27 01:43:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-27 01:43:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-27 01:43:15,031 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-27 01:43:15,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:15,031 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-27 01:43:15,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:43:15,031 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-27 01:43:15,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:43:15,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:15,035 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:43:15,036 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:43:15,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:15,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-27 01:43:15,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:15,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560839456] [2019-12-27 01:43:15,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:15,102 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:43:15,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560839456] [2019-12-27 01:43:15,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:15,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:43:15,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251598647] [2019-12-27 01:43:15,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:43:15,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:15,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:43:15,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:43:15,104 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-27 01:43:15,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:15,460 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-27 01:43:15,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:43:15,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:43:15,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:15,557 INFO L225 Difference]: With dead ends: 51478 [2019-12-27 01:43:15,557 INFO L226 Difference]: Without dead ends: 51478 [2019-12-27 01:43:15,558 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:43:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-27 01:43:16,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-27 01:43:16,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-27 01:43:16,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-27 01:43:16,761 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-27 01:43:16,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:16,761 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-27 01:43:16,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:43:16,761 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-27 01:43:16,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:43:16,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:16,772 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:43:16,772 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:43:16,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:16,772 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-27 01:43:16,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:16,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981216840] [2019-12-27 01:43:16,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:16,845 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:43:16,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981216840] [2019-12-27 01:43:16,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:16,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:43:16,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297698296] [2019-12-27 01:43:16,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:43:16,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:16,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:43:16,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:43:16,848 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-27 01:43:17,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:17,512 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-27 01:43:17,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:43:17,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:43:17,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:17,618 INFO L225 Difference]: With dead ends: 61264 [2019-12-27 01:43:17,618 INFO L226 Difference]: Without dead ends: 61250 [2019-12-27 01:43:17,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:43:17,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-27 01:43:18,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-27 01:43:18,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-27 01:43:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-27 01:43:19,154 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-27 01:43:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:19,154 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-27 01:43:19,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:43:19,154 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-27 01:43:19,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:43:19,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:19,164 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:43:19,165 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:43:19,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:19,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-27 01:43:19,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:19,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113413949] [2019-12-27 01:43:19,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:19,245 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:43:19,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113413949] [2019-12-27 01:43:19,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:19,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:43:19,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3649256] [2019-12-27 01:43:19,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:43:19,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:19,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:43:19,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:43:19,248 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-27 01:43:19,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:19,892 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-27 01:43:19,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:43:19,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:43:19,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:20,015 INFO L225 Difference]: With dead ends: 63752 [2019-12-27 01:43:20,016 INFO L226 Difference]: Without dead ends: 63738 [2019-12-27 01:43:20,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:43:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-27 01:43:20,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-27 01:43:20,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-27 01:43:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-27 01:43:20,972 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-27 01:43:20,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:20,972 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-27 01:43:20,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:43:20,972 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-27 01:43:20,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:43:20,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:20,984 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:43:20,984 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:43:20,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:20,985 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-27 01:43:20,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:20,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843965072] [2019-12-27 01:43:20,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:21,052 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:43:21,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843965072] [2019-12-27 01:43:21,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:21,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:43:21,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667834066] [2019-12-27 01:43:21,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:43:21,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:21,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:43:21,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:43:21,055 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 4 states. [2019-12-27 01:43:21,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:21,129 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-27 01:43:21,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:43:21,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:43:21,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:21,153 INFO L225 Difference]: With dead ends: 17193 [2019-12-27 01:43:21,153 INFO L226 Difference]: Without dead ends: 17193 [2019-12-27 01:43:21,153 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:43:21,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-27 01:43:21,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-27 01:43:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-27 01:43:21,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-27 01:43:21,710 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-27 01:43:21,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:21,710 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-27 01:43:21,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:43:21,710 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-27 01:43:21,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 01:43:21,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:21,722 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] [2019-12-27 01:43:21,722 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:43:21,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:21,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-27 01:43:21,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:21,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245259860] [2019-12-27 01:43:21,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:21,791 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:43:21,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245259860] [2019-12-27 01:43:21,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:21,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:43:21,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71909381] [2019-12-27 01:43:21,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:43:21,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:21,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:43:21,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:43:21,793 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-27 01:43:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:22,166 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-27 01:43:22,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:43:22,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 01:43:22,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:22,197 INFO L225 Difference]: With dead ends: 21613 [2019-12-27 01:43:22,197 INFO L226 Difference]: Without dead ends: 21613 [2019-12-27 01:43:22,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:43:22,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-27 01:43:22,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-27 01:43:22,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-27 01:43:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-27 01:43:22,492 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-27 01:43:22,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:22,492 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-27 01:43:22,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:43:22,492 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-27 01:43:22,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 01:43:22,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:22,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:43:22,507 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:43:22,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:22,507 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-27 01:43:22,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:22,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452841271] [2019-12-27 01:43:22,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:22,573 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:43:22,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452841271] [2019-12-27 01:43:22,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:22,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:43:22,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608658768] [2019-12-27 01:43:22,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:43:22,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:22,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:43:22,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:43:22,575 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-27 01:43:22,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:22,916 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-27 01:43:22,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:43:22,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 01:43:22,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:22,949 INFO L225 Difference]: With dead ends: 23624 [2019-12-27 01:43:22,949 INFO L226 Difference]: Without dead ends: 23624 [2019-12-27 01:43:22,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:43:23,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-27 01:43:23,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-27 01:43:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-27 01:43:23,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-27 01:43:23,250 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-27 01:43:23,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:23,251 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-27 01:43:23,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:43:23,251 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-27 01:43:23,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 01:43:23,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:23,269 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] [2019-12-27 01:43:23,270 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:43:23,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:23,270 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-27 01:43:23,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:23,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636602204] [2019-12-27 01:43:23,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:23,430 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:43:23,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636602204] [2019-12-27 01:43:23,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:23,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:43:23,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082523515] [2019-12-27 01:43:23,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:43:23,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:23,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:43:23,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:43:23,433 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 7 states. [2019-12-27 01:43:24,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:24,274 INFO L93 Difference]: Finished difference Result 28860 states and 86218 transitions. [2019-12-27 01:43:24,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 01:43:24,274 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-27 01:43:24,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:24,327 INFO L225 Difference]: With dead ends: 28860 [2019-12-27 01:43:24,327 INFO L226 Difference]: Without dead ends: 28860 [2019-12-27 01:43:24,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:43:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28860 states. [2019-12-27 01:43:24,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28860 to 21822. [2019-12-27 01:43:24,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21822 states. [2019-12-27 01:43:24,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21822 states to 21822 states and 66391 transitions. [2019-12-27 01:43:24,974 INFO L78 Accepts]: Start accepts. Automaton has 21822 states and 66391 transitions. Word has length 32 [2019-12-27 01:43:24,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:24,975 INFO L462 AbstractCegarLoop]: Abstraction has 21822 states and 66391 transitions. [2019-12-27 01:43:24,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:43:24,975 INFO L276 IsEmpty]: Start isEmpty. Operand 21822 states and 66391 transitions. [2019-12-27 01:43:24,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:43:24,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:24,998 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:43:24,999 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:43:24,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:24,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-27 01:43:24,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:24,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811926729] [2019-12-27 01:43:24,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:25,079 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:43:25,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811926729] [2019-12-27 01:43:25,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:25,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:43:25,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800516485] [2019-12-27 01:43:25,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:43:25,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:25,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:43:25,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:43:25,081 INFO L87 Difference]: Start difference. First operand 21822 states and 66391 transitions. Second operand 6 states. [2019-12-27 01:43:25,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:25,765 INFO L93 Difference]: Finished difference Result 29045 states and 86925 transitions. [2019-12-27 01:43:25,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:43:25,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 01:43:25,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:25,806 INFO L225 Difference]: With dead ends: 29045 [2019-12-27 01:43:25,806 INFO L226 Difference]: Without dead ends: 29045 [2019-12-27 01:43:25,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:43:25,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29045 states. [2019-12-27 01:43:26,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29045 to 21326. [2019-12-27 01:43:26,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21326 states. [2019-12-27 01:43:26,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21326 states to 21326 states and 65148 transitions. [2019-12-27 01:43:26,162 INFO L78 Accepts]: Start accepts. Automaton has 21326 states and 65148 transitions. Word has length 34 [2019-12-27 01:43:26,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:26,162 INFO L462 AbstractCegarLoop]: Abstraction has 21326 states and 65148 transitions. [2019-12-27 01:43:26,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:43:26,162 INFO L276 IsEmpty]: Start isEmpty. Operand 21326 states and 65148 transitions. [2019-12-27 01:43:26,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 01:43:26,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:26,181 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] [2019-12-27 01:43:26,181 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:43:26,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:26,182 INFO L82 PathProgramCache]: Analyzing trace with hash -294288994, now seen corresponding path program 1 times [2019-12-27 01:43:26,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:26,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243032246] [2019-12-27 01:43:26,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:26,334 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:43:26,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243032246] [2019-12-27 01:43:26,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:26,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:43:26,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863348521] [2019-12-27 01:43:26,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:43:26,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:26,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:43:26,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:43:26,336 INFO L87 Difference]: Start difference. First operand 21326 states and 65148 transitions. Second operand 8 states. [2019-12-27 01:43:27,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:27,121 INFO L93 Difference]: Finished difference Result 27649 states and 82706 transitions. [2019-12-27 01:43:27,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 01:43:27,122 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-12-27 01:43:27,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:27,159 INFO L225 Difference]: With dead ends: 27649 [2019-12-27 01:43:27,159 INFO L226 Difference]: Without dead ends: 27649 [2019-12-27 01:43:27,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-27 01:43:27,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27649 states. [2019-12-27 01:43:27,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27649 to 18614. [2019-12-27 01:43:27,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18614 states. [2019-12-27 01:43:27,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18614 states to 18614 states and 56725 transitions. [2019-12-27 01:43:27,475 INFO L78 Accepts]: Start accepts. Automaton has 18614 states and 56725 transitions. Word has length 36 [2019-12-27 01:43:27,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:27,475 INFO L462 AbstractCegarLoop]: Abstraction has 18614 states and 56725 transitions. [2019-12-27 01:43:27,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:43:27,475 INFO L276 IsEmpty]: Start isEmpty. Operand 18614 states and 56725 transitions. [2019-12-27 01:43:27,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 01:43:27,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:27,492 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] [2019-12-27 01:43:27,492 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:43:27,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:27,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1530432024, now seen corresponding path program 2 times [2019-12-27 01:43:27,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:27,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821183077] [2019-12-27 01:43:27,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:27,634 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:43:27,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821183077] [2019-12-27 01:43:27,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:27,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:43:27,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57853905] [2019-12-27 01:43:27,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:43:27,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:27,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:43:27,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:43:27,636 INFO L87 Difference]: Start difference. First operand 18614 states and 56725 transitions. Second operand 8 states. [2019-12-27 01:43:28,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:28,929 INFO L93 Difference]: Finished difference Result 25311 states and 75259 transitions. [2019-12-27 01:43:28,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 01:43:28,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-12-27 01:43:28,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:28,977 INFO L225 Difference]: With dead ends: 25311 [2019-12-27 01:43:28,978 INFO L226 Difference]: Without dead ends: 25311 [2019-12-27 01:43:28,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-12-27 01:43:29,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25311 states. [2019-12-27 01:43:29,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25311 to 17844. [2019-12-27 01:43:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17844 states. [2019-12-27 01:43:29,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17844 states to 17844 states and 54566 transitions. [2019-12-27 01:43:29,479 INFO L78 Accepts]: Start accepts. Automaton has 17844 states and 54566 transitions. Word has length 36 [2019-12-27 01:43:29,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:29,480 INFO L462 AbstractCegarLoop]: Abstraction has 17844 states and 54566 transitions. [2019-12-27 01:43:29,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:43:29,480 INFO L276 IsEmpty]: Start isEmpty. Operand 17844 states and 54566 transitions. [2019-12-27 01:43:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:43:29,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:29,501 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:43:29,501 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:43:29,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:29,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-27 01:43:29,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:29,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55296185] [2019-12-27 01:43:29,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:29,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:43:29,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55296185] [2019-12-27 01:43:29,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:29,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:43:29,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504493885] [2019-12-27 01:43:29,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:43:29,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:29,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:43:29,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:43:29,563 INFO L87 Difference]: Start difference. First operand 17844 states and 54566 transitions. Second operand 3 states. [2019-12-27 01:43:29,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:29,650 INFO L93 Difference]: Finished difference Result 17843 states and 54564 transitions. [2019-12-27 01:43:29,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:43:29,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:43:29,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:29,691 INFO L225 Difference]: With dead ends: 17843 [2019-12-27 01:43:29,691 INFO L226 Difference]: Without dead ends: 17843 [2019-12-27 01:43:29,692 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:43:29,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17843 states. [2019-12-27 01:43:30,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17843 to 17843. [2019-12-27 01:43:30,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17843 states. [2019-12-27 01:43:30,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17843 states to 17843 states and 54564 transitions. [2019-12-27 01:43:30,037 INFO L78 Accepts]: Start accepts. Automaton has 17843 states and 54564 transitions. Word has length 39 [2019-12-27 01:43:30,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:30,037 INFO L462 AbstractCegarLoop]: Abstraction has 17843 states and 54564 transitions. [2019-12-27 01:43:30,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:43:30,037 INFO L276 IsEmpty]: Start isEmpty. Operand 17843 states and 54564 transitions. [2019-12-27 01:43:30,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:43:30,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:30,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:43:30,061 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:43:30,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:30,061 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-27 01:43:30,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:30,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920722533] [2019-12-27 01:43:30,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:30,146 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:43:30,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920722533] [2019-12-27 01:43:30,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:30,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:43:30,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737989191] [2019-12-27 01:43:30,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:43:30,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:30,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:43:30,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:43:30,148 INFO L87 Difference]: Start difference. First operand 17843 states and 54564 transitions. Second operand 5 states. [2019-12-27 01:43:30,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:30,721 INFO L93 Difference]: Finished difference Result 25586 states and 77360 transitions. [2019-12-27 01:43:30,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:43:30,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:43:30,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:30,762 INFO L225 Difference]: With dead ends: 25586 [2019-12-27 01:43:30,763 INFO L226 Difference]: Without dead ends: 25586 [2019-12-27 01:43:30,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:43:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25586 states. [2019-12-27 01:43:31,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25586 to 23742. [2019-12-27 01:43:31,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23742 states. [2019-12-27 01:43:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23742 states to 23742 states and 72302 transitions. [2019-12-27 01:43:31,129 INFO L78 Accepts]: Start accepts. Automaton has 23742 states and 72302 transitions. Word has length 40 [2019-12-27 01:43:31,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:31,129 INFO L462 AbstractCegarLoop]: Abstraction has 23742 states and 72302 transitions. [2019-12-27 01:43:31,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:43:31,130 INFO L276 IsEmpty]: Start isEmpty. Operand 23742 states and 72302 transitions. [2019-12-27 01:43:31,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:43:31,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:31,151 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:43:31,151 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:43:31,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:31,152 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-27 01:43:31,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:31,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857873586] [2019-12-27 01:43:31,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:31,207 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:43:31,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857873586] [2019-12-27 01:43:31,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:31,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:43:31,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269121666] [2019-12-27 01:43:31,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:43:31,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:31,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:43:31,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:43:31,209 INFO L87 Difference]: Start difference. First operand 23742 states and 72302 transitions. Second operand 5 states. [2019-12-27 01:43:31,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:31,320 INFO L93 Difference]: Finished difference Result 22357 states and 69069 transitions. [2019-12-27 01:43:31,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:43:31,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:43:31,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:31,362 INFO L225 Difference]: With dead ends: 22357 [2019-12-27 01:43:31,362 INFO L226 Difference]: Without dead ends: 22357 [2019-12-27 01:43:31,363 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:43:31,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22357 states. [2019-12-27 01:43:31,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22357 to 21433. [2019-12-27 01:43:31,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21433 states. [2019-12-27 01:43:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21433 states to 21433 states and 66576 transitions. [2019-12-27 01:43:31,901 INFO L78 Accepts]: Start accepts. Automaton has 21433 states and 66576 transitions. Word has length 40 [2019-12-27 01:43:31,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:31,901 INFO L462 AbstractCegarLoop]: Abstraction has 21433 states and 66576 transitions. [2019-12-27 01:43:31,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:43:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 21433 states and 66576 transitions. [2019-12-27 01:43:31,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:43:31,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:31,933 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] [2019-12-27 01:43:31,933 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:43:31,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:31,933 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-27 01:43:31,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:31,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104581538] [2019-12-27 01:43:31,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:32,014 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:43:32,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104581538] [2019-12-27 01:43:32,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:32,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:43:32,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188789655] [2019-12-27 01:43:32,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:43:32,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:32,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:43:32,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:43:32,016 INFO L87 Difference]: Start difference. First operand 21433 states and 66576 transitions. Second operand 7 states. [2019-12-27 01:43:32,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:32,655 INFO L93 Difference]: Finished difference Result 61846 states and 190827 transitions. [2019-12-27 01:43:32,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 01:43:32,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:43:32,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:32,722 INFO L225 Difference]: With dead ends: 61846 [2019-12-27 01:43:32,722 INFO L226 Difference]: Without dead ends: 47493 [2019-12-27 01:43:32,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:43:32,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47493 states. [2019-12-27 01:43:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47493 to 24866. [2019-12-27 01:43:33,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24866 states. [2019-12-27 01:43:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24866 states to 24866 states and 77717 transitions. [2019-12-27 01:43:33,302 INFO L78 Accepts]: Start accepts. Automaton has 24866 states and 77717 transitions. Word has length 63 [2019-12-27 01:43:33,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:33,302 INFO L462 AbstractCegarLoop]: Abstraction has 24866 states and 77717 transitions. [2019-12-27 01:43:33,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:43:33,302 INFO L276 IsEmpty]: Start isEmpty. Operand 24866 states and 77717 transitions. [2019-12-27 01:43:33,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:43:33,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:33,334 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] [2019-12-27 01:43:33,334 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:43:33,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:33,335 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-27 01:43:33,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:33,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915150903] [2019-12-27 01:43:33,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:33,422 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:43:33,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915150903] [2019-12-27 01:43:33,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:33,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:43:33,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917545377] [2019-12-27 01:43:33,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:43:33,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:33,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:43:33,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:43:33,424 INFO L87 Difference]: Start difference. First operand 24866 states and 77717 transitions. Second operand 7 states. [2019-12-27 01:43:34,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:34,018 INFO L93 Difference]: Finished difference Result 68350 states and 209846 transitions. [2019-12-27 01:43:34,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:43:34,019 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:43:34,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:34,140 INFO L225 Difference]: With dead ends: 68350 [2019-12-27 01:43:34,140 INFO L226 Difference]: Without dead ends: 48467 [2019-12-27 01:43:34,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:43:34,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48467 states. [2019-12-27 01:43:34,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48467 to 28731. [2019-12-27 01:43:34,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28731 states. [2019-12-27 01:43:34,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28731 states to 28731 states and 89455 transitions. [2019-12-27 01:43:34,922 INFO L78 Accepts]: Start accepts. Automaton has 28731 states and 89455 transitions. Word has length 63 [2019-12-27 01:43:34,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:34,923 INFO L462 AbstractCegarLoop]: Abstraction has 28731 states and 89455 transitions. [2019-12-27 01:43:34,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:43:34,923 INFO L276 IsEmpty]: Start isEmpty. Operand 28731 states and 89455 transitions. [2019-12-27 01:43:34,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:43:34,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:34,954 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] [2019-12-27 01:43:34,954 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:43:34,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:34,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-27 01:43:34,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:34,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001701261] [2019-12-27 01:43:34,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:35,033 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:43:35,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001701261] [2019-12-27 01:43:35,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:35,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:43:35,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101162138] [2019-12-27 01:43:35,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:43:35,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:35,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:43:35,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:43:35,035 INFO L87 Difference]: Start difference. First operand 28731 states and 89455 transitions. Second operand 7 states. [2019-12-27 01:43:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:35,919 INFO L93 Difference]: Finished difference Result 59776 states and 183509 transitions. [2019-12-27 01:43:35,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:43:35,919 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:43:35,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:36,050 INFO L225 Difference]: With dead ends: 59776 [2019-12-27 01:43:36,051 INFO L226 Difference]: Without dead ends: 52695 [2019-12-27 01:43:36,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:43:36,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52695 states. [2019-12-27 01:43:36,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52695 to 29039. [2019-12-27 01:43:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29039 states. [2019-12-27 01:43:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29039 states to 29039 states and 90406 transitions. [2019-12-27 01:43:36,813 INFO L78 Accepts]: Start accepts. Automaton has 29039 states and 90406 transitions. Word has length 63 [2019-12-27 01:43:36,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:36,813 INFO L462 AbstractCegarLoop]: Abstraction has 29039 states and 90406 transitions. [2019-12-27 01:43:36,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:43:36,813 INFO L276 IsEmpty]: Start isEmpty. Operand 29039 states and 90406 transitions. [2019-12-27 01:43:36,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:43:36,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:36,852 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] [2019-12-27 01:43:36,852 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:43:36,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:36,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-27 01:43:36,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:36,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254833481] [2019-12-27 01:43:36,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:36,898 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:43:36,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254833481] [2019-12-27 01:43:36,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:36,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:43:36,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559086284] [2019-12-27 01:43:36,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:43:36,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:36,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:43:36,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:43:36,900 INFO L87 Difference]: Start difference. First operand 29039 states and 90406 transitions. Second operand 3 states. [2019-12-27 01:43:37,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:37,079 INFO L93 Difference]: Finished difference Result 35492 states and 109443 transitions. [2019-12-27 01:43:37,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:43:37,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-27 01:43:37,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:37,142 INFO L225 Difference]: With dead ends: 35492 [2019-12-27 01:43:37,143 INFO L226 Difference]: Without dead ends: 35492 [2019-12-27 01:43:37,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:43:37,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35492 states. [2019-12-27 01:43:37,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35492 to 30908. [2019-12-27 01:43:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30908 states. [2019-12-27 01:43:37,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30908 states to 30908 states and 96103 transitions. [2019-12-27 01:43:37,665 INFO L78 Accepts]: Start accepts. Automaton has 30908 states and 96103 transitions. Word has length 63 [2019-12-27 01:43:37,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:37,666 INFO L462 AbstractCegarLoop]: Abstraction has 30908 states and 96103 transitions. [2019-12-27 01:43:37,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:43:37,666 INFO L276 IsEmpty]: Start isEmpty. Operand 30908 states and 96103 transitions. [2019-12-27 01:43:37,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:43:37,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:37,698 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:43:37,698 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:43:37,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:37,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1820548391, now seen corresponding path program 1 times [2019-12-27 01:43:37,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:37,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526048468] [2019-12-27 01:43:37,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:37,923 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:43:37,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526048468] [2019-12-27 01:43:37,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:37,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 01:43:37,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20960934] [2019-12-27 01:43:37,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:43:37,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:37,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:43:37,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:43:37,925 INFO L87 Difference]: Start difference. First operand 30908 states and 96103 transitions. Second operand 12 states. [2019-12-27 01:43:42,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:42,189 INFO L93 Difference]: Finished difference Result 59240 states and 180120 transitions. [2019-12-27 01:43:42,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 01:43:42,190 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-27 01:43:42,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:42,280 INFO L225 Difference]: With dead ends: 59240 [2019-12-27 01:43:42,280 INFO L226 Difference]: Without dead ends: 58853 [2019-12-27 01:43:42,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=313, Invalid=1579, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 01:43:42,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58853 states. [2019-12-27 01:43:42,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58853 to 36610. [2019-12-27 01:43:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36610 states. [2019-12-27 01:43:43,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36610 states to 36610 states and 113078 transitions. [2019-12-27 01:43:43,071 INFO L78 Accepts]: Start accepts. Automaton has 36610 states and 113078 transitions. Word has length 64 [2019-12-27 01:43:43,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:43,071 INFO L462 AbstractCegarLoop]: Abstraction has 36610 states and 113078 transitions. [2019-12-27 01:43:43,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:43:43,071 INFO L276 IsEmpty]: Start isEmpty. Operand 36610 states and 113078 transitions. [2019-12-27 01:43:43,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:43:43,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:43,113 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:43:43,113 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:43:43,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:43,114 INFO L82 PathProgramCache]: Analyzing trace with hash -772692697, now seen corresponding path program 2 times [2019-12-27 01:43:43,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:43,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026929663] [2019-12-27 01:43:43,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:43,311 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:43:43,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026929663] [2019-12-27 01:43:43,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:43,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:43:43,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410488083] [2019-12-27 01:43:43,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:43:43,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:43,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:43:43,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:43:43,313 INFO L87 Difference]: Start difference. First operand 36610 states and 113078 transitions. Second operand 10 states. [2019-12-27 01:43:45,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:45,477 INFO L93 Difference]: Finished difference Result 58006 states and 177255 transitions. [2019-12-27 01:43:45,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 01:43:45,478 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 01:43:45,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:45,570 INFO L225 Difference]: With dead ends: 58006 [2019-12-27 01:43:45,571 INFO L226 Difference]: Without dead ends: 57786 [2019-12-27 01:43:45,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2019-12-27 01:43:45,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57786 states. [2019-12-27 01:43:46,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57786 to 43144. [2019-12-27 01:43:46,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43144 states. [2019-12-27 01:43:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43144 states to 43144 states and 133192 transitions. [2019-12-27 01:43:46,386 INFO L78 Accepts]: Start accepts. Automaton has 43144 states and 133192 transitions. Word has length 64 [2019-12-27 01:43:46,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:46,386 INFO L462 AbstractCegarLoop]: Abstraction has 43144 states and 133192 transitions. [2019-12-27 01:43:46,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:43:46,387 INFO L276 IsEmpty]: Start isEmpty. Operand 43144 states and 133192 transitions. [2019-12-27 01:43:46,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:43:46,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:46,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:46,436 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:43:46,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:46,437 INFO L82 PathProgramCache]: Analyzing trace with hash 98843029, now seen corresponding path program 3 times [2019-12-27 01:43:46,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:46,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59960757] [2019-12-27 01:43:46,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:46,666 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:43:46,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59960757] [2019-12-27 01:43:46,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:46,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 01:43:46,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281635711] [2019-12-27 01:43:46,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:43:46,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:46,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:43:46,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:43:46,668 INFO L87 Difference]: Start difference. First operand 43144 states and 133192 transitions. Second operand 12 states. [2019-12-27 01:43:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:49,362 INFO L93 Difference]: Finished difference Result 62224 states and 189493 transitions. [2019-12-27 01:43:49,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 01:43:49,362 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-27 01:43:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:49,454 INFO L225 Difference]: With dead ends: 62224 [2019-12-27 01:43:49,454 INFO L226 Difference]: Without dead ends: 61972 [2019-12-27 01:43:49,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=878, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 01:43:49,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61972 states. [2019-12-27 01:43:50,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61972 to 42819. [2019-12-27 01:43:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42819 states. [2019-12-27 01:43:50,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42819 states to 42819 states and 132219 transitions. [2019-12-27 01:43:50,574 INFO L78 Accepts]: Start accepts. Automaton has 42819 states and 132219 transitions. Word has length 64 [2019-12-27 01:43:50,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:50,574 INFO L462 AbstractCegarLoop]: Abstraction has 42819 states and 132219 transitions. [2019-12-27 01:43:50,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:43:50,574 INFO L276 IsEmpty]: Start isEmpty. Operand 42819 states and 132219 transitions. [2019-12-27 01:43:50,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:43:50,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:50,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:50,618 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:43:50,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:50,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1550075121, now seen corresponding path program 4 times [2019-12-27 01:43:50,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:50,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752176732] [2019-12-27 01:43:50,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:50,667 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:43:50,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752176732] [2019-12-27 01:43:50,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:50,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:43:50,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253578758] [2019-12-27 01:43:50,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:43:50,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:50,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:43:50,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:43:50,669 INFO L87 Difference]: Start difference. First operand 42819 states and 132219 transitions. Second operand 3 states. [2019-12-27 01:43:50,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:50,864 INFO L93 Difference]: Finished difference Result 42818 states and 132217 transitions. [2019-12-27 01:43:50,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:43:50,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:43:50,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:50,971 INFO L225 Difference]: With dead ends: 42818 [2019-12-27 01:43:50,972 INFO L226 Difference]: Without dead ends: 42818 [2019-12-27 01:43:50,972 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:43:51,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42818 states. [2019-12-27 01:43:51,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42818 to 34749. [2019-12-27 01:43:51,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34749 states. [2019-12-27 01:43:51,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34749 states to 34749 states and 108965 transitions. [2019-12-27 01:43:51,853 INFO L78 Accepts]: Start accepts. Automaton has 34749 states and 108965 transitions. Word has length 64 [2019-12-27 01:43:51,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:51,854 INFO L462 AbstractCegarLoop]: Abstraction has 34749 states and 108965 transitions. [2019-12-27 01:43:51,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:43:51,854 INFO L276 IsEmpty]: Start isEmpty. Operand 34749 states and 108965 transitions. [2019-12-27 01:43:51,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:43:51,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:51,890 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:43:51,890 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:43:51,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:51,891 INFO L82 PathProgramCache]: Analyzing trace with hash 78921339, now seen corresponding path program 1 times [2019-12-27 01:43:51,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:51,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052043701] [2019-12-27 01:43:51,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:51,949 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:43:51,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052043701] [2019-12-27 01:43:51,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:51,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:43:51,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735206078] [2019-12-27 01:43:51,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:43:51,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:51,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:43:51,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:43:51,950 INFO L87 Difference]: Start difference. First operand 34749 states and 108965 transitions. Second operand 3 states. [2019-12-27 01:43:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:52,061 INFO L93 Difference]: Finished difference Result 26986 states and 83557 transitions. [2019-12-27 01:43:52,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:43:52,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 01:43:52,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:52,101 INFO L225 Difference]: With dead ends: 26986 [2019-12-27 01:43:52,101 INFO L226 Difference]: Without dead ends: 26986 [2019-12-27 01:43:52,101 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:43:52,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26986 states. [2019-12-27 01:43:52,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26986 to 24612. [2019-12-27 01:43:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24612 states. [2019-12-27 01:43:52,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24612 states to 24612 states and 76133 transitions. [2019-12-27 01:43:52,467 INFO L78 Accepts]: Start accepts. Automaton has 24612 states and 76133 transitions. Word has length 65 [2019-12-27 01:43:52,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:52,467 INFO L462 AbstractCegarLoop]: Abstraction has 24612 states and 76133 transitions. [2019-12-27 01:43:52,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:43:52,467 INFO L276 IsEmpty]: Start isEmpty. Operand 24612 states and 76133 transitions. [2019-12-27 01:43:52,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:43:52,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:52,494 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:43:52,494 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:43:52,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:52,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1524862519, now seen corresponding path program 1 times [2019-12-27 01:43:52,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:52,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950976631] [2019-12-27 01:43:52,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:52,662 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:43:52,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950976631] [2019-12-27 01:43:52,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:52,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:43:52,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550044997] [2019-12-27 01:43:52,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:43:52,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:52,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:43:52,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:43:52,664 INFO L87 Difference]: Start difference. First operand 24612 states and 76133 transitions. Second operand 11 states. [2019-12-27 01:43:53,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:53,972 INFO L93 Difference]: Finished difference Result 53447 states and 166058 transitions. [2019-12-27 01:43:53,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 01:43:53,973 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:43:53,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:54,051 INFO L225 Difference]: With dead ends: 53447 [2019-12-27 01:43:54,051 INFO L226 Difference]: Without dead ends: 50644 [2019-12-27 01:43:54,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 01:43:54,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50644 states. [2019-12-27 01:43:54,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50644 to 29866. [2019-12-27 01:43:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29866 states. [2019-12-27 01:43:54,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29866 states to 29866 states and 92355 transitions. [2019-12-27 01:43:54,682 INFO L78 Accepts]: Start accepts. Automaton has 29866 states and 92355 transitions. Word has length 66 [2019-12-27 01:43:54,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:54,682 INFO L462 AbstractCegarLoop]: Abstraction has 29866 states and 92355 transitions. [2019-12-27 01:43:54,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:43:54,682 INFO L276 IsEmpty]: Start isEmpty. Operand 29866 states and 92355 transitions. [2019-12-27 01:43:54,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:43:54,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:54,716 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:43:54,716 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:43:54,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:54,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1239159877, now seen corresponding path program 2 times [2019-12-27 01:43:54,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:54,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668000234] [2019-12-27 01:43:54,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:54,856 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:43:54,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668000234] [2019-12-27 01:43:54,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:54,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:43:54,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002680398] [2019-12-27 01:43:54,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:43:54,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:54,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:43:54,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:43:54,858 INFO L87 Difference]: Start difference. First operand 29866 states and 92355 transitions. Second operand 11 states. [2019-12-27 01:43:56,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:56,051 INFO L93 Difference]: Finished difference Result 50861 states and 156575 transitions. [2019-12-27 01:43:56,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:43:56,051 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:43:56,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:56,109 INFO L225 Difference]: With dead ends: 50861 [2019-12-27 01:43:56,109 INFO L226 Difference]: Without dead ends: 40344 [2019-12-27 01:43:56,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:43:56,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40344 states. [2019-12-27 01:43:56,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40344 to 24072. [2019-12-27 01:43:56,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24072 states. [2019-12-27 01:43:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24072 states to 24072 states and 73825 transitions. [2019-12-27 01:43:56,587 INFO L78 Accepts]: Start accepts. Automaton has 24072 states and 73825 transitions. Word has length 66 [2019-12-27 01:43:56,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:56,587 INFO L462 AbstractCegarLoop]: Abstraction has 24072 states and 73825 transitions. [2019-12-27 01:43:56,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:43:56,587 INFO L276 IsEmpty]: Start isEmpty. Operand 24072 states and 73825 transitions. [2019-12-27 01:43:56,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:43:56,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:56,614 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:43:56,614 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:43:56,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:56,614 INFO L82 PathProgramCache]: Analyzing trace with hash -952881413, now seen corresponding path program 3 times [2019-12-27 01:43:56,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:56,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961541166] [2019-12-27 01:43:56,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:43:56,782 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:43:56,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961541166] [2019-12-27 01:43:56,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:43:56,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:43:56,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038570794] [2019-12-27 01:43:56,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:43:56,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:43:56,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:43:56,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:43:56,784 INFO L87 Difference]: Start difference. First operand 24072 states and 73825 transitions. Second operand 12 states. [2019-12-27 01:43:58,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:43:58,083 INFO L93 Difference]: Finished difference Result 40893 states and 125275 transitions. [2019-12-27 01:43:58,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:43:58,084 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 01:43:58,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:43:58,142 INFO L225 Difference]: With dead ends: 40893 [2019-12-27 01:43:58,142 INFO L226 Difference]: Without dead ends: 39908 [2019-12-27 01:43:58,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 01:43:58,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39908 states. [2019-12-27 01:43:58,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39908 to 23404. [2019-12-27 01:43:58,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23404 states. [2019-12-27 01:43:58,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23404 states to 23404 states and 71986 transitions. [2019-12-27 01:43:58,630 INFO L78 Accepts]: Start accepts. Automaton has 23404 states and 71986 transitions. Word has length 66 [2019-12-27 01:43:58,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:43:58,631 INFO L462 AbstractCegarLoop]: Abstraction has 23404 states and 71986 transitions. [2019-12-27 01:43:58,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:43:58,631 INFO L276 IsEmpty]: Start isEmpty. Operand 23404 states and 71986 transitions. [2019-12-27 01:43:58,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:43:58,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:43:58,657 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:43:58,657 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:43:58,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:43:58,658 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 4 times [2019-12-27 01:43:58,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:43:58,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525241377] [2019-12-27 01:43:58,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:43:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:43:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:43:58,795 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:43:58,795 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:43:58,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff0_thd3~0_377) (= v_~__unbuffered_cnt~0_128 0) (= v_~z$r_buff0_thd1~0_378 0) (= v_~z$mem_tmp~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t497~0.base_22|)) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff0_thd0~0_195 0) (= v_~y~0_28 0) (= v_~z$w_buff1_used~0_500 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t497~0.base_22| 1) |v_#valid_69|) (= 0 |v_#NULL.base_6|) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~z$flush_delayed~0_43) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd2~0_182 0) (= 0 v_~z$r_buff1_thd3~0_396) (= 0 v_~x~0_245) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_35) (= v_~z$r_buff1_thd0~0_294 0) (= 0 |v_ULTIMATE.start_main_~#t497~0.offset_16|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t497~0.base_22|) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t497~0.base_22| 4)) (= v_~__unbuffered_p2_EBX~0_48 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t497~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t497~0.base_22|) |v_ULTIMATE.start_main_~#t497~0.offset_16| 0)) |v_#memory_int_19|) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= v_~z~0_182 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, ULTIMATE.start_main_~#t498~0.offset=|v_ULTIMATE.start_main_~#t498~0.offset_14|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_72|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_195, ULTIMATE.start_main_~#t499~0.base=|v_ULTIMATE.start_main_~#t499~0.base_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_377, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ULTIMATE.start_main_~#t497~0.base=|v_ULTIMATE.start_main_~#t497~0.base_22|, ~x~0=v_~x~0_245, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ULTIMATE.start_main_~#t498~0.base=|v_ULTIMATE.start_main_~#t498~0.base_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_294, ~y~0=v_~y~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_182, ULTIMATE.start_main_~#t497~0.offset=|v_ULTIMATE.start_main_~#t497~0.offset_16|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_378, ULTIMATE.start_main_~#t499~0.offset=|v_ULTIMATE.start_main_~#t499~0.offset_14|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t498~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t499~0.base, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t497~0.base, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ULTIMATE.start_main_~#t498~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t497~0.offset, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t499~0.offset] because there is no mapped edge [2019-12-27 01:43:58,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~x~0_11 1) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 01:43:58,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t498~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t498~0.base_11|) |v_ULTIMATE.start_main_~#t498~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t498~0.base_11| 4) |v_#length_15|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t498~0.base_11|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t498~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t498~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t498~0.offset_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t498~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t498~0.offset=|v_ULTIMATE.start_main_~#t498~0.offset_10|, ULTIMATE.start_main_~#t498~0.base=|v_ULTIMATE.start_main_~#t498~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t498~0.offset, ULTIMATE.start_main_~#t498~0.base, #length] because there is no mapped edge [2019-12-27 01:43:58,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t499~0.base_12| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t499~0.base_12| 1) |v_#valid_29|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t499~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t499~0.offset_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t499~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t499~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t499~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t499~0.base_12|) |v_ULTIMATE.start_main_~#t499~0.offset_10| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t499~0.base=|v_ULTIMATE.start_main_~#t499~0.base_12|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t499~0.offset=|v_ULTIMATE.start_main_~#t499~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t499~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t499~0.offset] because there is no mapped edge [2019-12-27 01:43:58,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In157930395 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In157930395 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite10_Out157930395| |P1Thread1of1ForFork2_#t~ite9_Out157930395|))) (or (and (= ~z~0_In157930395 |P1Thread1of1ForFork2_#t~ite9_Out157930395|) (or .cse0 .cse1) .cse2) (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In157930395 |P1Thread1of1ForFork2_#t~ite9_Out157930395|) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In157930395, ~z$w_buff1_used~0=~z$w_buff1_used~0_In157930395, ~z$w_buff1~0=~z$w_buff1~0_In157930395, ~z~0=~z~0_In157930395} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out157930395|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In157930395, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out157930395|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In157930395, ~z$w_buff1~0=~z$w_buff1~0_In157930395, ~z~0=~z~0_In157930395} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 01:43:58,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In168928365 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite24_Out168928365| |P2Thread1of1ForFork0_#t~ite23_Out168928365|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In168928365 256) 0))) (or (and (= (mod ~z$r_buff1_thd3~0_In168928365 256) 0) .cse0) (= 0 (mod ~z$w_buff0_used~0_In168928365 256)) (and .cse0 (= (mod ~z$w_buff1_used~0_In168928365 256) 0)))) .cse1 (= |P2Thread1of1ForFork0_#t~ite23_Out168928365| ~z$w_buff1~0_In168928365)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite24_Out168928365| ~z$w_buff1~0_In168928365) (= |P2Thread1of1ForFork0_#t~ite23_In168928365| |P2Thread1of1ForFork0_#t~ite23_Out168928365|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In168928365, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In168928365, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In168928365|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In168928365, ~z$w_buff1~0=~z$w_buff1~0_In168928365, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In168928365, ~weak$$choice2~0=~weak$$choice2~0_In168928365} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In168928365, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out168928365|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In168928365, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out168928365|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In168928365, ~z$w_buff1~0=~z$w_buff1~0_In168928365, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In168928365, ~weak$$choice2~0=~weak$$choice2~0_In168928365} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 01:43:58,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse4 (= 0 (mod ~weak$$choice2~0_In-291432668 256))) (.cse5 (= |P2Thread1of1ForFork0_#t~ite30_Out-291432668| |P2Thread1of1ForFork0_#t~ite29_Out-291432668|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-291432668 256) 0)) (.cse6 (= 0 (mod ~z$r_buff0_thd3~0_In-291432668 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-291432668 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-291432668 256)))) (or (let ((.cse2 (not .cse6))) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out-291432668| 0) (or (not .cse1) .cse2) (= |P2Thread1of1ForFork0_#t~ite28_Out-291432668| |P2Thread1of1ForFork0_#t~ite29_Out-291432668|) (or (not .cse3) .cse2) .cse4 .cse5)) (and (or (and (= ~z$w_buff1_used~0_In-291432668 |P2Thread1of1ForFork0_#t~ite30_Out-291432668|) (not .cse4) (= |P2Thread1of1ForFork0_#t~ite29_In-291432668| |P2Thread1of1ForFork0_#t~ite29_Out-291432668|)) (and (= ~z$w_buff1_used~0_In-291432668 |P2Thread1of1ForFork0_#t~ite29_Out-291432668|) .cse4 .cse5 (or (and .cse6 .cse1) (and .cse6 .cse3) .cse0))) (= |P2Thread1of1ForFork0_#t~ite28_In-291432668| |P2Thread1of1ForFork0_#t~ite28_Out-291432668|)))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In-291432668|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-291432668, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-291432668, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-291432668, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-291432668, ~weak$$choice2~0=~weak$$choice2~0_In-291432668, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-291432668|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-291432668|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-291432668, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-291432668, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-291432668, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-291432668, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-291432668|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-291432668|, ~weak$$choice2~0=~weak$$choice2~0_In-291432668} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 01:43:58,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$r_buff0_thd3~0_371 v_~z$r_buff0_thd3~0_370) (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_371, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_370, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 01:43:58,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 01:43:58,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out-644331375| |P2Thread1of1ForFork0_#t~ite39_Out-644331375|)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-644331375 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-644331375 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-644331375| ~z~0_In-644331375) .cse0 (or .cse1 .cse2)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-644331375| ~z$w_buff1~0_In-644331375) .cse0 (not .cse1) (not .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-644331375, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-644331375, ~z$w_buff1~0=~z$w_buff1~0_In-644331375, ~z~0=~z~0_In-644331375} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-644331375|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-644331375|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-644331375, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-644331375, ~z$w_buff1~0=~z$w_buff1~0_In-644331375, ~z~0=~z~0_In-644331375} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:43:58,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1359363469 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1359363469 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1359363469|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1359363469 |P2Thread1of1ForFork0_#t~ite40_Out1359363469|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1359363469, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1359363469} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1359363469, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1359363469|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1359363469} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 01:43:58,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In502304676 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In502304676 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In502304676 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In502304676 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out502304676| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite41_Out502304676| ~z$w_buff1_used~0_In502304676) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In502304676, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In502304676, ~z$w_buff1_used~0=~z$w_buff1_used~0_In502304676, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In502304676} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In502304676, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In502304676, ~z$w_buff1_used~0=~z$w_buff1_used~0_In502304676, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In502304676, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out502304676|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 01:43:58,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1126279546 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1126279546 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1126279546| 0)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out1126279546| ~z$r_buff0_thd3~0_In1126279546) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1126279546, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1126279546} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1126279546, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1126279546, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1126279546|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 01:43:58,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In-1498170710 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1498170710 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1498170710 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1498170710 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1498170710|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1498170710 |P2Thread1of1ForFork0_#t~ite43_Out-1498170710|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1498170710, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1498170710, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1498170710, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1498170710} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1498170710|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1498170710, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1498170710, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1498170710, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1498170710} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 01:43:58,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_308 |v_P2Thread1of1ForFork0_#t~ite43_56|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_308, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 01:43:58,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-1217099114 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1217099114 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-1217099114| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-1217099114| ~z$w_buff0_used~0_In-1217099114)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1217099114, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1217099114} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1217099114|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1217099114, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1217099114} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 01:43:58,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1987505237 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1987505237 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1987505237 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In1987505237 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out1987505237| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite6_Out1987505237| ~z$w_buff1_used~0_In1987505237) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1987505237, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1987505237, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1987505237, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1987505237} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1987505237, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1987505237|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1987505237, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1987505237, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1987505237} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 01:43:58,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-532626389 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-532626389 256) 0))) (or (and (= ~z$r_buff0_thd1~0_Out-532626389 ~z$r_buff0_thd1~0_In-532626389) (or .cse0 .cse1)) (and (= ~z$r_buff0_thd1~0_Out-532626389 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-532626389, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-532626389} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-532626389, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-532626389|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-532626389} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:43:58,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In216535618 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In216535618 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In216535618 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In216535618 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out216535618|)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite8_Out216535618| ~z$r_buff1_thd1~0_In216535618) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In216535618, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In216535618, ~z$w_buff1_used~0=~z$w_buff1_used~0_In216535618, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In216535618} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out216535618|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In216535618, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In216535618, ~z$w_buff1_used~0=~z$w_buff1_used~0_In216535618, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In216535618} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 01:43:58,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 01:43:58,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2141180073 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In2141180073 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out2141180073|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In2141180073 |P1Thread1of1ForFork2_#t~ite11_Out2141180073|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2141180073, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2141180073} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2141180073, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out2141180073|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2141180073} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 01:43:58,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In1850068276 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1850068276 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1850068276 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1850068276 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1850068276|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1850068276 |P1Thread1of1ForFork2_#t~ite12_Out1850068276|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1850068276, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1850068276, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1850068276, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1850068276} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1850068276, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1850068276, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1850068276, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1850068276|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1850068276} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 01:43:58,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1974601637 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1974601637 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-1974601637| ~z$r_buff0_thd2~0_In-1974601637)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out-1974601637| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1974601637, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1974601637} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1974601637, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1974601637|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1974601637} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 01:43:58,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In-1939984183 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1939984183 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1939984183 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1939984183 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-1939984183| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-1939984183| ~z$r_buff1_thd2~0_In-1939984183)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1939984183, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1939984183, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1939984183, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1939984183} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1939984183, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1939984183, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1939984183, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1939984183|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1939984183} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 01:43:58,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= v_~z$r_buff1_thd2~0_188 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_188, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 01:43:58,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: 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_5|, ~__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:43:58,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1871032904 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1871032904 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out1871032904| ~z$w_buff1~0_In1871032904) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite47_Out1871032904| ~z~0_In1871032904)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1871032904, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1871032904, ~z$w_buff1~0=~z$w_buff1~0_In1871032904, ~z~0=~z~0_In1871032904} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1871032904, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1871032904|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1871032904, ~z$w_buff1~0=~z$w_buff1~0_In1871032904, ~z~0=~z~0_In1871032904} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 01:43:58,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 01:43:58,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In110848449 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In110848449 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In110848449 |ULTIMATE.start_main_#t~ite49_Out110848449|)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out110848449|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In110848449, ~z$w_buff0_used~0=~z$w_buff0_used~0_In110848449} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In110848449, ~z$w_buff0_used~0=~z$w_buff0_used~0_In110848449, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out110848449|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 01:43:58,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In406438872 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In406438872 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In406438872 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In406438872 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out406438872|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite50_Out406438872| ~z$w_buff1_used~0_In406438872)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In406438872, ~z$w_buff0_used~0=~z$w_buff0_used~0_In406438872, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In406438872, ~z$w_buff1_used~0=~z$w_buff1_used~0_In406438872} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out406438872|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In406438872, ~z$w_buff0_used~0=~z$w_buff0_used~0_In406438872, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In406438872, ~z$w_buff1_used~0=~z$w_buff1_used~0_In406438872} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 01:43:58,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-634108497 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-634108497 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-634108497| ~z$r_buff0_thd0~0_In-634108497)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-634108497| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-634108497, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-634108497} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-634108497, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-634108497|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-634108497} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 01:43:58,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In311853455 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In311853455 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In311853455 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In311853455 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out311853455| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In311853455 |ULTIMATE.start_main_#t~ite52_Out311853455|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In311853455, ~z$w_buff0_used~0=~z$w_buff0_used~0_In311853455, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In311853455, ~z$w_buff1_used~0=~z$w_buff1_used~0_In311853455} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out311853455|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In311853455, ~z$w_buff0_used~0=~z$w_buff0_used~0_In311853455, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In311853455, ~z$w_buff1_used~0=~z$w_buff1_used~0_In311853455} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 01:43:58,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite52_38|) (= 0 v_~__unbuffered_p1_EAX~0_22) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 2 v_~x~0_186)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_186} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_186, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:43:58,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:43:58 BasicIcfg [2019-12-27 01:43:58,930 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:43:58,932 INFO L168 Benchmark]: Toolchain (without parser) took 115431.13 ms. Allocated memory was 143.1 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 98.7 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 01:43:58,932 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 01:43:58,933 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.05 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 98.5 MB in the beginning and 153.8 MB in the end (delta: -55.3 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 01:43:58,933 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.70 ms. Allocated memory is still 200.8 MB. Free memory was 153.8 MB in the beginning and 151.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:43:58,934 INFO L168 Benchmark]: Boogie Preprocessor took 46.62 ms. Allocated memory is still 200.8 MB. Free memory was 151.1 MB in the beginning and 149.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 01:43:58,934 INFO L168 Benchmark]: RCFGBuilder took 862.07 ms. Allocated memory is still 200.8 MB. Free memory was 149.0 MB in the beginning and 98.6 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-27 01:43:58,935 INFO L168 Benchmark]: TraceAbstraction took 113642.10 ms. Allocated memory was 200.8 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 98.6 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 01:43:58,937 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.24 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 806.05 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 98.5 MB in the beginning and 153.8 MB in the end (delta: -55.3 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.70 ms. Allocated memory is still 200.8 MB. Free memory was 153.8 MB in the beginning and 151.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.62 ms. Allocated memory is still 200.8 MB. Free memory was 151.1 MB in the beginning and 149.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 862.07 ms. Allocated memory is still 200.8 MB. Free memory was 149.0 MB in the beginning and 98.6 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 113642.10 ms. Allocated memory was 200.8 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 98.6 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7044 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t497, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t498, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 2 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t499, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 113.2s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 30.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7648 SDtfs, 8939 SDslu, 27467 SDs, 0 SdLazy, 15475 SolverSat, 373 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 381 GetRequests, 39 SyntacticMatches, 34 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred 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: 51.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 306405 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1292 NumberOfCodeBlocks, 1292 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1196 ConstructedInterpolants, 0 QuantifiedInterpolants, 273522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...