/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/safe024_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:54:48,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:54:48,264 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:54:48,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:54:48,283 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:54:48,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:54:48,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:54:48,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:54:48,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:54:48,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:54:48,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:54:48,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:54:48,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:54:48,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:54:48,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:54:48,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:54:48,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:54:48,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:54:48,318 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:54:48,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:54:48,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:54:48,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:54:48,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:54:48,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:54:48,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:54:48,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:54:48,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:54:48,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:54:48,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:54:48,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:54:48,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:54:48,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:54:48,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:54:48,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:54:48,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:54:48,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:54:48,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:54:48,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:54:48,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:54:48,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:54:48,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:54:48,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 18:54:48,382 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:54:48,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:54:48,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:54:48,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:54:48,389 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:54:48,389 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:54:48,389 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:54:48,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:54:48,390 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:54:48,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:54:48,390 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:54:48,390 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:54:48,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:54:48,392 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:54:48,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:54:48,392 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:54:48,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:54:48,392 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:54:48,393 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:54:48,393 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:54:48,393 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:54:48,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:54:48,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:54:48,394 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:54:48,394 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:54:48,394 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:54:48,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:54:48,394 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:54:48,395 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:54:48,670 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:54:48,683 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:54:48,686 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:54:48,687 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:54:48,688 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:54:48,688 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_rmo.oepc.i [2019-12-18 18:54:48,761 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e437758c4/cd2b84381268488ba8116d0f6c35baf3/FLAGb9ab672e2 [2019-12-18 18:54:49,340 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:54:49,341 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_rmo.oepc.i [2019-12-18 18:54:49,369 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e437758c4/cd2b84381268488ba8116d0f6c35baf3/FLAGb9ab672e2 [2019-12-18 18:54:49,615 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e437758c4/cd2b84381268488ba8116d0f6c35baf3 [2019-12-18 18:54:49,624 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:54:49,626 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:54:49,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:54:49,627 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:54:49,631 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:54:49,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:54:49" (1/1) ... [2019-12-18 18:54:49,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@335b3638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:54:49, skipping insertion in model container [2019-12-18 18:54:49,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:54:49" (1/1) ... [2019-12-18 18:54:49,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:54:49,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:54:50,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:54:50,216 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:54:50,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:54:50,375 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:54:50,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:54:50 WrapperNode [2019-12-18 18:54:50,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:54:50,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:54:50,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:54:50,377 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:54:50,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:54:50" (1/1) ... [2019-12-18 18:54:50,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:54:50" (1/1) ... [2019-12-18 18:54:50,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:54:50,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:54:50,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:54:50,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:54:50,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:54:50" (1/1) ... [2019-12-18 18:54:50,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:54:50" (1/1) ... [2019-12-18 18:54:50,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:54:50" (1/1) ... [2019-12-18 18:54:50,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:54:50" (1/1) ... [2019-12-18 18:54:50,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:54:50" (1/1) ... [2019-12-18 18:54:50,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:54:50" (1/1) ... [2019-12-18 18:54:50,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:54:50" (1/1) ... [2019-12-18 18:54:50,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:54:50,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:54:50,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:54:50,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:54:50,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:54:50" (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 18:54:50,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:54:50,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:54:50,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:54:50,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:54:50,565 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:54:50,565 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:54:50,566 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:54:50,566 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:54:50,566 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 18:54:50,566 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 18:54:50,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:54:50,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:54:50,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:54:50,568 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 18:54:51,375 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:54:51,375 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:54:51,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:54:51 BoogieIcfgContainer [2019-12-18 18:54:51,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:54:51,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:54:51,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:54:51,382 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:54:51,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:54:49" (1/3) ... [2019-12-18 18:54:51,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d42d00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:54:51, skipping insertion in model container [2019-12-18 18:54:51,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:54:50" (2/3) ... [2019-12-18 18:54:51,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d42d00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:54:51, skipping insertion in model container [2019-12-18 18:54:51,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:54:51" (3/3) ... [2019-12-18 18:54:51,386 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_rmo.oepc.i [2019-12-18 18:54:51,395 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:54:51,395 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:54:51,403 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:54:51,403 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:54:51,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,444 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,444 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,469 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,469 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,469 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,470 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,470 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,495 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,495 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,504 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,504 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,504 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,510 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,510 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,514 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,515 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:54:51,534 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 18:54:51,555 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:54:51,555 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:54:51,555 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:54:51,556 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:54:51,556 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:54:51,556 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:54:51,556 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:54:51,556 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:54:51,574 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 18:54:51,576 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 18:54:51,662 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 18:54:51,662 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:54:51,683 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 18:54:51,712 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 18:54:51,758 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 18:54:51,758 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:54:51,766 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 18:54:51,786 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 18:54:51,787 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:54:55,711 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2019-12-18 18:54:57,512 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 18:54:57,643 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 18:54:57,672 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-18 18:54:57,672 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 18:54:57,676 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-18 18:55:09,680 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-18 18:55:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-18 18:55:09,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 18:55:09,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:09,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 18:55:09,690 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:09,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:09,697 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-18 18:55:09,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:09,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843842006] [2019-12-18 18:55:09,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:09,955 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 18:55:09,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843842006] [2019-12-18 18:55:09,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:09,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:55:09,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206371594] [2019-12-18 18:55:09,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:55:09,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:09,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:55:09,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:55:09,984 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-18 18:55:12,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:12,788 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-18 18:55:12,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:55:12,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 18:55:12,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:13,366 INFO L225 Difference]: With dead ends: 87834 [2019-12-18 18:55:13,367 INFO L226 Difference]: Without dead ends: 82738 [2019-12-18 18:55:13,368 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 18:55:18,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-18 18:55:20,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-18 18:55:20,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-18 18:55:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-18 18:55:24,696 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-18 18:55:24,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:24,697 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-18 18:55:24,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:55:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-18 18:55:24,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:55:24,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:24,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:55:24,712 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:24,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:24,713 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-18 18:55:24,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:24,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4909692] [2019-12-18 18:55:24,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:24,882 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 18:55:24,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4909692] [2019-12-18 18:55:24,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:24,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:55:24,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557681884] [2019-12-18 18:55:24,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:55:24,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:24,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:55:24,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:55:24,886 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-18 18:55:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:25,923 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-18 18:55:25,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:55:25,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 18:55:25,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:27,431 INFO L225 Difference]: With dead ends: 127286 [2019-12-18 18:55:27,431 INFO L226 Difference]: Without dead ends: 127202 [2019-12-18 18:55:27,432 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 18:55:34,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-18 18:55:37,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-18 18:55:37,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-18 18:55:37,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-18 18:55:37,669 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-18 18:55:37,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:37,671 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-18 18:55:37,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:55:37,671 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-18 18:55:37,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:55:37,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:37,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:55:37,676 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:37,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:37,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-18 18:55:37,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:37,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860121974] [2019-12-18 18:55:37,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:37,736 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 18:55:37,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860121974] [2019-12-18 18:55:37,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:37,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:55:37,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621295546] [2019-12-18 18:55:37,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:55:37,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:37,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:55:37,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:55:37,741 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-18 18:55:37,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:37,864 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-18 18:55:37,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:55:37,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 18:55:37,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:37,914 INFO L225 Difference]: With dead ends: 28492 [2019-12-18 18:55:37,914 INFO L226 Difference]: Without dead ends: 28492 [2019-12-18 18:55:37,915 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 18:55:38,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-18 18:55:42,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-18 18:55:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-18 18:55:42,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-18 18:55:42,326 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-18 18:55:42,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:42,327 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-18 18:55:42,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:55:42,327 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-18 18:55:42,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:55:42,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:42,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:55:42,330 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:42,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:42,331 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-18 18:55:42,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:42,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935622366] [2019-12-18 18:55:42,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:42,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:55:42,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935622366] [2019-12-18 18:55:42,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:42,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:55:42,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021238550] [2019-12-18 18:55:42,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:55:42,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:42,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:55:42,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:55:42,433 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-18 18:55:42,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:42,918 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-18 18:55:42,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:55:42,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 18:55:42,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:42,992 INFO L225 Difference]: With dead ends: 41156 [2019-12-18 18:55:42,992 INFO L226 Difference]: Without dead ends: 41141 [2019-12-18 18:55:42,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:55:43,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-18 18:55:43,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-18 18:55:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-18 18:55:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-18 18:55:43,621 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-18 18:55:43,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:43,622 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-18 18:55:43,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:55:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-18 18:55:43,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 18:55:43,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:43,631 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 18:55:43,632 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:43,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:43,632 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-18 18:55:43,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:43,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453581554] [2019-12-18 18:55:43,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:43,790 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 18:55:43,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453581554] [2019-12-18 18:55:43,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:43,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:55:43,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728118932] [2019-12-18 18:55:43,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:55:43,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:43,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:55:43,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:55:43,792 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 6 states. [2019-12-18 18:55:44,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:44,958 INFO L93 Difference]: Finished difference Result 48363 states and 157775 transitions. [2019-12-18 18:55:44,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:55:44,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 18:55:44,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:45,046 INFO L225 Difference]: With dead ends: 48363 [2019-12-18 18:55:45,046 INFO L226 Difference]: Without dead ends: 48336 [2019-12-18 18:55:45,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:55:45,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-18 18:55:45,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 33272. [2019-12-18 18:55:45,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2019-12-18 18:55:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 109841 transitions. [2019-12-18 18:55:45,726 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 109841 transitions. Word has length 22 [2019-12-18 18:55:45,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:45,726 INFO L462 AbstractCegarLoop]: Abstraction has 33272 states and 109841 transitions. [2019-12-18 18:55:45,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:55:45,726 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 109841 transitions. [2019-12-18 18:55:45,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:55:45,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:45,743 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 18:55:45,743 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:45,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:45,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-18 18:55:45,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:45,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838520730] [2019-12-18 18:55:45,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:45,788 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 18:55:45,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838520730] [2019-12-18 18:55:45,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:45,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:55:45,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792374612] [2019-12-18 18:55:45,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:55:45,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:45,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:55:45,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:55:45,791 INFO L87 Difference]: Start difference. First operand 33272 states and 109841 transitions. Second operand 4 states. [2019-12-18 18:55:45,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:45,861 INFO L93 Difference]: Finished difference Result 12861 states and 39176 transitions. [2019-12-18 18:55:45,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:55:45,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 18:55:45,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:45,879 INFO L225 Difference]: With dead ends: 12861 [2019-12-18 18:55:45,880 INFO L226 Difference]: Without dead ends: 12861 [2019-12-18 18:55:45,880 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 18:55:45,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-12-18 18:55:46,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12721. [2019-12-18 18:55:46,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12721 states. [2019-12-18 18:55:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12721 states to 12721 states and 38766 transitions. [2019-12-18 18:55:46,321 INFO L78 Accepts]: Start accepts. Automaton has 12721 states and 38766 transitions. Word has length 25 [2019-12-18 18:55:46,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:46,321 INFO L462 AbstractCegarLoop]: Abstraction has 12721 states and 38766 transitions. [2019-12-18 18:55:46,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:55:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 12721 states and 38766 transitions. [2019-12-18 18:55:46,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 18:55:46,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:46,339 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 18:55:46,340 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:46,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:46,340 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-18 18:55:46,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:46,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421274719] [2019-12-18 18:55:46,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:46,409 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 18:55:46,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421274719] [2019-12-18 18:55:46,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:46,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:55:46,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457008773] [2019-12-18 18:55:46,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:55:46,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:46,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:55:46,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:55:46,411 INFO L87 Difference]: Start difference. First operand 12721 states and 38766 transitions. Second operand 5 states. [2019-12-18 18:55:46,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:46,486 INFO L93 Difference]: Finished difference Result 11425 states and 35436 transitions. [2019-12-18 18:55:46,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:55:46,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 18:55:46,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:46,502 INFO L225 Difference]: With dead ends: 11425 [2019-12-18 18:55:46,502 INFO L226 Difference]: Without dead ends: 11425 [2019-12-18 18:55:46,502 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 18:55:46,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11425 states. [2019-12-18 18:55:46,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11425 to 10977. [2019-12-18 18:55:46,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10977 states. [2019-12-18 18:55:46,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10977 states to 10977 states and 34172 transitions. [2019-12-18 18:55:46,670 INFO L78 Accepts]: Start accepts. Automaton has 10977 states and 34172 transitions. Word has length 39 [2019-12-18 18:55:46,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:46,670 INFO L462 AbstractCegarLoop]: Abstraction has 10977 states and 34172 transitions. [2019-12-18 18:55:46,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:55:46,671 INFO L276 IsEmpty]: Start isEmpty. Operand 10977 states and 34172 transitions. [2019-12-18 18:55:46,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:55:46,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:46,690 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] [2019-12-18 18:55:46,690 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:46,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:46,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1179829373, now seen corresponding path program 1 times [2019-12-18 18:55:46,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:46,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37651984] [2019-12-18 18:55:46,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:55:46,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37651984] [2019-12-18 18:55:46,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:46,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:55:46,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242254285] [2019-12-18 18:55:46,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:55:46,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:46,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:55:46,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:55:46,774 INFO L87 Difference]: Start difference. First operand 10977 states and 34172 transitions. Second operand 4 states. [2019-12-18 18:55:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:46,849 INFO L93 Difference]: Finished difference Result 20009 states and 62260 transitions. [2019-12-18 18:55:46,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:55:46,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-18 18:55:46,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:46,865 INFO L225 Difference]: With dead ends: 20009 [2019-12-18 18:55:46,865 INFO L226 Difference]: Without dead ends: 9365 [2019-12-18 18:55:46,865 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 18:55:46,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9365 states. [2019-12-18 18:55:46,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9365 to 9365. [2019-12-18 18:55:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9365 states. [2019-12-18 18:55:47,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9365 states to 9365 states and 29013 transitions. [2019-12-18 18:55:47,005 INFO L78 Accepts]: Start accepts. Automaton has 9365 states and 29013 transitions. Word has length 53 [2019-12-18 18:55:47,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:47,006 INFO L462 AbstractCegarLoop]: Abstraction has 9365 states and 29013 transitions. [2019-12-18 18:55:47,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:55:47,006 INFO L276 IsEmpty]: Start isEmpty. Operand 9365 states and 29013 transitions. [2019-12-18 18:55:47,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:55:47,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:47,020 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] [2019-12-18 18:55:47,020 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:47,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:47,021 INFO L82 PathProgramCache]: Analyzing trace with hash 383407097, now seen corresponding path program 2 times [2019-12-18 18:55:47,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:47,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9563615] [2019-12-18 18:55:47,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:47,134 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 18:55:47,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9563615] [2019-12-18 18:55:47,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:47,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:55:47,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408619782] [2019-12-18 18:55:47,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:55:47,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:47,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:55:47,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:55:47,138 INFO L87 Difference]: Start difference. First operand 9365 states and 29013 transitions. Second operand 7 states. [2019-12-18 18:55:47,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:47,509 INFO L93 Difference]: Finished difference Result 23182 states and 71788 transitions. [2019-12-18 18:55:47,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:55:47,509 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 18:55:47,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:47,536 INFO L225 Difference]: With dead ends: 23182 [2019-12-18 18:55:47,536 INFO L226 Difference]: Without dead ends: 18276 [2019-12-18 18:55:47,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:55:47,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18276 states. [2019-12-18 18:55:47,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18276 to 11162. [2019-12-18 18:55:47,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11162 states. [2019-12-18 18:55:47,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11162 states to 11162 states and 34879 transitions. [2019-12-18 18:55:47,759 INFO L78 Accepts]: Start accepts. Automaton has 11162 states and 34879 transitions. Word has length 53 [2019-12-18 18:55:47,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:47,759 INFO L462 AbstractCegarLoop]: Abstraction has 11162 states and 34879 transitions. [2019-12-18 18:55:47,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:55:47,759 INFO L276 IsEmpty]: Start isEmpty. Operand 11162 states and 34879 transitions. [2019-12-18 18:55:47,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:55:47,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:47,775 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:55:47,775 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:47,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:47,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1401815865, now seen corresponding path program 3 times [2019-12-18 18:55:47,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:47,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158999776] [2019-12-18 18:55:47,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:47,868 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 18:55:47,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158999776] [2019-12-18 18:55:47,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:47,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:55:47,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158155080] [2019-12-18 18:55:47,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:55:47,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:47,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:55:47,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:55:47,870 INFO L87 Difference]: Start difference. First operand 11162 states and 34879 transitions. Second operand 7 states. [2019-12-18 18:55:48,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:48,268 INFO L93 Difference]: Finished difference Result 27840 states and 85084 transitions. [2019-12-18 18:55:48,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:55:48,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 18:55:48,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:48,455 INFO L225 Difference]: With dead ends: 27840 [2019-12-18 18:55:48,456 INFO L226 Difference]: Without dead ends: 19924 [2019-12-18 18:55:48,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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 18:55:48,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19924 states. [2019-12-18 18:55:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19924 to 13020. [2019-12-18 18:55:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13020 states. [2019-12-18 18:55:48,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13020 states to 13020 states and 40574 transitions. [2019-12-18 18:55:48,696 INFO L78 Accepts]: Start accepts. Automaton has 13020 states and 40574 transitions. Word has length 53 [2019-12-18 18:55:48,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:48,696 INFO L462 AbstractCegarLoop]: Abstraction has 13020 states and 40574 transitions. [2019-12-18 18:55:48,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:55:48,697 INFO L276 IsEmpty]: Start isEmpty. Operand 13020 states and 40574 transitions. [2019-12-18 18:55:48,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:55:48,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:48,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:55:48,716 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:48,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:48,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1901485579, now seen corresponding path program 4 times [2019-12-18 18:55:48,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:48,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624627541] [2019-12-18 18:55:48,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:48,800 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 18:55:48,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624627541] [2019-12-18 18:55:48,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:48,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:55:48,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157883353] [2019-12-18 18:55:48,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:55:48,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:48,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:55:48,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:55:48,802 INFO L87 Difference]: Start difference. First operand 13020 states and 40574 transitions. Second operand 7 states. [2019-12-18 18:55:49,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:49,259 INFO L93 Difference]: Finished difference Result 25803 states and 80188 transitions. [2019-12-18 18:55:49,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:55:49,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 18:55:49,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:49,294 INFO L225 Difference]: With dead ends: 25803 [2019-12-18 18:55:49,295 INFO L226 Difference]: Without dead ends: 23832 [2019-12-18 18:55:49,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:55:49,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23832 states. [2019-12-18 18:55:49,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23832 to 13086. [2019-12-18 18:55:49,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13086 states. [2019-12-18 18:55:49,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13086 states to 13086 states and 40859 transitions. [2019-12-18 18:55:49,569 INFO L78 Accepts]: Start accepts. Automaton has 13086 states and 40859 transitions. Word has length 53 [2019-12-18 18:55:49,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:49,569 INFO L462 AbstractCegarLoop]: Abstraction has 13086 states and 40859 transitions. [2019-12-18 18:55:49,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:55:49,569 INFO L276 IsEmpty]: Start isEmpty. Operand 13086 states and 40859 transitions. [2019-12-18 18:55:49,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:55:49,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:49,585 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] [2019-12-18 18:55:49,585 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:49,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:49,585 INFO L82 PathProgramCache]: Analyzing trace with hash -9451933, now seen corresponding path program 1 times [2019-12-18 18:55:49,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:49,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102934275] [2019-12-18 18:55:49,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:49,639 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 18:55:49,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102934275] [2019-12-18 18:55:49,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:49,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:55:49,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521180601] [2019-12-18 18:55:49,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:55:49,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:49,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:55:49,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:55:49,642 INFO L87 Difference]: Start difference. First operand 13086 states and 40859 transitions. Second operand 3 states. [2019-12-18 18:55:49,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:49,762 INFO L93 Difference]: Finished difference Result 18737 states and 58738 transitions. [2019-12-18 18:55:49,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:55:49,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 18:55:49,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:49,800 INFO L225 Difference]: With dead ends: 18737 [2019-12-18 18:55:49,801 INFO L226 Difference]: Without dead ends: 18737 [2019-12-18 18:55:49,801 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 18:55:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18737 states. [2019-12-18 18:55:50,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18737 to 16909. [2019-12-18 18:55:50,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16909 states. [2019-12-18 18:55:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16909 states to 16909 states and 53533 transitions. [2019-12-18 18:55:50,088 INFO L78 Accepts]: Start accepts. Automaton has 16909 states and 53533 transitions. Word has length 53 [2019-12-18 18:55:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:50,088 INFO L462 AbstractCegarLoop]: Abstraction has 16909 states and 53533 transitions. [2019-12-18 18:55:50,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:55:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 16909 states and 53533 transitions. [2019-12-18 18:55:50,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:55:50,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:50,109 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] [2019-12-18 18:55:50,109 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:50,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:50,109 INFO L82 PathProgramCache]: Analyzing trace with hash 2081547793, now seen corresponding path program 5 times [2019-12-18 18:55:50,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:50,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126600786] [2019-12-18 18:55:50,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:50,202 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 18:55:50,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126600786] [2019-12-18 18:55:50,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:50,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:55:50,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635823702] [2019-12-18 18:55:50,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:55:50,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:50,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:55:50,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:55:50,204 INFO L87 Difference]: Start difference. First operand 16909 states and 53533 transitions. Second operand 6 states. [2019-12-18 18:55:51,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:51,130 INFO L93 Difference]: Finished difference Result 31543 states and 97867 transitions. [2019-12-18 18:55:51,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:55:51,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-18 18:55:51,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:51,179 INFO L225 Difference]: With dead ends: 31543 [2019-12-18 18:55:51,179 INFO L226 Difference]: Without dead ends: 31459 [2019-12-18 18:55:51,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:55:51,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31459 states. [2019-12-18 18:55:51,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31459 to 19853. [2019-12-18 18:55:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19853 states. [2019-12-18 18:55:51,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19853 states to 19853 states and 62091 transitions. [2019-12-18 18:55:51,562 INFO L78 Accepts]: Start accepts. Automaton has 19853 states and 62091 transitions. Word has length 53 [2019-12-18 18:55:51,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:51,563 INFO L462 AbstractCegarLoop]: Abstraction has 19853 states and 62091 transitions. [2019-12-18 18:55:51,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:55:51,563 INFO L276 IsEmpty]: Start isEmpty. Operand 19853 states and 62091 transitions. [2019-12-18 18:55:51,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:55:51,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:51,597 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] [2019-12-18 18:55:51,597 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:51,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:51,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1629843107, now seen corresponding path program 6 times [2019-12-18 18:55:51,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:51,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441979130] [2019-12-18 18:55:51,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:51,722 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 18:55:51,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441979130] [2019-12-18 18:55:51,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:51,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:55:51,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583720576] [2019-12-18 18:55:51,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:55:51,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:51,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:55:51,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:55:51,724 INFO L87 Difference]: Start difference. First operand 19853 states and 62091 transitions. Second operand 7 states. [2019-12-18 18:55:52,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:52,654 INFO L93 Difference]: Finished difference Result 31464 states and 95079 transitions. [2019-12-18 18:55:52,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 18:55:52,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 18:55:52,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:52,701 INFO L225 Difference]: With dead ends: 31464 [2019-12-18 18:55:52,701 INFO L226 Difference]: Without dead ends: 31342 [2019-12-18 18:55:52,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:55:52,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31342 states. [2019-12-18 18:55:53,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31342 to 25003. [2019-12-18 18:55:53,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25003 states. [2019-12-18 18:55:53,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25003 states to 25003 states and 77213 transitions. [2019-12-18 18:55:53,146 INFO L78 Accepts]: Start accepts. Automaton has 25003 states and 77213 transitions. Word has length 53 [2019-12-18 18:55:53,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:53,146 INFO L462 AbstractCegarLoop]: Abstraction has 25003 states and 77213 transitions. [2019-12-18 18:55:53,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:55:53,147 INFO L276 IsEmpty]: Start isEmpty. Operand 25003 states and 77213 transitions. [2019-12-18 18:55:53,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:55:53,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:53,446 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] [2019-12-18 18:55:53,446 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:53,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:53,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1109995221, now seen corresponding path program 7 times [2019-12-18 18:55:53,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:53,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752433945] [2019-12-18 18:55:53,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:53,578 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 18:55:53,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752433945] [2019-12-18 18:55:53,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:53,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:55:53,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7142439] [2019-12-18 18:55:53,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:55:53,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:53,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:55:53,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:55:53,580 INFO L87 Difference]: Start difference. First operand 25003 states and 77213 transitions. Second operand 9 states. [2019-12-18 18:55:55,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:55,351 INFO L93 Difference]: Finished difference Result 41056 states and 124508 transitions. [2019-12-18 18:55:55,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 18:55:55,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 18:55:55,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:55,414 INFO L225 Difference]: With dead ends: 41056 [2019-12-18 18:55:55,414 INFO L226 Difference]: Without dead ends: 41056 [2019-12-18 18:55:55,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:55:55,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41056 states. [2019-12-18 18:55:55,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41056 to 23556. [2019-12-18 18:55:55,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23556 states. [2019-12-18 18:55:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23556 states to 23556 states and 73044 transitions. [2019-12-18 18:55:55,899 INFO L78 Accepts]: Start accepts. Automaton has 23556 states and 73044 transitions. Word has length 53 [2019-12-18 18:55:55,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:55,899 INFO L462 AbstractCegarLoop]: Abstraction has 23556 states and 73044 transitions. [2019-12-18 18:55:55,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:55:55,899 INFO L276 IsEmpty]: Start isEmpty. Operand 23556 states and 73044 transitions. [2019-12-18 18:55:55,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:55:55,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:55,925 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] [2019-12-18 18:55:55,926 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:55,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:55,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2099294685, now seen corresponding path program 8 times [2019-12-18 18:55:55,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:55,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808154395] [2019-12-18 18:55:55,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:56,027 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 18:55:56,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808154395] [2019-12-18 18:55:56,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:56,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:55:56,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084357050] [2019-12-18 18:55:56,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:55:56,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:56,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:55:56,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:55:56,029 INFO L87 Difference]: Start difference. First operand 23556 states and 73044 transitions. Second operand 3 states. [2019-12-18 18:55:56,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:56,147 INFO L93 Difference]: Finished difference Result 23554 states and 73039 transitions. [2019-12-18 18:55:56,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:55:56,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 18:55:56,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:56,194 INFO L225 Difference]: With dead ends: 23554 [2019-12-18 18:55:56,195 INFO L226 Difference]: Without dead ends: 23554 [2019-12-18 18:55:56,195 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 18:55:56,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23554 states. [2019-12-18 18:55:56,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23554 to 21366. [2019-12-18 18:55:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21366 states. [2019-12-18 18:55:56,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21366 states to 21366 states and 67157 transitions. [2019-12-18 18:55:56,771 INFO L78 Accepts]: Start accepts. Automaton has 21366 states and 67157 transitions. Word has length 53 [2019-12-18 18:55:56,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:56,771 INFO L462 AbstractCegarLoop]: Abstraction has 21366 states and 67157 transitions. [2019-12-18 18:55:56,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:55:56,771 INFO L276 IsEmpty]: Start isEmpty. Operand 21366 states and 67157 transitions. [2019-12-18 18:55:56,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:55:56,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:56,795 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] [2019-12-18 18:55:56,795 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:56,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:56,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1545980158, now seen corresponding path program 1 times [2019-12-18 18:55:56,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:56,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408479471] [2019-12-18 18:55:56,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:56,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 18:55:56,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408479471] [2019-12-18 18:55:56,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:56,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:55:56,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696063156] [2019-12-18 18:55:56,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:55:56,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:56,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:55:56,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:55:56,885 INFO L87 Difference]: Start difference. First operand 21366 states and 67157 transitions. Second operand 3 states. [2019-12-18 18:55:56,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:56,964 INFO L93 Difference]: Finished difference Result 15882 states and 48979 transitions. [2019-12-18 18:55:56,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:55:56,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 18:55:56,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:56,996 INFO L225 Difference]: With dead ends: 15882 [2019-12-18 18:55:56,996 INFO L226 Difference]: Without dead ends: 15882 [2019-12-18 18:55:56,997 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 18:55:57,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15882 states. [2019-12-18 18:55:57,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15882 to 15239. [2019-12-18 18:55:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15239 states. [2019-12-18 18:55:57,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15239 states to 15239 states and 46889 transitions. [2019-12-18 18:55:57,235 INFO L78 Accepts]: Start accepts. Automaton has 15239 states and 46889 transitions. Word has length 54 [2019-12-18 18:55:57,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:57,235 INFO L462 AbstractCegarLoop]: Abstraction has 15239 states and 46889 transitions. [2019-12-18 18:55:57,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:55:57,235 INFO L276 IsEmpty]: Start isEmpty. Operand 15239 states and 46889 transitions. [2019-12-18 18:55:57,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:55:57,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:57,251 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] [2019-12-18 18:55:57,252 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:57,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:57,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1024706095, now seen corresponding path program 1 times [2019-12-18 18:55:57,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:57,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694933618] [2019-12-18 18:55:57,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:57,449 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 18:55:57,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694933618] [2019-12-18 18:55:57,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:57,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:55:57,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683471498] [2019-12-18 18:55:57,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:55:57,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:57,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:55:57,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:55:57,451 INFO L87 Difference]: Start difference. First operand 15239 states and 46889 transitions. Second operand 11 states. [2019-12-18 18:55:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:55:58,518 INFO L93 Difference]: Finished difference Result 31140 states and 95845 transitions. [2019-12-18 18:55:58,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 18:55:58,518 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 18:55:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:55:58,561 INFO L225 Difference]: With dead ends: 31140 [2019-12-18 18:55:58,562 INFO L226 Difference]: Without dead ends: 30574 [2019-12-18 18:55:58,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 18:55:58,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30574 states. [2019-12-18 18:55:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30574 to 19726. [2019-12-18 18:55:58,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19726 states. [2019-12-18 18:55:58,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19726 states to 19726 states and 60759 transitions. [2019-12-18 18:55:58,947 INFO L78 Accepts]: Start accepts. Automaton has 19726 states and 60759 transitions. Word has length 55 [2019-12-18 18:55:58,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:55:58,947 INFO L462 AbstractCegarLoop]: Abstraction has 19726 states and 60759 transitions. [2019-12-18 18:55:58,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:55:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 19726 states and 60759 transitions. [2019-12-18 18:55:58,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:55:58,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:55:58,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:55:58,971 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:55:58,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:55:58,971 INFO L82 PathProgramCache]: Analyzing trace with hash 621327827, now seen corresponding path program 2 times [2019-12-18 18:55:58,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:55:58,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366179060] [2019-12-18 18:55:58,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:55:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:55:59,129 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 18:55:59,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366179060] [2019-12-18 18:55:59,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:55:59,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:55:59,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596647382] [2019-12-18 18:55:59,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:55:59,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:55:59,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:55:59,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:55:59,132 INFO L87 Difference]: Start difference. First operand 19726 states and 60759 transitions. Second operand 11 states. [2019-12-18 18:55:59,864 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-12-18 18:56:00,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:56:00,337 INFO L93 Difference]: Finished difference Result 31214 states and 95464 transitions. [2019-12-18 18:56:00,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 18:56:00,338 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 18:56:00,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:56:00,390 INFO L225 Difference]: With dead ends: 31214 [2019-12-18 18:56:00,390 INFO L226 Difference]: Without dead ends: 23119 [2019-12-18 18:56:00,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:56:00,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23119 states. [2019-12-18 18:56:00,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23119 to 15122. [2019-12-18 18:56:00,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15122 states. [2019-12-18 18:56:00,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15122 states to 15122 states and 46004 transitions. [2019-12-18 18:56:00,744 INFO L78 Accepts]: Start accepts. Automaton has 15122 states and 46004 transitions. Word has length 55 [2019-12-18 18:56:00,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:56:00,745 INFO L462 AbstractCegarLoop]: Abstraction has 15122 states and 46004 transitions. [2019-12-18 18:56:00,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:56:00,745 INFO L276 IsEmpty]: Start isEmpty. Operand 15122 states and 46004 transitions. [2019-12-18 18:56:00,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:56:00,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:56:00,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] [2019-12-18 18:56:00,765 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:56:00,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:56:00,766 INFO L82 PathProgramCache]: Analyzing trace with hash -2043347127, now seen corresponding path program 3 times [2019-12-18 18:56:00,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:56:00,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796382447] [2019-12-18 18:56:00,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:56:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:56:00,925 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 18:56:00,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796382447] [2019-12-18 18:56:00,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:56:00,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:56:00,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605758479] [2019-12-18 18:56:00,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 18:56:00,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:56:00,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 18:56:00,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:56:00,927 INFO L87 Difference]: Start difference. First operand 15122 states and 46004 transitions. Second operand 12 states. [2019-12-18 18:56:01,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:56:01,833 INFO L93 Difference]: Finished difference Result 23598 states and 71304 transitions. [2019-12-18 18:56:01,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 18:56:01,833 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-18 18:56:01,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:56:01,885 INFO L225 Difference]: With dead ends: 23598 [2019-12-18 18:56:01,886 INFO L226 Difference]: Without dead ends: 22929 [2019-12-18 18:56:01,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 18:56:01,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22929 states. [2019-12-18 18:56:02,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22929 to 14804. [2019-12-18 18:56:02,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14804 states. [2019-12-18 18:56:02,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14804 states to 14804 states and 45140 transitions. [2019-12-18 18:56:02,174 INFO L78 Accepts]: Start accepts. Automaton has 14804 states and 45140 transitions. Word has length 55 [2019-12-18 18:56:02,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:56:02,174 INFO L462 AbstractCegarLoop]: Abstraction has 14804 states and 45140 transitions. [2019-12-18 18:56:02,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 18:56:02,175 INFO L276 IsEmpty]: Start isEmpty. Operand 14804 states and 45140 transitions. [2019-12-18 18:56:02,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:56:02,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:56:02,190 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] [2019-12-18 18:56:02,191 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:56:02,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:56:02,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 4 times [2019-12-18 18:56:02,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:56:02,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507414861] [2019-12-18 18:56:02,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:56:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:56:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:56:02,318 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:56:02,318 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:56:02,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= (select .cse0 |v_ULTIMATE.start_main_~#t2357~0.base_24|) 0) (= 0 v_~x$r_buff1_thd3~0_123) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2357~0.base_24|) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2357~0.base_24| 1)) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= |v_ULTIMATE.start_main_~#t2357~0.offset_18| 0) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2357~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2357~0.base_24|) |v_ULTIMATE.start_main_~#t2357~0.offset_18| 0)) |v_#memory_int_23|) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2357~0.base_24| 4) |v_#length_23|) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_~#t2357~0.base=|v_ULTIMATE.start_main_~#t2357~0.base_24|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_~#t2358~0.offset=|v_ULTIMATE.start_main_~#t2358~0.offset_19|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ULTIMATE.start_main_~#t2359~0.base=|v_ULTIMATE.start_main_~#t2359~0.base_26|, ULTIMATE.start_main_~#t2359~0.offset=|v_ULTIMATE.start_main_~#t2359~0.offset_19|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_~#t2358~0.base=|v_ULTIMATE.start_main_~#t2358~0.base_26|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ULTIMATE.start_main_~#t2357~0.offset=|v_ULTIMATE.start_main_~#t2357~0.offset_18|, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t2357~0.base, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2358~0.offset, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2359~0.base, ULTIMATE.start_main_~#t2359~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2358~0.base, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ULTIMATE.start_main_~#t2357~0.offset, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 18:56:02,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2358~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2358~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t2358~0.offset_11| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2358~0.base_13| 4) |v_#length_15|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2358~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2358~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2358~0.base_13|) |v_ULTIMATE.start_main_~#t2358~0.offset_11| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2358~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2358~0.offset=|v_ULTIMATE.start_main_~#t2358~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2358~0.base=|v_ULTIMATE.start_main_~#t2358~0.base_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2358~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t2358~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 18:56:02,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= |v_ULTIMATE.start_main_~#t2359~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t2359~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2359~0.base_13|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2359~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2359~0.base_13|) |v_ULTIMATE.start_main_~#t2359~0.offset_11| 2))) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2359~0.base_13| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2359~0.base_13| 4)) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2359~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2359~0.offset=|v_ULTIMATE.start_main_~#t2359~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2359~0.base=|v_ULTIMATE.start_main_~#t2359~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2359~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2359~0.base] because there is no mapped edge [2019-12-18 18:56:02,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= 1 ~x$w_buff0_used~0_Out-171777359) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-171777359| 1) (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-171777359 |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-171777359|) (= (mod ~x$w_buff1_used~0_Out-171777359 256) 0) (= ~x$w_buff1~0_Out-171777359 ~x$w_buff0~0_In-171777359) (= P1Thread1of1ForFork0_~arg.offset_Out-171777359 |P1Thread1of1ForFork0_#in~arg.offset_In-171777359|) (= 1 ~x$w_buff0~0_Out-171777359) (= P1Thread1of1ForFork0_~arg.base_Out-171777359 |P1Thread1of1ForFork0_#in~arg.base_In-171777359|) (= ~x$w_buff0_used~0_In-171777359 ~x$w_buff1_used~0_Out-171777359)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-171777359, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-171777359|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-171777359|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-171777359} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-171777359, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-171777359, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-171777359, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-171777359, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-171777359|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-171777359|, ~x$w_buff1~0=~x$w_buff1~0_Out-171777359, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-171777359|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-171777359, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-171777359} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 18:56:02,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In921061688 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In921061688 256)))) (or (and (= ~x$w_buff1~0_In921061688 |P2Thread1of1ForFork1_#t~ite32_Out921061688|) (not .cse0) (not .cse1)) (and (= ~x~0_In921061688 |P2Thread1of1ForFork1_#t~ite32_Out921061688|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In921061688, ~x$w_buff1_used~0=~x$w_buff1_used~0_In921061688, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In921061688, ~x~0=~x~0_In921061688} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out921061688|, ~x$w_buff1~0=~x$w_buff1~0_In921061688, ~x$w_buff1_used~0=~x$w_buff1_used~0_In921061688, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In921061688, ~x~0=~x~0_In921061688} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 18:56:02,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_29|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 18:56:02,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1926811449 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-1926811449 256) 0))) (or (and (= ~x$w_buff0_used~0_In-1926811449 |P2Thread1of1ForFork1_#t~ite34_Out-1926811449|) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out-1926811449| 0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1926811449, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1926811449} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1926811449|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1926811449, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1926811449} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 18:56:02,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1869892878 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1869892878 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1869892878 |P1Thread1of1ForFork0_#t~ite28_Out1869892878|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1869892878|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1869892878, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1869892878} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1869892878, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1869892878|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1869892878} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 18:56:02,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In-205939861 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-205939861 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-205939861 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-205939861 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-205939861|)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite29_Out-205939861| ~x$w_buff1_used~0_In-205939861) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-205939861, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-205939861, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-205939861, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-205939861} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-205939861, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-205939861, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-205939861, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-205939861|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-205939861} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 18:56:02,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1465938848 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1465938848 256)))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out1465938848) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In1465938848 ~x$r_buff0_thd2~0_Out1465938848) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1465938848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1465938848} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1465938848|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1465938848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1465938848} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 18:56:02,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1286043635 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1286043635 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1286043635 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-1286043635 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-1286043635 |P1Thread1of1ForFork0_#t~ite31_Out-1286043635|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1286043635|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1286043635, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1286043635, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1286043635, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1286043635} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1286043635|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1286043635, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1286043635, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1286043635, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1286043635} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 18:56:02,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_38|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_37|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 18:56:02,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2129103716 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In2129103716 256)))) (or (and (= (mod ~x$r_buff1_thd1~0_In2129103716 256) 0) .cse1) (and (= (mod ~x$w_buff1_used~0_In2129103716 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In2129103716 256) 0))) (= ~x$w_buff1~0_In2129103716 |P0Thread1of1ForFork2_#t~ite11_Out2129103716|) (= |P0Thread1of1ForFork2_#t~ite12_Out2129103716| |P0Thread1of1ForFork2_#t~ite11_Out2129103716|)) (and (= |P0Thread1of1ForFork2_#t~ite12_Out2129103716| ~x$w_buff1~0_In2129103716) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In2129103716| |P0Thread1of1ForFork2_#t~ite11_Out2129103716|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2129103716, ~x$w_buff1~0=~x$w_buff1~0_In2129103716, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2129103716, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2129103716, ~weak$$choice2~0=~weak$$choice2~0_In2129103716, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In2129103716|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2129103716} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2129103716, ~x$w_buff1~0=~x$w_buff1~0_In2129103716, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2129103716, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2129103716, ~weak$$choice2~0=~weak$$choice2~0_In2129103716, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out2129103716|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out2129103716|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2129103716} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 18:56:02,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2104872545 256) 0))) (or (and (not .cse0) (= ~x$w_buff0_used~0_In-2104872545 |P0Thread1of1ForFork2_#t~ite15_Out-2104872545|) (= |P0Thread1of1ForFork2_#t~ite14_In-2104872545| |P0Thread1of1ForFork2_#t~ite14_Out-2104872545|)) (and (= |P0Thread1of1ForFork2_#t~ite15_Out-2104872545| |P0Thread1of1ForFork2_#t~ite14_Out-2104872545|) (= ~x$w_buff0_used~0_In-2104872545 |P0Thread1of1ForFork2_#t~ite14_Out-2104872545|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-2104872545 256)))) (or (= (mod ~x$w_buff0_used~0_In-2104872545 256) 0) (and (= 0 (mod ~x$r_buff1_thd1~0_In-2104872545 256)) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In-2104872545 256)) .cse1))) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2104872545, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2104872545, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2104872545, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-2104872545|, ~weak$$choice2~0=~weak$$choice2~0_In-2104872545, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2104872545} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2104872545, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2104872545, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-2104872545|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2104872545, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-2104872545|, ~weak$$choice2~0=~weak$$choice2~0_In-2104872545, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2104872545} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 18:56:02,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In221755931 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite18_Out221755931| |P0Thread1of1ForFork2_#t~ite17_Out221755931|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In221755931 256) 0))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In221755931 256) 0)) (= (mod ~x$w_buff0_used~0_In221755931 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In221755931 256))))) (= ~x$w_buff1_used~0_In221755931 |P0Thread1of1ForFork2_#t~ite17_Out221755931|)) (and (= |P0Thread1of1ForFork2_#t~ite17_In221755931| |P0Thread1of1ForFork2_#t~ite17_Out221755931|) (= ~x$w_buff1_used~0_In221755931 |P0Thread1of1ForFork2_#t~ite18_Out221755931|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In221755931, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In221755931|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In221755931, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In221755931, ~weak$$choice2~0=~weak$$choice2~0_In221755931, ~x$w_buff0_used~0=~x$w_buff0_used~0_In221755931} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In221755931, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out221755931|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out221755931|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In221755931, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In221755931, ~weak$$choice2~0=~weak$$choice2~0_In221755931, ~x$w_buff0_used~0=~x$w_buff0_used~0_In221755931} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 18:56:02,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite23_39| |v_P0Thread1of1ForFork2_#t~ite23_40|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_35|) (not (= 0 (mod v_~weak$$choice2~0_142 256))) (= |v_P0Thread1of1ForFork2_#t~ite22_36| |v_P0Thread1of1ForFork2_#t~ite22_35|)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_40|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_36|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_35|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_39|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_35|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 18:56:02,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 18:56:02,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1397482908 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1397482908 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1397482908 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-1397482908 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1397482908 |P2Thread1of1ForFork1_#t~ite35_Out-1397482908|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-1397482908|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1397482908, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1397482908, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1397482908, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1397482908} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1397482908|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1397482908, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1397482908, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1397482908, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1397482908} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 18:56:02,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1962757459 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1962757459 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out1962757459| ~x$r_buff0_thd3~0_In1962757459) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out1962757459| 0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1962757459, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1962757459} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1962757459|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1962757459, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1962757459} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 18:56:02,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In765765131 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In765765131 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In765765131 256))) (.cse2 (= (mod ~x$r_buff1_thd3~0_In765765131 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out765765131|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd3~0_In765765131 |P2Thread1of1ForFork1_#t~ite37_Out765765131|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In765765131, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In765765131, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In765765131, ~x$w_buff0_used~0=~x$w_buff0_used~0_In765765131} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out765765131|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In765765131, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In765765131, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In765765131, ~x$w_buff0_used~0=~x$w_buff0_used~0_In765765131} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 18:56:02,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_40|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_39|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 18:56:02,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= 3 v_~__unbuffered_cnt~0_39) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 18:56:02,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1791088007 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1791088007 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out-1791088007| ~x$w_buff1~0_In-1791088007)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite41_Out-1791088007| ~x~0_In-1791088007)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1791088007, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1791088007, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1791088007, ~x~0=~x~0_In-1791088007} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1791088007|, ~x$w_buff1~0=~x$w_buff1~0_In-1791088007, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1791088007, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1791088007, ~x~0=~x~0_In-1791088007} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 18:56:02,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 18:56:02,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-349869119 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-349869119 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out-349869119|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out-349869119| ~x$w_buff0_used~0_In-349869119) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-349869119, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-349869119} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-349869119, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-349869119|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-349869119} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 18:56:02,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1059813004 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1059813004 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1059813004 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In1059813004 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out1059813004| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In1059813004 |ULTIMATE.start_main_#t~ite44_Out1059813004|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1059813004, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1059813004, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1059813004, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1059813004} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1059813004, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1059813004, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1059813004, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1059813004|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1059813004} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 18:56:02,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-460182133 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-460182133 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out-460182133|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-460182133| ~x$r_buff0_thd0~0_In-460182133)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-460182133, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-460182133} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-460182133, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-460182133|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-460182133} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 18:56:02,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In32318159 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In32318159 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In32318159 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In32318159 256) 0))) (or (and (= ~x$r_buff1_thd0~0_In32318159 |ULTIMATE.start_main_#t~ite46_Out32318159|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite46_Out32318159|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In32318159, ~x$w_buff1_used~0=~x$w_buff1_used~0_In32318159, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In32318159, ~x$w_buff0_used~0=~x$w_buff0_used~0_In32318159} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In32318159, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out32318159|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In32318159, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In32318159, ~x$w_buff0_used~0=~x$w_buff0_used~0_In32318159} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 18:56:02,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:56:02,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:56:02 BasicIcfg [2019-12-18 18:56:02,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:56:02,460 INFO L168 Benchmark]: Toolchain (without parser) took 72828.58 ms. Allocated memory was 143.1 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 100.6 MB in the beginning and 1.1 GB in the end (delta: -958.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 18:56:02,461 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 143.1 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 18:56:02,462 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.21 ms. Allocated memory was 143.1 MB in the beginning and 203.4 MB in the end (delta: 60.3 MB). Free memory was 100.1 MB in the beginning and 157.3 MB in the end (delta: -57.2 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-18 18:56:02,462 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.38 ms. Allocated memory is still 203.4 MB. Free memory was 157.3 MB in the beginning and 154.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 18:56:02,463 INFO L168 Benchmark]: Boogie Preprocessor took 58.30 ms. Allocated memory is still 203.4 MB. Free memory was 154.5 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 18:56:02,463 INFO L168 Benchmark]: RCFGBuilder took 873.26 ms. Allocated memory is still 203.4 MB. Free memory was 152.6 MB in the beginning and 105.7 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-18 18:56:02,464 INFO L168 Benchmark]: TraceAbstraction took 71074.46 ms. Allocated memory was 203.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 105.0 MB in the beginning and 1.1 GB in the end (delta: -953.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 18:56:02,467 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 143.1 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 749.21 ms. Allocated memory was 143.1 MB in the beginning and 203.4 MB in the end (delta: 60.3 MB). Free memory was 100.1 MB in the beginning and 157.3 MB in the end (delta: -57.2 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.38 ms. Allocated memory is still 203.4 MB. Free memory was 157.3 MB in the beginning and 154.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.30 ms. Allocated memory is still 203.4 MB. Free memory was 154.5 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 873.26 ms. Allocated memory is still 203.4 MB. Free memory was 152.6 MB in the beginning and 105.7 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 71074.46 ms. Allocated memory was 203.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 105.0 MB in the beginning and 1.1 GB in the end (delta: -953.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2357, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2358, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2359, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 70.7s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 17.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4056 SDtfs, 4999 SDslu, 14064 SDs, 0 SdLazy, 6202 SolverSat, 204 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 43 SyntacticMatches, 14 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115962occurred 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: 32.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 128252 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 882 NumberOfCodeBlocks, 882 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 807 ConstructedInterpolants, 0 QuantifiedInterpolants, 172271 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...