/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/mix035_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:13:33,291 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:13:33,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:13:33,306 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:13:33,306 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:13:33,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:13:33,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:13:33,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:13:33,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:13:33,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:13:33,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:13:33,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:13:33,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:13:33,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:13:33,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:13:33,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:13:33,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:13:33,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:13:33,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:13:33,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:13:33,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:13:33,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:13:33,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:13:33,339 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:13:33,341 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:13:33,341 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:13:33,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:13:33,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:13:33,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:13:33,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:13:33,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:13:33,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:13:33,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:13:33,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:13:33,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:13:33,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:13:33,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:13:33,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:13:33,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:13:33,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:13:33,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:13:33,350 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-18 17:13:33,364 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:13:33,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:13:33,365 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:13:33,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:13:33,366 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:13:33,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:13:33,366 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:13:33,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:13:33,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:13:33,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:13:33,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:13:33,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:13:33,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:13:33,368 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:13:33,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:13:33,368 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:13:33,368 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:13:33,368 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:13:33,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:13:33,369 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:13:33,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:13:33,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:13:33,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:13:33,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:13:33,370 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:13:33,370 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:13:33,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:13:33,370 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:13:33,371 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:13:33,631 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:13:33,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:13:33,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:13:33,648 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:13:33,649 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:13:33,649 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_power.oepc.i [2019-12-18 17:13:33,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dcb5519b/bd896dfa1973477cb6312ab936936ab6/FLAG133d6db90 [2019-12-18 17:13:34,312 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:13:34,313 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.oepc.i [2019-12-18 17:13:34,330 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dcb5519b/bd896dfa1973477cb6312ab936936ab6/FLAG133d6db90 [2019-12-18 17:13:34,577 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dcb5519b/bd896dfa1973477cb6312ab936936ab6 [2019-12-18 17:13:34,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:13:34,590 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:13:34,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:13:34,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:13:34,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:13:34,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:13:34" (1/1) ... [2019-12-18 17:13:34,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e483e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:34, skipping insertion in model container [2019-12-18 17:13:34,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:13:34" (1/1) ... [2019-12-18 17:13:34,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:13:34,670 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:13:35,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:13:35,182 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:13:35,266 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:13:35,339 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:13:35,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:35 WrapperNode [2019-12-18 17:13:35,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:13:35,341 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:13:35,341 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:13:35,341 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:13:35,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:35" (1/1) ... [2019-12-18 17:13:35,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:35" (1/1) ... [2019-12-18 17:13:35,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:13:35,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:13:35,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:13:35,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:13:35,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:35" (1/1) ... [2019-12-18 17:13:35,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:35" (1/1) ... [2019-12-18 17:13:35,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:35" (1/1) ... [2019-12-18 17:13:35,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:35" (1/1) ... [2019-12-18 17:13:35,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:35" (1/1) ... [2019-12-18 17:13:35,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:35" (1/1) ... [2019-12-18 17:13:35,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:35" (1/1) ... [2019-12-18 17:13:35,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:13:35,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:13:35,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:13:35,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:13:35,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:13:35,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:13:35,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:13:35,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:13:35,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:13:35,530 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:13:35,530 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:13:35,530 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:13:35,531 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:13:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:13:35,531 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:13:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:13:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:13:35,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:13:35,533 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:13:36,267 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:13:36,268 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:13:36,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:13:36 BoogieIcfgContainer [2019-12-18 17:13:36,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:13:36,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:13:36,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:13:36,275 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:13:36,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:13:34" (1/3) ... [2019-12-18 17:13:36,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f4d7b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:13:36, skipping insertion in model container [2019-12-18 17:13:36,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:35" (2/3) ... [2019-12-18 17:13:36,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f4d7b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:13:36, skipping insertion in model container [2019-12-18 17:13:36,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:13:36" (3/3) ... [2019-12-18 17:13:36,279 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_power.oepc.i [2019-12-18 17:13:36,290 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:13:36,291 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:13:36,299 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:13:36,300 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:13:36,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,344 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,344 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,345 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,345 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,346 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,359 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,360 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,396 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,397 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,443 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,445 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,459 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,459 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,459 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,462 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,462 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:36,483 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:13:36,506 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:13:36,506 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:13:36,506 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:13:36,506 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:13:36,507 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:13:36,507 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:13:36,507 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:13:36,507 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:13:36,529 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-18 17:13:36,532 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 17:13:36,653 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 17:13:36,653 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:13:36,673 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:13:36,702 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 17:13:36,754 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 17:13:36,754 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:13:36,773 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:13:36,796 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 17:13:36,797 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:13:41,686 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-12-18 17:13:42,367 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 17:13:42,516 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 17:13:42,671 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83880 [2019-12-18 17:13:42,671 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 17:13:42,675 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-18 17:14:00,444 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118052 states. [2019-12-18 17:14:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 118052 states. [2019-12-18 17:14:00,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 17:14:00,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:00,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 17:14:00,451 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:00,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:00,456 INFO L82 PathProgramCache]: Analyzing trace with hash 918883, now seen corresponding path program 1 times [2019-12-18 17:14:00,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:00,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176992593] [2019-12-18 17:14:00,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:14:00,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176992593] [2019-12-18 17:14:00,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:00,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:14:00,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563438779] [2019-12-18 17:14:00,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:14:00,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:00,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:14:00,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:00,690 INFO L87 Difference]: Start difference. First operand 118052 states. Second operand 3 states. [2019-12-18 17:14:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:02,066 INFO L93 Difference]: Finished difference Result 117122 states and 502402 transitions. [2019-12-18 17:14:02,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:14:02,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 17:14:02,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:02,691 INFO L225 Difference]: With dead ends: 117122 [2019-12-18 17:14:02,691 INFO L226 Difference]: Without dead ends: 109842 [2019-12-18 17:14:02,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:09,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109842 states. [2019-12-18 17:14:12,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109842 to 109842. [2019-12-18 17:14:12,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109842 states. [2019-12-18 17:14:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109842 states to 109842 states and 470538 transitions. [2019-12-18 17:14:16,621 INFO L78 Accepts]: Start accepts. Automaton has 109842 states and 470538 transitions. Word has length 3 [2019-12-18 17:14:16,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:16,621 INFO L462 AbstractCegarLoop]: Abstraction has 109842 states and 470538 transitions. [2019-12-18 17:14:16,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:14:16,622 INFO L276 IsEmpty]: Start isEmpty. Operand 109842 states and 470538 transitions. [2019-12-18 17:14:16,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 17:14:16,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:16,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:16,627 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:16,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:16,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1326055600, now seen corresponding path program 1 times [2019-12-18 17:14:16,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:16,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091293612] [2019-12-18 17:14:16,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:14:16,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091293612] [2019-12-18 17:14:16,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:16,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:14:16,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611246853] [2019-12-18 17:14:16,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:14:16,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:16,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:14:16,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:14:16,780 INFO L87 Difference]: Start difference. First operand 109842 states and 470538 transitions. Second operand 4 states. [2019-12-18 17:14:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:22,427 INFO L93 Difference]: Finished difference Result 170700 states and 702967 transitions. [2019-12-18 17:14:22,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:14:22,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 17:14:22,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:23,103 INFO L225 Difference]: With dead ends: 170700 [2019-12-18 17:14:23,103 INFO L226 Difference]: Without dead ends: 170651 [2019-12-18 17:14:23,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:14:28,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170651 states. [2019-12-18 17:14:31,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170651 to 155174. [2019-12-18 17:14:31,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155174 states. [2019-12-18 17:14:32,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155174 states to 155174 states and 647977 transitions. [2019-12-18 17:14:32,196 INFO L78 Accepts]: Start accepts. Automaton has 155174 states and 647977 transitions. Word has length 11 [2019-12-18 17:14:32,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:32,196 INFO L462 AbstractCegarLoop]: Abstraction has 155174 states and 647977 transitions. [2019-12-18 17:14:32,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:14:32,196 INFO L276 IsEmpty]: Start isEmpty. Operand 155174 states and 647977 transitions. [2019-12-18 17:14:32,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:14:32,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:32,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:32,202 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:32,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:32,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1447855061, now seen corresponding path program 1 times [2019-12-18 17:14:32,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:32,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200327424] [2019-12-18 17:14:32,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:32,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:14:32,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200327424] [2019-12-18 17:14:32,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:32,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:14:32,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265701576] [2019-12-18 17:14:32,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:14:32,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:32,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:14:32,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:32,289 INFO L87 Difference]: Start difference. First operand 155174 states and 647977 transitions. Second operand 3 states. [2019-12-18 17:14:37,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:37,046 INFO L93 Difference]: Finished difference Result 33806 states and 110729 transitions. [2019-12-18 17:14:37,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:14:37,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 17:14:37,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:37,117 INFO L225 Difference]: With dead ends: 33806 [2019-12-18 17:14:37,117 INFO L226 Difference]: Without dead ends: 33806 [2019-12-18 17:14:37,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:37,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33806 states. [2019-12-18 17:14:37,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33806 to 33806. [2019-12-18 17:14:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33806 states. [2019-12-18 17:14:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33806 states to 33806 states and 110729 transitions. [2019-12-18 17:14:37,712 INFO L78 Accepts]: Start accepts. Automaton has 33806 states and 110729 transitions. Word has length 13 [2019-12-18 17:14:37,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:37,713 INFO L462 AbstractCegarLoop]: Abstraction has 33806 states and 110729 transitions. [2019-12-18 17:14:37,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:14:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 33806 states and 110729 transitions. [2019-12-18 17:14:37,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:14:37,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:37,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:37,716 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:37,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:37,716 INFO L82 PathProgramCache]: Analyzing trace with hash 627665056, now seen corresponding path program 1 times [2019-12-18 17:14:37,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:37,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710817595] [2019-12-18 17:14:37,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:14:37,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710817595] [2019-12-18 17:14:37,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:37,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:14:37,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261434568] [2019-12-18 17:14:37,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:14:37,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:37,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:14:37,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:37,789 INFO L87 Difference]: Start difference. First operand 33806 states and 110729 transitions. Second operand 3 states. [2019-12-18 17:14:37,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:37,982 INFO L93 Difference]: Finished difference Result 52205 states and 169891 transitions. [2019-12-18 17:14:37,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:14:37,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 17:14:37,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:38,070 INFO L225 Difference]: With dead ends: 52205 [2019-12-18 17:14:38,071 INFO L226 Difference]: Without dead ends: 52205 [2019-12-18 17:14:38,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:38,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52205 states. [2019-12-18 17:14:39,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52205 to 38718. [2019-12-18 17:14:39,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38718 states. [2019-12-18 17:14:39,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38718 states to 38718 states and 127749 transitions. [2019-12-18 17:14:39,125 INFO L78 Accepts]: Start accepts. Automaton has 38718 states and 127749 transitions. Word has length 16 [2019-12-18 17:14:39,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:39,126 INFO L462 AbstractCegarLoop]: Abstraction has 38718 states and 127749 transitions. [2019-12-18 17:14:39,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:14:39,126 INFO L276 IsEmpty]: Start isEmpty. Operand 38718 states and 127749 transitions. [2019-12-18 17:14:39,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:14:39,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:39,130 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:39,130 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:39,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:39,131 INFO L82 PathProgramCache]: Analyzing trace with hash 712450242, now seen corresponding path program 1 times [2019-12-18 17:14:39,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:39,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371765494] [2019-12-18 17:14:39,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:39,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:14:39,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371765494] [2019-12-18 17:14:39,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:39,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:14:39,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389376777] [2019-12-18 17:14:39,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:14:39,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:39,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:14:39,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:14:39,215 INFO L87 Difference]: Start difference. First operand 38718 states and 127749 transitions. Second operand 4 states. [2019-12-18 17:14:39,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:39,585 INFO L93 Difference]: Finished difference Result 46485 states and 150983 transitions. [2019-12-18 17:14:39,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:14:39,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:14:39,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:39,666 INFO L225 Difference]: With dead ends: 46485 [2019-12-18 17:14:39,666 INFO L226 Difference]: Without dead ends: 46485 [2019-12-18 17:14:39,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:14:39,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46485 states. [2019-12-18 17:14:40,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46485 to 42622. [2019-12-18 17:14:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42622 states. [2019-12-18 17:14:40,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42622 states to 42622 states and 139503 transitions. [2019-12-18 17:14:40,708 INFO L78 Accepts]: Start accepts. Automaton has 42622 states and 139503 transitions. Word has length 16 [2019-12-18 17:14:40,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:40,708 INFO L462 AbstractCegarLoop]: Abstraction has 42622 states and 139503 transitions. [2019-12-18 17:14:40,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:14:40,708 INFO L276 IsEmpty]: Start isEmpty. Operand 42622 states and 139503 transitions. [2019-12-18 17:14:40,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:14:40,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:40,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:40,712 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:40,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:40,713 INFO L82 PathProgramCache]: Analyzing trace with hash 646000998, now seen corresponding path program 1 times [2019-12-18 17:14:40,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:40,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419740090] [2019-12-18 17:14:40,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:40,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:14:40,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419740090] [2019-12-18 17:14:40,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:40,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:14:40,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217019626] [2019-12-18 17:14:40,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:14:40,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:40,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:14:40,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:14:40,820 INFO L87 Difference]: Start difference. First operand 42622 states and 139503 transitions. Second operand 4 states. [2019-12-18 17:14:41,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:41,198 INFO L93 Difference]: Finished difference Result 51005 states and 165609 transitions. [2019-12-18 17:14:41,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:14:41,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:14:41,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:41,290 INFO L225 Difference]: With dead ends: 51005 [2019-12-18 17:14:41,290 INFO L226 Difference]: Without dead ends: 51005 [2019-12-18 17:14:41,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:14:41,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51005 states. [2019-12-18 17:14:41,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51005 to 44274. [2019-12-18 17:14:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44274 states. [2019-12-18 17:14:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44274 states to 44274 states and 144974 transitions. [2019-12-18 17:14:42,584 INFO L78 Accepts]: Start accepts. Automaton has 44274 states and 144974 transitions. Word has length 16 [2019-12-18 17:14:42,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:42,585 INFO L462 AbstractCegarLoop]: Abstraction has 44274 states and 144974 transitions. [2019-12-18 17:14:42,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:14:42,585 INFO L276 IsEmpty]: Start isEmpty. Operand 44274 states and 144974 transitions. [2019-12-18 17:14:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 17:14:42,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:42,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:42,596 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:42,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:42,596 INFO L82 PathProgramCache]: Analyzing trace with hash -2051800974, now seen corresponding path program 1 times [2019-12-18 17:14:42,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:42,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021457211] [2019-12-18 17:14:42,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:42,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:14:42,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021457211] [2019-12-18 17:14:42,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:42,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:14:42,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198797237] [2019-12-18 17:14:42,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:14:42,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:42,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:14:42,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:14:42,682 INFO L87 Difference]: Start difference. First operand 44274 states and 144974 transitions. Second operand 5 states. [2019-12-18 17:14:43,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:43,344 INFO L93 Difference]: Finished difference Result 60565 states and 193473 transitions. [2019-12-18 17:14:43,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:14:43,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 17:14:43,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:43,451 INFO L225 Difference]: With dead ends: 60565 [2019-12-18 17:14:43,452 INFO L226 Difference]: Without dead ends: 60558 [2019-12-18 17:14:43,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:14:43,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60558 states. [2019-12-18 17:14:44,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60558 to 45614. [2019-12-18 17:14:44,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45614 states. [2019-12-18 17:14:44,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45614 states to 45614 states and 149067 transitions. [2019-12-18 17:14:44,353 INFO L78 Accepts]: Start accepts. Automaton has 45614 states and 149067 transitions. Word has length 22 [2019-12-18 17:14:44,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:44,354 INFO L462 AbstractCegarLoop]: Abstraction has 45614 states and 149067 transitions. [2019-12-18 17:14:44,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:14:44,354 INFO L276 IsEmpty]: Start isEmpty. Operand 45614 states and 149067 transitions. [2019-12-18 17:14:44,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 17:14:44,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:44,363 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:44,363 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:44,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:44,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2118250218, now seen corresponding path program 1 times [2019-12-18 17:14:44,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:44,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116111646] [2019-12-18 17:14:44,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:44,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:14:44,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116111646] [2019-12-18 17:14:44,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:44,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:14:44,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629054909] [2019-12-18 17:14:44,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:14:44,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:44,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:14:44,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:14:44,841 INFO L87 Difference]: Start difference. First operand 45614 states and 149067 transitions. Second operand 5 states. [2019-12-18 17:14:45,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:45,499 INFO L93 Difference]: Finished difference Result 63360 states and 201880 transitions. [2019-12-18 17:14:45,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:14:45,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 17:14:45,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:45,612 INFO L225 Difference]: With dead ends: 63360 [2019-12-18 17:14:45,612 INFO L226 Difference]: Without dead ends: 63353 [2019-12-18 17:14:45,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:14:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63353 states. [2019-12-18 17:14:46,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63353 to 43925. [2019-12-18 17:14:46,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43925 states. [2019-12-18 17:14:46,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43925 states to 43925 states and 143672 transitions. [2019-12-18 17:14:46,515 INFO L78 Accepts]: Start accepts. Automaton has 43925 states and 143672 transitions. Word has length 22 [2019-12-18 17:14:46,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:46,515 INFO L462 AbstractCegarLoop]: Abstraction has 43925 states and 143672 transitions. [2019-12-18 17:14:46,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:14:46,515 INFO L276 IsEmpty]: Start isEmpty. Operand 43925 states and 143672 transitions. [2019-12-18 17:14:46,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 17:14:46,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:46,528 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:46,528 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:46,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:46,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1701171988, now seen corresponding path program 1 times [2019-12-18 17:14:46,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:46,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414698283] [2019-12-18 17:14:46,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:14:46,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414698283] [2019-12-18 17:14:46,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:46,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:14:46,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764983920] [2019-12-18 17:14:46,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:14:46,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:46,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:14:46,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:14:46,591 INFO L87 Difference]: Start difference. First operand 43925 states and 143672 transitions. Second operand 4 states. [2019-12-18 17:14:46,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:46,679 INFO L93 Difference]: Finished difference Result 18121 states and 56197 transitions. [2019-12-18 17:14:46,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:14:46,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 17:14:46,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:46,719 INFO L225 Difference]: With dead ends: 18121 [2019-12-18 17:14:46,720 INFO L226 Difference]: Without dead ends: 18121 [2019-12-18 17:14:46,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:14:46,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18121 states. [2019-12-18 17:14:47,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18121 to 17758. [2019-12-18 17:14:47,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-18 17:14:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 55161 transitions. [2019-12-18 17:14:47,272 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 55161 transitions. Word has length 25 [2019-12-18 17:14:47,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:47,273 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 55161 transitions. [2019-12-18 17:14:47,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:14:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 55161 transitions. [2019-12-18 17:14:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:14:47,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:47,287 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:47,287 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:47,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:47,287 INFO L82 PathProgramCache]: Analyzing trace with hash -735951720, now seen corresponding path program 1 times [2019-12-18 17:14:47,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:47,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200420694] [2019-12-18 17:14:47,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:47,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-18 17:14:47,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200420694] [2019-12-18 17:14:47,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:47,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:14:47,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542038113] [2019-12-18 17:14:47,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:14:47,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:47,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:14:47,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:47,337 INFO L87 Difference]: Start difference. First operand 17758 states and 55161 transitions. Second operand 3 states. [2019-12-18 17:14:47,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:47,459 INFO L93 Difference]: Finished difference Result 23499 states and 69479 transitions. [2019-12-18 17:14:47,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:14:47,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 17:14:47,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:47,491 INFO L225 Difference]: With dead ends: 23499 [2019-12-18 17:14:47,491 INFO L226 Difference]: Without dead ends: 23499 [2019-12-18 17:14:47,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:47,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23499 states. [2019-12-18 17:14:47,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23499 to 17758. [2019-12-18 17:14:47,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-18 17:14:47,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 52847 transitions. [2019-12-18 17:14:47,793 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 52847 transitions. Word has length 27 [2019-12-18 17:14:47,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:47,794 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 52847 transitions. [2019-12-18 17:14:47,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:14:47,794 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 52847 transitions. [2019-12-18 17:14:47,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:14:47,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:47,807 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:47,807 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:47,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:47,807 INFO L82 PathProgramCache]: Analyzing trace with hash -963527987, now seen corresponding path program 1 times [2019-12-18 17:14:47,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:47,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157574152] [2019-12-18 17:14:47,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:14:47,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157574152] [2019-12-18 17:14:47,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:47,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:14:47,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411628585] [2019-12-18 17:14:47,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:14:47,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:47,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:14:47,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:14:47,895 INFO L87 Difference]: Start difference. First operand 17758 states and 52847 transitions. Second operand 5 states. [2019-12-18 17:14:48,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:48,269 INFO L93 Difference]: Finished difference Result 21964 states and 64554 transitions. [2019-12-18 17:14:48,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:14:48,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 17:14:48,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:48,311 INFO L225 Difference]: With dead ends: 21964 [2019-12-18 17:14:48,311 INFO L226 Difference]: Without dead ends: 21964 [2019-12-18 17:14:48,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:14:48,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21964 states. [2019-12-18 17:14:48,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21964 to 20594. [2019-12-18 17:14:48,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20594 states. [2019-12-18 17:14:48,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20594 states to 20594 states and 61091 transitions. [2019-12-18 17:14:48,622 INFO L78 Accepts]: Start accepts. Automaton has 20594 states and 61091 transitions. Word has length 27 [2019-12-18 17:14:48,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:48,622 INFO L462 AbstractCegarLoop]: Abstraction has 20594 states and 61091 transitions. [2019-12-18 17:14:48,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:14:48,622 INFO L276 IsEmpty]: Start isEmpty. Operand 20594 states and 61091 transitions. [2019-12-18 17:14:48,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 17:14:48,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:48,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:48,637 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:48,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:48,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1072867226, now seen corresponding path program 1 times [2019-12-18 17:14:48,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:48,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999893532] [2019-12-18 17:14:48,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:14:48,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999893532] [2019-12-18 17:14:48,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:48,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:14:48,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102690820] [2019-12-18 17:14:48,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:14:48,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:48,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:14:48,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:14:48,717 INFO L87 Difference]: Start difference. First operand 20594 states and 61091 transitions. Second operand 5 states. [2019-12-18 17:14:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:49,112 INFO L93 Difference]: Finished difference Result 24066 states and 70567 transitions. [2019-12-18 17:14:49,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:14:49,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 17:14:49,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:49,160 INFO L225 Difference]: With dead ends: 24066 [2019-12-18 17:14:49,160 INFO L226 Difference]: Without dead ends: 24066 [2019-12-18 17:14:49,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:14:49,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24066 states. [2019-12-18 17:14:49,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24066 to 20500. [2019-12-18 17:14:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20500 states. [2019-12-18 17:14:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20500 states to 20500 states and 60659 transitions. [2019-12-18 17:14:49,916 INFO L78 Accepts]: Start accepts. Automaton has 20500 states and 60659 transitions. Word has length 28 [2019-12-18 17:14:49,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:49,919 INFO L462 AbstractCegarLoop]: Abstraction has 20500 states and 60659 transitions. [2019-12-18 17:14:49,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:14:49,919 INFO L276 IsEmpty]: Start isEmpty. Operand 20500 states and 60659 transitions. [2019-12-18 17:14:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:14:49,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:49,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] [2019-12-18 17:14:49,954 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:49,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:49,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1459957021, now seen corresponding path program 1 times [2019-12-18 17:14:49,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:49,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597850694] [2019-12-18 17:14:49,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:14:50,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597850694] [2019-12-18 17:14:50,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:50,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:14:50,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783847166] [2019-12-18 17:14:50,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:14:50,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:50,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:14:50,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:14:50,101 INFO L87 Difference]: Start difference. First operand 20500 states and 60659 transitions. Second operand 6 states. [2019-12-18 17:14:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:50,843 INFO L93 Difference]: Finished difference Result 27550 states and 80418 transitions. [2019-12-18 17:14:50,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:14:50,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 17:14:50,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:50,887 INFO L225 Difference]: With dead ends: 27550 [2019-12-18 17:14:50,887 INFO L226 Difference]: Without dead ends: 27550 [2019-12-18 17:14:50,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:14:50,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27550 states. [2019-12-18 17:14:51,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27550 to 21734. [2019-12-18 17:14:51,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21734 states. [2019-12-18 17:14:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21734 states to 21734 states and 64417 transitions. [2019-12-18 17:14:51,252 INFO L78 Accepts]: Start accepts. Automaton has 21734 states and 64417 transitions. Word has length 33 [2019-12-18 17:14:51,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:51,253 INFO L462 AbstractCegarLoop]: Abstraction has 21734 states and 64417 transitions. [2019-12-18 17:14:51,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:14:51,253 INFO L276 IsEmpty]: Start isEmpty. Operand 21734 states and 64417 transitions. [2019-12-18 17:14:51,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 17:14:51,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:51,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:51,274 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:51,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:51,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1108508854, now seen corresponding path program 1 times [2019-12-18 17:14:51,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:51,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663943101] [2019-12-18 17:14:51,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:51,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:14:51,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663943101] [2019-12-18 17:14:51,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:51,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:14:51,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609143396] [2019-12-18 17:14:51,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:14:51,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:51,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:14:51,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:14:51,363 INFO L87 Difference]: Start difference. First operand 21734 states and 64417 transitions. Second operand 6 states. [2019-12-18 17:14:52,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:52,110 INFO L93 Difference]: Finished difference Result 26719 states and 78128 transitions. [2019-12-18 17:14:52,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:14:52,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 17:14:52,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:52,146 INFO L225 Difference]: With dead ends: 26719 [2019-12-18 17:14:52,147 INFO L226 Difference]: Without dead ends: 26719 [2019-12-18 17:14:52,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:14:52,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26719 states. [2019-12-18 17:14:52,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26719 to 18663. [2019-12-18 17:14:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18663 states. [2019-12-18 17:14:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18663 states to 18663 states and 55458 transitions. [2019-12-18 17:14:52,480 INFO L78 Accepts]: Start accepts. Automaton has 18663 states and 55458 transitions. Word has length 34 [2019-12-18 17:14:52,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:52,480 INFO L462 AbstractCegarLoop]: Abstraction has 18663 states and 55458 transitions. [2019-12-18 17:14:52,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:14:52,480 INFO L276 IsEmpty]: Start isEmpty. Operand 18663 states and 55458 transitions. [2019-12-18 17:14:52,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 17:14:52,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:52,498 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:52,498 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:52,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:52,499 INFO L82 PathProgramCache]: Analyzing trace with hash -282480739, now seen corresponding path program 1 times [2019-12-18 17:14:52,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:52,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423950755] [2019-12-18 17:14:52,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:52,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:14:52,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423950755] [2019-12-18 17:14:52,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:52,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:14:52,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085260175] [2019-12-18 17:14:52,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:14:52,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:52,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:14:52,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:52,561 INFO L87 Difference]: Start difference. First operand 18663 states and 55458 transitions. Second operand 3 states. [2019-12-18 17:14:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:52,633 INFO L93 Difference]: Finished difference Result 18662 states and 55456 transitions. [2019-12-18 17:14:52,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:14:52,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 17:14:52,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:52,664 INFO L225 Difference]: With dead ends: 18662 [2019-12-18 17:14:52,664 INFO L226 Difference]: Without dead ends: 18662 [2019-12-18 17:14:52,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:52,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18662 states. [2019-12-18 17:14:53,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18662 to 18662. [2019-12-18 17:14:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18662 states. [2019-12-18 17:14:53,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18662 states to 18662 states and 55456 transitions. [2019-12-18 17:14:53,069 INFO L78 Accepts]: Start accepts. Automaton has 18662 states and 55456 transitions. Word has length 39 [2019-12-18 17:14:53,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:53,069 INFO L462 AbstractCegarLoop]: Abstraction has 18662 states and 55456 transitions. [2019-12-18 17:14:53,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:14:53,070 INFO L276 IsEmpty]: Start isEmpty. Operand 18662 states and 55456 transitions. [2019-12-18 17:14:53,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 17:14:53,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:53,090 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:53,090 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:53,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:53,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1129418560, now seen corresponding path program 1 times [2019-12-18 17:14:53,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:53,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841359291] [2019-12-18 17:14:53,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:14:53,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841359291] [2019-12-18 17:14:53,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:53,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:14:53,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148591981] [2019-12-18 17:14:53,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:14:53,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:53,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:14:53,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:14:53,163 INFO L87 Difference]: Start difference. First operand 18662 states and 55456 transitions. Second operand 5 states. [2019-12-18 17:14:53,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:53,818 INFO L93 Difference]: Finished difference Result 29897 states and 87501 transitions. [2019-12-18 17:14:53,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:14:53,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 17:14:53,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:53,859 INFO L225 Difference]: With dead ends: 29897 [2019-12-18 17:14:53,860 INFO L226 Difference]: Without dead ends: 29897 [2019-12-18 17:14:53,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:14:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29897 states. [2019-12-18 17:14:54,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29897 to 23727. [2019-12-18 17:14:54,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23727 states. [2019-12-18 17:14:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23727 states to 23727 states and 70357 transitions. [2019-12-18 17:14:54,247 INFO L78 Accepts]: Start accepts. Automaton has 23727 states and 70357 transitions. Word has length 40 [2019-12-18 17:14:54,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:54,248 INFO L462 AbstractCegarLoop]: Abstraction has 23727 states and 70357 transitions. [2019-12-18 17:14:54,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:14:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 23727 states and 70357 transitions. [2019-12-18 17:14:54,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 17:14:54,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:54,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:54,279 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:54,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:54,280 INFO L82 PathProgramCache]: Analyzing trace with hash -554035702, now seen corresponding path program 2 times [2019-12-18 17:14:54,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:54,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012650616] [2019-12-18 17:14:54,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:54,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:14:54,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012650616] [2019-12-18 17:14:54,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:54,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:14:54,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959016376] [2019-12-18 17:14:54,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:14:54,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:54,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:14:54,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:54,356 INFO L87 Difference]: Start difference. First operand 23727 states and 70357 transitions. Second operand 3 states. [2019-12-18 17:14:54,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:54,461 INFO L93 Difference]: Finished difference Result 23727 states and 70280 transitions. [2019-12-18 17:14:54,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:14:54,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 17:14:54,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:54,501 INFO L225 Difference]: With dead ends: 23727 [2019-12-18 17:14:54,501 INFO L226 Difference]: Without dead ends: 23727 [2019-12-18 17:14:54,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:54,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23727 states. [2019-12-18 17:14:54,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23727 to 19401. [2019-12-18 17:14:54,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19401 states. [2019-12-18 17:14:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19401 states to 19401 states and 58172 transitions. [2019-12-18 17:14:54,818 INFO L78 Accepts]: Start accepts. Automaton has 19401 states and 58172 transitions. Word has length 40 [2019-12-18 17:14:54,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:54,819 INFO L462 AbstractCegarLoop]: Abstraction has 19401 states and 58172 transitions. [2019-12-18 17:14:54,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:14:54,819 INFO L276 IsEmpty]: Start isEmpty. Operand 19401 states and 58172 transitions. [2019-12-18 17:14:54,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 17:14:54,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:54,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:54,838 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:54,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:54,838 INFO L82 PathProgramCache]: Analyzing trace with hash 88308807, now seen corresponding path program 1 times [2019-12-18 17:14:54,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:54,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132911760] [2019-12-18 17:14:54,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:54,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:14:54,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132911760] [2019-12-18 17:14:54,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:54,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:14:54,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826723850] [2019-12-18 17:14:54,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:14:54,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:54,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:14:54,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:14:54,885 INFO L87 Difference]: Start difference. First operand 19401 states and 58172 transitions. Second operand 5 states. [2019-12-18 17:14:54,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:54,984 INFO L93 Difference]: Finished difference Result 18184 states and 55553 transitions. [2019-12-18 17:14:54,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:14:54,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 17:14:54,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:55,017 INFO L225 Difference]: With dead ends: 18184 [2019-12-18 17:14:55,017 INFO L226 Difference]: Without dead ends: 18184 [2019-12-18 17:14:55,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:14:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18184 states. [2019-12-18 17:14:55,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18184 to 18184. [2019-12-18 17:14:55,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18184 states. [2019-12-18 17:14:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18184 states to 18184 states and 55553 transitions. [2019-12-18 17:14:55,494 INFO L78 Accepts]: Start accepts. Automaton has 18184 states and 55553 transitions. Word has length 41 [2019-12-18 17:14:55,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:55,495 INFO L462 AbstractCegarLoop]: Abstraction has 18184 states and 55553 transitions. [2019-12-18 17:14:55,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:14:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 18184 states and 55553 transitions. [2019-12-18 17:14:55,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:14:55,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:55,523 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:55,524 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:55,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:55,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1304450216, now seen corresponding path program 1 times [2019-12-18 17:14:55,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:55,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104415790] [2019-12-18 17:14:55,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:14:55,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104415790] [2019-12-18 17:14:55,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:55,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:14:55,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107715081] [2019-12-18 17:14:55,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:14:55,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:55,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:14:55,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:14:55,633 INFO L87 Difference]: Start difference. First operand 18184 states and 55553 transitions. Second operand 7 states. [2019-12-18 17:14:56,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:56,356 INFO L93 Difference]: Finished difference Result 50247 states and 151616 transitions. [2019-12-18 17:14:56,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:14:56,357 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 17:14:56,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:56,450 INFO L225 Difference]: With dead ends: 50247 [2019-12-18 17:14:56,450 INFO L226 Difference]: Without dead ends: 37910 [2019-12-18 17:14:56,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:14:56,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37910 states. [2019-12-18 17:14:57,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37910 to 21511. [2019-12-18 17:14:57,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21511 states. [2019-12-18 17:14:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21511 states to 21511 states and 65394 transitions. [2019-12-18 17:14:57,170 INFO L78 Accepts]: Start accepts. Automaton has 21511 states and 65394 transitions. Word has length 65 [2019-12-18 17:14:57,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:57,170 INFO L462 AbstractCegarLoop]: Abstraction has 21511 states and 65394 transitions. [2019-12-18 17:14:57,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:14:57,170 INFO L276 IsEmpty]: Start isEmpty. Operand 21511 states and 65394 transitions. [2019-12-18 17:14:57,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:14:57,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:57,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:57,191 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:57,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:57,191 INFO L82 PathProgramCache]: Analyzing trace with hash 365557572, now seen corresponding path program 2 times [2019-12-18 17:14:57,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:57,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998523268] [2019-12-18 17:14:57,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:14:57,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998523268] [2019-12-18 17:14:57,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:57,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:14:57,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070152957] [2019-12-18 17:14:57,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:14:57,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:57,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:14:57,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:14:57,274 INFO L87 Difference]: Start difference. First operand 21511 states and 65394 transitions. Second operand 7 states. [2019-12-18 17:14:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:57,793 INFO L93 Difference]: Finished difference Result 55830 states and 166918 transitions. [2019-12-18 17:14:57,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:14:57,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 17:14:57,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:57,848 INFO L225 Difference]: With dead ends: 55830 [2019-12-18 17:14:57,850 INFO L226 Difference]: Without dead ends: 40904 [2019-12-18 17:14:57,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:14:57,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40904 states. [2019-12-18 17:14:58,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40904 to 25412. [2019-12-18 17:14:58,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25412 states. [2019-12-18 17:14:58,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25412 states to 25412 states and 76768 transitions. [2019-12-18 17:14:58,380 INFO L78 Accepts]: Start accepts. Automaton has 25412 states and 76768 transitions. Word has length 65 [2019-12-18 17:14:58,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:58,380 INFO L462 AbstractCegarLoop]: Abstraction has 25412 states and 76768 transitions. [2019-12-18 17:14:58,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:14:58,381 INFO L276 IsEmpty]: Start isEmpty. Operand 25412 states and 76768 transitions. [2019-12-18 17:14:58,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:14:58,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:58,410 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:58,410 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:58,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:58,411 INFO L82 PathProgramCache]: Analyzing trace with hash -145794860, now seen corresponding path program 3 times [2019-12-18 17:14:58,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:58,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074749314] [2019-12-18 17:14:58,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:58,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:14:58,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074749314] [2019-12-18 17:14:58,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:58,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:14:58,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045802025] [2019-12-18 17:14:58,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:14:58,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:58,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:14:58,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:14:58,481 INFO L87 Difference]: Start difference. First operand 25412 states and 76768 transitions. Second operand 7 states. [2019-12-18 17:14:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:59,189 INFO L93 Difference]: Finished difference Result 48947 states and 145828 transitions. [2019-12-18 17:14:59,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 17:14:59,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 17:14:59,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:59,277 INFO L225 Difference]: With dead ends: 48947 [2019-12-18 17:14:59,277 INFO L226 Difference]: Without dead ends: 45034 [2019-12-18 17:14:59,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:14:59,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45034 states. [2019-12-18 17:14:59,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45034 to 25538. [2019-12-18 17:14:59,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25538 states. [2019-12-18 17:14:59,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25538 states to 25538 states and 77209 transitions. [2019-12-18 17:14:59,830 INFO L78 Accepts]: Start accepts. Automaton has 25538 states and 77209 transitions. Word has length 65 [2019-12-18 17:14:59,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:59,830 INFO L462 AbstractCegarLoop]: Abstraction has 25538 states and 77209 transitions. [2019-12-18 17:14:59,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:14:59,830 INFO L276 IsEmpty]: Start isEmpty. Operand 25538 states and 77209 transitions. [2019-12-18 17:14:59,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:14:59,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:59,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:59,865 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:59,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:59,866 INFO L82 PathProgramCache]: Analyzing trace with hash -156874998, now seen corresponding path program 4 times [2019-12-18 17:14:59,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:59,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393429072] [2019-12-18 17:14:59,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:59,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:14:59,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393429072] [2019-12-18 17:14:59,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:59,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:14:59,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244477650] [2019-12-18 17:14:59,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:14:59,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:59,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:14:59,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:59,918 INFO L87 Difference]: Start difference. First operand 25538 states and 77209 transitions. Second operand 3 states. [2019-12-18 17:15:00,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:00,083 INFO L93 Difference]: Finished difference Result 29013 states and 87993 transitions. [2019-12-18 17:15:00,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:15:00,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 17:15:00,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:00,126 INFO L225 Difference]: With dead ends: 29013 [2019-12-18 17:15:00,126 INFO L226 Difference]: Without dead ends: 29013 [2019-12-18 17:15:00,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:15:00,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29013 states. [2019-12-18 17:15:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29013 to 23876. [2019-12-18 17:15:00,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23876 states. [2019-12-18 17:15:00,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23876 states to 23876 states and 73099 transitions. [2019-12-18 17:15:00,533 INFO L78 Accepts]: Start accepts. Automaton has 23876 states and 73099 transitions. Word has length 65 [2019-12-18 17:15:00,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:00,533 INFO L462 AbstractCegarLoop]: Abstraction has 23876 states and 73099 transitions. [2019-12-18 17:15:00,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:15:00,534 INFO L276 IsEmpty]: Start isEmpty. Operand 23876 states and 73099 transitions. [2019-12-18 17:15:00,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:15:00,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:00,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:15:00,561 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:00,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:00,562 INFO L82 PathProgramCache]: Analyzing trace with hash -777729737, now seen corresponding path program 1 times [2019-12-18 17:15:00,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:00,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854780656] [2019-12-18 17:15:00,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:15:00,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854780656] [2019-12-18 17:15:00,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:00,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:15:00,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040357426] [2019-12-18 17:15:00,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:15:00,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:00,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:15:00,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:15:00,635 INFO L87 Difference]: Start difference. First operand 23876 states and 73099 transitions. Second operand 7 states. [2019-12-18 17:15:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:01,085 INFO L93 Difference]: Finished difference Result 50319 states and 152416 transitions. [2019-12-18 17:15:01,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 17:15:01,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 17:15:01,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:01,150 INFO L225 Difference]: With dead ends: 50319 [2019-12-18 17:15:01,150 INFO L226 Difference]: Without dead ends: 45490 [2019-12-18 17:15:01,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:15:01,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45490 states. [2019-12-18 17:15:01,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45490 to 24050. [2019-12-18 17:15:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24050 states. [2019-12-18 17:15:01,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24050 states to 24050 states and 73751 transitions. [2019-12-18 17:15:01,896 INFO L78 Accepts]: Start accepts. Automaton has 24050 states and 73751 transitions. Word has length 66 [2019-12-18 17:15:01,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:01,896 INFO L462 AbstractCegarLoop]: Abstraction has 24050 states and 73751 transitions. [2019-12-18 17:15:01,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:15:01,896 INFO L276 IsEmpty]: Start isEmpty. Operand 24050 states and 73751 transitions. [2019-12-18 17:15:01,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:15:01,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:01,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:15:01,923 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:01,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:01,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2128783339, now seen corresponding path program 2 times [2019-12-18 17:15:01,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:01,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496155847] [2019-12-18 17:15:01,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:15:01,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496155847] [2019-12-18 17:15:01,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:01,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:15:01,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074135469] [2019-12-18 17:15:01,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:15:01,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:01,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:15:01,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:15:01,989 INFO L87 Difference]: Start difference. First operand 24050 states and 73751 transitions. Second operand 4 states. [2019-12-18 17:15:02,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:02,139 INFO L93 Difference]: Finished difference Result 23832 states and 72874 transitions. [2019-12-18 17:15:02,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:15:02,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 17:15:02,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:02,171 INFO L225 Difference]: With dead ends: 23832 [2019-12-18 17:15:02,171 INFO L226 Difference]: Without dead ends: 23832 [2019-12-18 17:15:02,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:15:02,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23832 states. [2019-12-18 17:15:02,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23832 to 21655. [2019-12-18 17:15:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21655 states. [2019-12-18 17:15:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21655 states to 21655 states and 66392 transitions. [2019-12-18 17:15:02,525 INFO L78 Accepts]: Start accepts. Automaton has 21655 states and 66392 transitions. Word has length 66 [2019-12-18 17:15:02,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:02,525 INFO L462 AbstractCegarLoop]: Abstraction has 21655 states and 66392 transitions. [2019-12-18 17:15:02,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:15:02,525 INFO L276 IsEmpty]: Start isEmpty. Operand 21655 states and 66392 transitions. [2019-12-18 17:15:02,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:15:02,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:02,547 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:15:02,547 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:02,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:02,547 INFO L82 PathProgramCache]: Analyzing trace with hash 771503262, now seen corresponding path program 1 times [2019-12-18 17:15:02,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:02,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868671069] [2019-12-18 17:15:02,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:15:02,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868671069] [2019-12-18 17:15:02,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:02,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:15:02,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336472118] [2019-12-18 17:15:02,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:15:02,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:02,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:15:02,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:15:02,596 INFO L87 Difference]: Start difference. First operand 21655 states and 66392 transitions. Second operand 3 states. [2019-12-18 17:15:02,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:02,665 INFO L93 Difference]: Finished difference Result 15945 states and 48065 transitions. [2019-12-18 17:15:02,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:15:02,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 17:15:02,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:02,692 INFO L225 Difference]: With dead ends: 15945 [2019-12-18 17:15:02,692 INFO L226 Difference]: Without dead ends: 15945 [2019-12-18 17:15:02,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:15:02,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15945 states. [2019-12-18 17:15:02,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15945 to 14321. [2019-12-18 17:15:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14321 states. [2019-12-18 17:15:02,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14321 states to 14321 states and 43147 transitions. [2019-12-18 17:15:02,938 INFO L78 Accepts]: Start accepts. Automaton has 14321 states and 43147 transitions. Word has length 66 [2019-12-18 17:15:02,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:02,939 INFO L462 AbstractCegarLoop]: Abstraction has 14321 states and 43147 transitions. [2019-12-18 17:15:02,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:15:02,939 INFO L276 IsEmpty]: Start isEmpty. Operand 14321 states and 43147 transitions. [2019-12-18 17:15:02,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:15:02,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:02,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, 1, 1, 1, 1] [2019-12-18 17:15:02,954 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:02,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:02,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1509100091, now seen corresponding path program 1 times [2019-12-18 17:15:02,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:02,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396060008] [2019-12-18 17:15:02,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:03,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:15:03,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396060008] [2019-12-18 17:15:03,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:03,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:15:03,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577928967] [2019-12-18 17:15:03,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:15:03,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:03,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:15:03,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:15:03,116 INFO L87 Difference]: Start difference. First operand 14321 states and 43147 transitions. Second operand 11 states. [2019-12-18 17:15:04,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:04,249 INFO L93 Difference]: Finished difference Result 32485 states and 96620 transitions. [2019-12-18 17:15:04,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 17:15:04,249 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 17:15:04,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:04,284 INFO L225 Difference]: With dead ends: 32485 [2019-12-18 17:15:04,284 INFO L226 Difference]: Without dead ends: 24944 [2019-12-18 17:15:04,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=912, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 17:15:04,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24944 states. [2019-12-18 17:15:04,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24944 to 13865. [2019-12-18 17:15:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13865 states. [2019-12-18 17:15:04,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13865 states to 13865 states and 41455 transitions. [2019-12-18 17:15:04,750 INFO L78 Accepts]: Start accepts. Automaton has 13865 states and 41455 transitions. Word has length 67 [2019-12-18 17:15:04,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:04,750 INFO L462 AbstractCegarLoop]: Abstraction has 13865 states and 41455 transitions. [2019-12-18 17:15:04,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:15:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 13865 states and 41455 transitions. [2019-12-18 17:15:04,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:15:04,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:04,765 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:15:04,765 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:04,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:04,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1209104993, now seen corresponding path program 2 times [2019-12-18 17:15:04,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:04,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796795895] [2019-12-18 17:15:04,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:15:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:15:04,903 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:15:04,903 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:15:04,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= v_~a$w_buff0~0_303 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~__unbuffered_p2_EBX~0_46 0) (= v_~z~0_13 0) (= |v_#NULL.offset_7| 0) (= v_~a~0_199 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd2~0_205) (= v_~a$r_buff0_thd3~0_412 0) (= v_~weak$$choice2~0_126 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t913~0.base_30|)) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= v_~y~0_30 0) (= v_~a$r_buff1_thd3~0_326 0) (= v_~main$tmp_guard0~0_25 0) (= 0 v_~__unbuffered_cnt~0_83) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~a$w_buff1_used~0_450) (= (store .cse0 |v_ULTIMATE.start_main_~#t913~0.base_30| 1) |v_#valid_67|) (= 0 |v_ULTIMATE.start_main_~#t913~0.offset_22|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t913~0.base_30|) (= 0 v_~__unbuffered_p0_EAX~0_159) (= v_~a$flush_delayed~0_27 0) (= 0 v_~a$r_buff1_thd2~0_197) (= v_~a$mem_tmp~0_16 0) (= v_~main$tmp_guard1~0_32 0) (= 0 |v_#NULL.base_7|) (= 0 v_~a$r_buff1_thd1~0_190) (= v_~a$r_buff1_thd0~0_208 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t913~0.base_30| 4)) (= 0 v_~x~0_153) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t913~0.base_30| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t913~0.base_30|) |v_ULTIMATE.start_main_~#t913~0.offset_22| 0)) |v_#memory_int_19|) (= 0 v_~a$w_buff1~0_206) (= 0 v_~a$r_buff0_thd1~0_334) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~a$r_buff0_thd0~0_214 0) (= 0 v_~weak$$choice0~0_13) (= 0 v_~a$w_buff0_used~0_788))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_197, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_53|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_53|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_214, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_33|, ~a~0=v_~a~0_199, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_46, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_326, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_788, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_334, ULTIMATE.start_main_~#t914~0.base=|v_ULTIMATE.start_main_~#t914~0.base_23|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_303, ULTIMATE.start_main_~#t913~0.base=|v_ULTIMATE.start_main_~#t913~0.base_30|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_208, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~x~0=v_~x~0_153, ~a$read_delayed~0=v_~a$read_delayed~0_7, ULTIMATE.start_main_~#t915~0.base=|v_ULTIMATE.start_main_~#t915~0.base_15|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_79|, ULTIMATE.start_main_~#t915~0.offset=|v_ULTIMATE.start_main_~#t915~0.offset_13|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_206, ~y~0=v_~y~0_30, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_190, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_412, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ULTIMATE.start_main_~#t913~0.offset=|v_ULTIMATE.start_main_~#t913~0.offset_22|, #NULL.base=|v_#NULL.base_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t914~0.offset=|v_ULTIMATE.start_main_~#t914~0.offset_17|, ~z~0=v_~z~0_13, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_450, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t914~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ULTIMATE.start_main_~#t913~0.base, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ULTIMATE.start_main_~#t915~0.base, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t915~0.offset, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t913~0.offset, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t914~0.offset, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 17:15:04,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L750: Formula: (and (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-636706115)) (= ~a$r_buff1_thd0~0_Out-636706115 ~a$r_buff0_thd0~0_In-636706115) (= ~a$r_buff0_thd2~0_In-636706115 ~a$r_buff1_thd2~0_Out-636706115) (= ~x~0_In-636706115 ~__unbuffered_p0_EAX~0_Out-636706115) (= ~a$r_buff0_thd1~0_In-636706115 ~a$r_buff1_thd1~0_Out-636706115) (= 1 ~a$r_buff0_thd1~0_Out-636706115) (= ~a$r_buff0_thd3~0_In-636706115 ~a$r_buff1_thd3~0_Out-636706115)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-636706115, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-636706115, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-636706115, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-636706115, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-636706115, ~x~0=~x~0_In-636706115} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-636706115, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-636706115, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-636706115, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-636706115, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-636706115, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-636706115, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-636706115, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-636706115, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-636706115, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-636706115, ~x~0=~x~0_In-636706115} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:15:04,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L832-1-->L834: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t914~0.offset_10|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t914~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t914~0.base_11|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t914~0.base_11| 1)) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t914~0.base_11|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t914~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t914~0.base_11|) |v_ULTIMATE.start_main_~#t914~0.offset_10| 1)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t914~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t914~0.offset=|v_ULTIMATE.start_main_~#t914~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t914~0.base=|v_ULTIMATE.start_main_~#t914~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t914~0.offset, #length, ULTIMATE.start_main_~#t914~0.base] because there is no mapped edge [2019-12-18 17:15:04,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L834-1-->L836: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t915~0.offset_10|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t915~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t915~0.base_11|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t915~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t915~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t915~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t915~0.base_11|) |v_ULTIMATE.start_main_~#t915~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t915~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_~#t915~0.base=|v_ULTIMATE.start_main_~#t915~0.base_11|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t915~0.offset=|v_ULTIMATE.start_main_~#t915~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t915~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t915~0.offset] because there is no mapped edge [2019-12-18 17:15:04,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L770-2-->L770-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1380529857 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1380529857 256) 0))) (or (and (= ~a$w_buff1~0_In-1380529857 |P1Thread1of1ForFork2_#t~ite9_Out-1380529857|) (not .cse0) (not .cse1)) (and (= ~a~0_In-1380529857 |P1Thread1of1ForFork2_#t~ite9_Out-1380529857|) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In-1380529857, ~a$w_buff1~0=~a$w_buff1~0_In-1380529857, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1380529857, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1380529857} OutVars{~a~0=~a~0_In-1380529857, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1380529857|, ~a$w_buff1~0=~a$w_buff1~0_In-1380529857, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1380529857, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1380529857} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 17:15:04,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L770-4-->L771: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_30| v_~a~0_66) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_30|} OutVars{~a~0=v_~a~0_66, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_29|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_43|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 17:15:04,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In625021499 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In625021499 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out625021499| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out625021499| ~a$w_buff0_used~0_In625021499) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In625021499, ~a$w_buff0_used~0=~a$w_buff0_used~0_In625021499} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In625021499, ~a$w_buff0_used~0=~a$w_buff0_used~0_In625021499, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out625021499|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 17:15:04,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-757357515 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-757357515 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In-757357515 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-757357515 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-757357515|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-757357515 |P1Thread1of1ForFork2_#t~ite12_Out-757357515|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-757357515, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-757357515, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-757357515, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-757357515} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-757357515, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-757357515, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-757357515, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-757357515|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-757357515} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 17:15:04,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1998918292 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1998918292 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1998918292|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In-1998918292 |P1Thread1of1ForFork2_#t~ite13_Out-1998918292|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1998918292, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1998918292} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1998918292, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1998918292, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1998918292|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 17:15:04,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In259979097 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In259979097 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In259979097 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In259979097 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out259979097|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite14_Out259979097| ~a$r_buff1_thd2~0_In259979097) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In259979097, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In259979097, ~a$w_buff0_used~0=~a$w_buff0_used~0_In259979097, ~a$w_buff1_used~0=~a$w_buff1_used~0_In259979097} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In259979097, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In259979097, ~a$w_buff0_used~0=~a$w_buff0_used~0_In259979097, ~a$w_buff1_used~0=~a$w_buff1_used~0_In259979097, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out259979097|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 17:15:04,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L774-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_24| v_~a$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_24|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_23|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 17:15:04,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-286378243 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-286378243 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-286378243 |P0Thread1of1ForFork1_#t~ite5_Out-286378243|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-286378243|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-286378243, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-286378243} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-286378243|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-286378243, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-286378243} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 17:15:04,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-1761753468 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In-1761753468 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-1761753468 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1761753468 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1761753468|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In-1761753468 |P0Thread1of1ForFork1_#t~ite6_Out-1761753468|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1761753468, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1761753468, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1761753468, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1761753468} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1761753468|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1761753468, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1761753468, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1761753468, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1761753468} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 17:15:04,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L753-->L754: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1206737718 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1206737718 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In-1206737718 ~a$r_buff0_thd1~0_Out-1206737718)) (and (not .cse1) (= ~a$r_buff0_thd1~0_Out-1206737718 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1206737718, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1206737718} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1206737718|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1206737718, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1206737718} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:15:04,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L754-->L754-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd1~0_In1908226983 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1908226983 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1908226983 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In1908226983 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd1~0_In1908226983 |P0Thread1of1ForFork1_#t~ite8_Out1908226983|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1908226983|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1908226983, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1908226983, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1908226983, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1908226983} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1908226983|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1908226983, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1908226983, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1908226983, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1908226983} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 17:15:04,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L754-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~a$r_buff1_thd1~0_87 |v_P0Thread1of1ForFork1_#t~ite8_38|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_37|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_87, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 17:15:04,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1052830550 256) 0))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-1052830550 256) 0))) (or (and .cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-1052830550 256))) (and .cse0 (= (mod ~a$w_buff1_used~0_In-1052830550 256) 0)) (= (mod ~a$w_buff0_used~0_In-1052830550 256) 0))) (= |P2Thread1of1ForFork0_#t~ite29_Out-1052830550| |P2Thread1of1ForFork0_#t~ite30_Out-1052830550|) .cse1 (= |P2Thread1of1ForFork0_#t~ite29_Out-1052830550| ~a$w_buff1_used~0_In-1052830550)) (and (= |P2Thread1of1ForFork0_#t~ite29_In-1052830550| |P2Thread1of1ForFork0_#t~ite29_Out-1052830550|) (= |P2Thread1of1ForFork0_#t~ite30_Out-1052830550| ~a$w_buff1_used~0_In-1052830550) (not .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1052830550, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1052830550, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1052830550, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1052830550, ~weak$$choice2~0=~weak$$choice2~0_In-1052830550, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1052830550|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1052830550, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1052830550, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1052830550, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1052830550, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1052830550|, ~weak$$choice2~0=~weak$$choice2~0_In-1052830550, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1052830550|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 17:15:04,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~a$r_buff0_thd3~0_66 v_~a$r_buff0_thd3~0_65)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 17:15:04,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-->L809: Formula: (and (= v_~a$flush_delayed~0_11 0) (= v_~a~0_48 v_~a$mem_tmp~0_5) (not (= (mod v_~a$flush_delayed~0_12 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_11} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 17:15:04,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L809-2-->L809-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-888361617 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd3~0_In-888361617 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-888361617| ~a~0_In-888361617) (or .cse0 .cse1)) (and (= ~a$w_buff1~0_In-888361617 |P2Thread1of1ForFork0_#t~ite38_Out-888361617|) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In-888361617, ~a$w_buff1~0=~a$w_buff1~0_In-888361617, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-888361617, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-888361617} OutVars{~a~0=~a~0_In-888361617, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-888361617|, ~a$w_buff1~0=~a$w_buff1~0_In-888361617, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-888361617, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-888361617} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 17:15:04,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-4-->L810: Formula: (= v_~a~0_37 |v_P2Thread1of1ForFork0_#t~ite38_14|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_14|} OutVars{~a~0=v_~a~0_37, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_13|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 17:15:04,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1703191810 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1703191810 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-1703191810| 0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-1703191810| ~a$w_buff0_used~0_In-1703191810) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1703191810, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1703191810} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1703191810|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1703191810, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1703191810} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 17:15:04,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In370537011 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In370537011 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In370537011 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In370537011 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out370537011|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~a$w_buff1_used~0_In370537011 |P2Thread1of1ForFork0_#t~ite41_Out370537011|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In370537011, ~a$w_buff0_used~0=~a$w_buff0_used~0_In370537011, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In370537011, ~a$w_buff1_used~0=~a$w_buff1_used~0_In370537011} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In370537011, ~a$w_buff0_used~0=~a$w_buff0_used~0_In370537011, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In370537011, ~a$w_buff1_used~0=~a$w_buff1_used~0_In370537011, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out370537011|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 17:15:04,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1737064731 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1737064731 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1737064731| ~a$r_buff0_thd3~0_In-1737064731)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1737064731|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1737064731, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1737064731} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1737064731, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1737064731, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1737064731|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 17:15:04,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L813-->L813-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd3~0_In-777619532 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-777619532 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd3~0_In-777619532 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-777619532 256) 0))) (or (and (= ~a$r_buff1_thd3~0_In-777619532 |P2Thread1of1ForFork0_#t~ite43_Out-777619532|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-777619532|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-777619532, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-777619532, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-777619532, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-777619532} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-777619532|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-777619532, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-777619532, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-777619532, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-777619532} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 17:15:04,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 17:15:04,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:15:04,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L842-2-->L842-5: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1447123039 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-1447123039 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite48_Out-1447123039| |ULTIMATE.start_main_#t~ite47_Out-1447123039|))) (or (and (not .cse0) (= ~a$w_buff1~0_In-1447123039 |ULTIMATE.start_main_#t~ite47_Out-1447123039|) .cse1 (not .cse2)) (and (or .cse0 .cse2) .cse1 (= ~a~0_In-1447123039 |ULTIMATE.start_main_#t~ite47_Out-1447123039|)))) InVars {~a~0=~a~0_In-1447123039, ~a$w_buff1~0=~a$w_buff1~0_In-1447123039, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1447123039, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1447123039} OutVars{~a~0=~a~0_In-1447123039, ~a$w_buff1~0=~a$w_buff1~0_In-1447123039, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1447123039|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1447123039, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1447123039|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1447123039} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 17:15:04,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In1527983925 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1527983925 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1527983925| 0)) (and (= |ULTIMATE.start_main_#t~ite49_Out1527983925| ~a$w_buff0_used~0_In1527983925) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1527983925, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1527983925} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1527983925, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1527983925|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1527983925} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 17:15:04,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L844-->L844-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In651792460 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd0~0_In651792460 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In651792460 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In651792460 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out651792460|)) (and (= ~a$w_buff1_used~0_In651792460 |ULTIMATE.start_main_#t~ite50_Out651792460|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In651792460, ~a$w_buff0_used~0=~a$w_buff0_used~0_In651792460, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In651792460, ~a$w_buff1_used~0=~a$w_buff1_used~0_In651792460} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out651792460|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In651792460, ~a$w_buff0_used~0=~a$w_buff0_used~0_In651792460, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In651792460, ~a$w_buff1_used~0=~a$w_buff1_used~0_In651792460} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 17:15:04,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L845-->L845-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1452907073 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1452907073 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-1452907073 |ULTIMATE.start_main_#t~ite51_Out-1452907073|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-1452907073| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1452907073, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1452907073} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1452907073|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1452907073, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1452907073} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 17:15:04,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L846-->L846-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In1469554035 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In1469554035 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1469554035 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1469554035 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out1469554035| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite52_Out1469554035| ~a$r_buff1_thd0~0_In1469554035) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1469554035, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1469554035, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1469554035, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1469554035} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1469554035|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1469554035, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1469554035, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1469554035, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1469554035} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 17:15:04,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= v_~main$tmp_guard1~0_17 0) (= v_~__unbuffered_p2_EBX~0_32 0) (= 1 v_~__unbuffered_p2_EAX~0_21) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~a$r_buff1_thd0~0_170 |v_ULTIMATE.start_main_#t~ite52_39|) (= 0 v_~__unbuffered_p0_EAX~0_128)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:15:05,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:15:05 BasicIcfg [2019-12-18 17:15:05,052 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:15:05,053 INFO L168 Benchmark]: Toolchain (without parser) took 90463.85 ms. Allocated memory was 138.4 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 101.3 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 17:15:05,054 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 17:15:05,054 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.62 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.9 MB in the beginning and 156.1 MB in the end (delta: -55.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:15:05,055 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.33 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:15:05,055 INFO L168 Benchmark]: Boogie Preprocessor took 37.63 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:15:05,056 INFO L168 Benchmark]: RCFGBuilder took 805.29 ms. Allocated memory is still 202.9 MB. Free memory was 150.8 MB in the beginning and 100.4 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-18 17:15:05,056 INFO L168 Benchmark]: TraceAbstraction took 88780.59 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.4 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 17:15:05,059 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.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 749.62 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.9 MB in the beginning and 156.1 MB in the end (delta: -55.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 85.33 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.63 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 805.29 ms. Allocated memory is still 202.9 MB. Free memory was 150.8 MB in the beginning and 100.4 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88780.59 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.4 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 178 ProgramPointsBefore, 94 ProgramPointsAfterwards, 215 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 31 ChoiceCompositions, 7408 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 42 SemBasedMoverChecksPositive, 283 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 83880 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t913, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t914, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L772] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L773] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L836] FCALL, FORK 0 pthread_create(&t915, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 3 y = 1 [L787] 3 z = 1 [L790] 3 __unbuffered_p2_EAX = z [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 a$flush_delayed = weak$$choice2 [L796] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L798] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L798] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L799] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L800] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L800] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L801] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L803] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L809] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L810] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L811] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L812] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L842] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L842] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L843] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L844] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L845] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 88.4s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 24.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5671 SDtfs, 5277 SDslu, 14782 SDs, 0 SdLazy, 5250 SolverSat, 151 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 36 SyntacticMatches, 19 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155174occurred 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: 37.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 202182 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1045 NumberOfCodeBlocks, 1045 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 952 ConstructedInterpolants, 0 QuantifiedInterpolants, 153592 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...