/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:22:29,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:22:29,571 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:22:29,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:22:29,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:22:29,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:22:29,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:22:29,602 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:22:29,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:22:29,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:22:29,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:22:29,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:22:29,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:22:29,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:22:29,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:22:29,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:22:29,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:22:29,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:22:29,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:22:29,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:22:29,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:22:29,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:22:29,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:22:29,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:22:29,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:22:29,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:22:29,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:22:29,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:22:29,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:22:29,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:22:29,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:22:29,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:22:29,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:22:29,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:22:29,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:22:29,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:22:29,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:22:29,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:22:29,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:22:29,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:22:29,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:22:29,648 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:22:29,661 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:22:29,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:22:29,663 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:22:29,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:22:29,663 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:22:29,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:22:29,663 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:22:29,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:22:29,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:22:29,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:22:29,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:22:29,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:22:29,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:22:29,665 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:22:29,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:22:29,665 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:22:29,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:22:29,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:22:29,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:22:29,666 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:22:29,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:22:29,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:22:29,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:22:29,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:22:29,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:22:29,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:22:29,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:22:29,667 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:22:29,668 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:22:29,668 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:22:29,937 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:22:29,951 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:22:29,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:22:29,956 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:22:29,956 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:22:29,957 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_rmo.opt.i [2019-12-18 13:22:30,036 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52d096bbb/fbe7dba1bd974ddca263197ba562caa8/FLAGf97b95dec [2019-12-18 13:22:30,616 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:22:30,617 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_rmo.opt.i [2019-12-18 13:22:30,638 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52d096bbb/fbe7dba1bd974ddca263197ba562caa8/FLAGf97b95dec [2019-12-18 13:22:30,944 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52d096bbb/fbe7dba1bd974ddca263197ba562caa8 [2019-12-18 13:22:30,952 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:22:30,954 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:22:30,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:22:30,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:22:30,958 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:22:30,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:22:30" (1/1) ... [2019-12-18 13:22:30,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c9a023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:30, skipping insertion in model container [2019-12-18 13:22:30,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:22:30" (1/1) ... [2019-12-18 13:22:30,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:22:31,041 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:22:31,520 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:22:31,533 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:22:31,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:22:31,680 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:22:31,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:31 WrapperNode [2019-12-18 13:22:31,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:22:31,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:22:31,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:22:31,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:22:31,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:31" (1/1) ... [2019-12-18 13:22:31,726 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:31" (1/1) ... [2019-12-18 13:22:31,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:22:31,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:22:31,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:22:31,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:22:31,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:31" (1/1) ... [2019-12-18 13:22:31,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:31" (1/1) ... [2019-12-18 13:22:31,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:31" (1/1) ... [2019-12-18 13:22:31,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:31" (1/1) ... [2019-12-18 13:22:31,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:31" (1/1) ... [2019-12-18 13:22:31,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:31" (1/1) ... [2019-12-18 13:22:31,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:31" (1/1) ... [2019-12-18 13:22:31,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:22:31,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:22:31,804 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:22:31,804 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:22:31,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:31" (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 13:22:31,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:22:31,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:22:31,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:22:31,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:22:31,878 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:22:31,879 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:22:31,879 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:22:31,880 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:22:31,880 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:22:31,881 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:22:31,881 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 13:22:31,881 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 13:22:31,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:22:31,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:22:31,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:22:31,884 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 13:22:32,635 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:22:32,635 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:22:32,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:22:32 BoogieIcfgContainer [2019-12-18 13:22:32,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:22:32,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:22:32,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:22:32,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:22:32,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:22:30" (1/3) ... [2019-12-18 13:22:32,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@233bcbb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:22:32, skipping insertion in model container [2019-12-18 13:22:32,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:31" (2/3) ... [2019-12-18 13:22:32,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@233bcbb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:22:32, skipping insertion in model container [2019-12-18 13:22:32,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:22:32" (3/3) ... [2019-12-18 13:22:32,649 INFO L109 eAbstractionObserver]: Analyzing ICFG mix037_rmo.opt.i [2019-12-18 13:22:32,658 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:22:32,658 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:22:32,666 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:22:32,667 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:22:32,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,709 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,709 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,711 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,711 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,714 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,714 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,759 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,759 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,760 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,760 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,760 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,760 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,795 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,795 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,800 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,801 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,808 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,809 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,809 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,809 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,809 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,809 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,810 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,810 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,810 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,810 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,810 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,810 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,812 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,813 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:32,828 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 13:22:32,848 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:22:32,849 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:22:32,849 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:22:32,849 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:22:32,849 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:22:32,849 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:22:32,849 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:22:32,849 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:22:32,867 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-18 13:22:32,869 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-18 13:22:32,971 INFO L126 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-18 13:22:32,971 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:22:32,993 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 13:22:33,017 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-18 13:22:33,083 INFO L126 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-18 13:22:33,083 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:22:33,089 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 13:22:33,105 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-18 13:22:33,106 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:22:38,286 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 13:22:38,405 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 13:22:38,897 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 13:22:39,053 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 13:22:39,072 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-18 13:22:39,073 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-18 13:22:39,076 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-18 13:22:40,332 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-18 13:22:40,334 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-18 13:22:40,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 13:22:40,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:40,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:22:40,343 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:22:40,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:40,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-18 13:22:40,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:40,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713407011] [2019-12-18 13:22:40,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:40,629 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 13:22:40,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713407011] [2019-12-18 13:22:40,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:40,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:22:40,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777130593] [2019-12-18 13:22:40,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:22:40,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:40,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:22:40,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:22:40,655 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-18 13:22:41,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:41,043 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-18 13:22:41,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:22:41,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 13:22:41,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:41,286 INFO L225 Difference]: With dead ends: 20958 [2019-12-18 13:22:41,286 INFO L226 Difference]: Without dead ends: 19662 [2019-12-18 13:22:41,288 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 13:22:41,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-18 13:22:42,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-18 13:22:42,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-18 13:22:43,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-18 13:22:43,339 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-18 13:22:43,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:43,341 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-18 13:22:43,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:22:43,341 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-18 13:22:43,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:22:43,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:43,360 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:22:43,361 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:22:43,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:43,361 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-18 13:22:43,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:43,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811382765] [2019-12-18 13:22:43,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:43,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:22:43,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811382765] [2019-12-18 13:22:43,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:43,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:22:43,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300644042] [2019-12-18 13:22:43,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:22:43,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:43,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:22:43,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:22:43,525 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-18 13:22:43,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:43,951 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-18 13:22:43,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:22:43,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 13:22:43,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:44,077 INFO L225 Difference]: With dead ends: 30494 [2019-12-18 13:22:44,078 INFO L226 Difference]: Without dead ends: 30438 [2019-12-18 13:22:44,079 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 13:22:44,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-18 13:22:46,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-18 13:22:46,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-18 13:22:46,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-18 13:22:46,511 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-18 13:22:46,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:46,511 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-18 13:22:46,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:22:46,512 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-18 13:22:46,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 13:22:46,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:46,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:22:46,518 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:22:46,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:46,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-18 13:22:46,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:46,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977846410] [2019-12-18 13:22:46,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:46,660 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 13:22:46,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977846410] [2019-12-18 13:22:46,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:46,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:22:46,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213659080] [2019-12-18 13:22:46,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:22:46,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:46,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:22:46,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:22:46,666 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 4 states. [2019-12-18 13:22:47,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:47,015 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-18 13:22:47,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:22:47,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 13:22:47,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:47,136 INFO L225 Difference]: With dead ends: 35230 [2019-12-18 13:22:47,137 INFO L226 Difference]: Without dead ends: 35182 [2019-12-18 13:22:47,137 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 13:22:47,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-18 13:22:48,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-18 13:22:48,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-18 13:22:48,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-18 13:22:48,484 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-18 13:22:48,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:48,485 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-18 13:22:48,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:22:48,485 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-18 13:22:48,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 13:22:48,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:48,498 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:22:48,498 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:22:48,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:48,499 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-18 13:22:48,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:48,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237463077] [2019-12-18 13:22:48,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:22:48,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237463077] [2019-12-18 13:22:48,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:48,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:22:48,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188260629] [2019-12-18 13:22:48,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:22:48,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:48,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:22:48,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:22:48,561 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 3 states. [2019-12-18 13:22:48,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:48,738 INFO L93 Difference]: Finished difference Result 29747 states and 123892 transitions. [2019-12-18 13:22:48,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:22:48,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-18 13:22:48,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:50,355 INFO L225 Difference]: With dead ends: 29747 [2019-12-18 13:22:50,356 INFO L226 Difference]: Without dead ends: 29747 [2019-12-18 13:22:50,357 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 13:22:50,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29747 states. [2019-12-18 13:22:50,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29747 to 29747. [2019-12-18 13:22:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29747 states. [2019-12-18 13:22:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29747 states to 29747 states and 123892 transitions. [2019-12-18 13:22:51,206 INFO L78 Accepts]: Start accepts. Automaton has 29747 states and 123892 transitions. Word has length 20 [2019-12-18 13:22:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:51,206 INFO L462 AbstractCegarLoop]: Abstraction has 29747 states and 123892 transitions. [2019-12-18 13:22:51,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:22:51,207 INFO L276 IsEmpty]: Start isEmpty. Operand 29747 states and 123892 transitions. [2019-12-18 13:22:51,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 13:22:51,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:51,219 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] [2019-12-18 13:22:51,220 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:22:51,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:51,220 INFO L82 PathProgramCache]: Analyzing trace with hash -129088173, now seen corresponding path program 1 times [2019-12-18 13:22:51,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:51,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737605154] [2019-12-18 13:22:51,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:51,288 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 13:22:51,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737605154] [2019-12-18 13:22:51,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:51,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:22:51,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542596855] [2019-12-18 13:22:51,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:22:51,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:51,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:22:51,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:22:51,291 INFO L87 Difference]: Start difference. First operand 29747 states and 123892 transitions. Second operand 3 states. [2019-12-18 13:22:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:51,476 INFO L93 Difference]: Finished difference Result 36709 states and 144810 transitions. [2019-12-18 13:22:51,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:22:51,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 13:22:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:51,550 INFO L225 Difference]: With dead ends: 36709 [2019-12-18 13:22:51,551 INFO L226 Difference]: Without dead ends: 30167 [2019-12-18 13:22:51,551 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 13:22:51,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30167 states. [2019-12-18 13:22:52,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30167 to 29499. [2019-12-18 13:22:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29499 states. [2019-12-18 13:22:52,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29499 states to 29499 states and 115623 transitions. [2019-12-18 13:22:52,429 INFO L78 Accepts]: Start accepts. Automaton has 29499 states and 115623 transitions. Word has length 21 [2019-12-18 13:22:52,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:52,430 INFO L462 AbstractCegarLoop]: Abstraction has 29499 states and 115623 transitions. [2019-12-18 13:22:52,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:22:52,430 INFO L276 IsEmpty]: Start isEmpty. Operand 29499 states and 115623 transitions. [2019-12-18 13:22:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 13:22:52,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:52,438 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] [2019-12-18 13:22:52,438 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:22:52,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:52,439 INFO L82 PathProgramCache]: Analyzing trace with hash 484267595, now seen corresponding path program 1 times [2019-12-18 13:22:52,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:52,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451285918] [2019-12-18 13:22:52,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:52,491 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 13:22:52,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451285918] [2019-12-18 13:22:52,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:52,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:22:52,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417746440] [2019-12-18 13:22:52,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:22:52,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:52,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:22:52,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:22:52,493 INFO L87 Difference]: Start difference. First operand 29499 states and 115623 transitions. Second operand 3 states. [2019-12-18 13:22:52,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:52,631 INFO L93 Difference]: Finished difference Result 29289 states and 114842 transitions. [2019-12-18 13:22:52,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:22:52,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 13:22:52,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:52,698 INFO L225 Difference]: With dead ends: 29289 [2019-12-18 13:22:52,698 INFO L226 Difference]: Without dead ends: 29289 [2019-12-18 13:22:52,699 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 13:22:52,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29289 states. [2019-12-18 13:22:53,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29289 to 29205. [2019-12-18 13:22:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29205 states. [2019-12-18 13:22:53,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29205 states to 29205 states and 114644 transitions. [2019-12-18 13:22:53,520 INFO L78 Accepts]: Start accepts. Automaton has 29205 states and 114644 transitions. Word has length 21 [2019-12-18 13:22:53,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:53,521 INFO L462 AbstractCegarLoop]: Abstraction has 29205 states and 114644 transitions. [2019-12-18 13:22:53,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:22:53,521 INFO L276 IsEmpty]: Start isEmpty. Operand 29205 states and 114644 transitions. [2019-12-18 13:22:53,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:22:53,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:53,531 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 13:22:53,531 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:22:53,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:53,531 INFO L82 PathProgramCache]: Analyzing trace with hash 291958640, now seen corresponding path program 1 times [2019-12-18 13:22:53,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:53,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062532717] [2019-12-18 13:22:53,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:53,600 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 13:22:53,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062532717] [2019-12-18 13:22:53,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:53,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:22:53,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82123730] [2019-12-18 13:22:53,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:22:53,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:53,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:22:53,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:22:53,603 INFO L87 Difference]: Start difference. First operand 29205 states and 114644 transitions. Second operand 5 states. [2019-12-18 13:22:53,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:53,730 INFO L93 Difference]: Finished difference Result 12827 states and 41537 transitions. [2019-12-18 13:22:53,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:22:53,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 13:22:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:53,753 INFO L225 Difference]: With dead ends: 12827 [2019-12-18 13:22:53,753 INFO L226 Difference]: Without dead ends: 10855 [2019-12-18 13:22:53,753 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 13:22:53,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10855 states. [2019-12-18 13:22:53,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10855 to 10855. [2019-12-18 13:22:53,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10855 states. [2019-12-18 13:22:54,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10855 states to 10855 states and 34345 transitions. [2019-12-18 13:22:54,161 INFO L78 Accepts]: Start accepts. Automaton has 10855 states and 34345 transitions. Word has length 22 [2019-12-18 13:22:54,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:54,162 INFO L462 AbstractCegarLoop]: Abstraction has 10855 states and 34345 transitions. [2019-12-18 13:22:54,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:22:54,162 INFO L276 IsEmpty]: Start isEmpty. Operand 10855 states and 34345 transitions. [2019-12-18 13:22:54,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 13:22:54,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:54,166 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] [2019-12-18 13:22:54,166 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:22:54,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:54,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1876344722, now seen corresponding path program 1 times [2019-12-18 13:22:54,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:54,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097024972] [2019-12-18 13:22:54,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:54,212 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 13:22:54,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097024972] [2019-12-18 13:22:54,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:54,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:22:54,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999128488] [2019-12-18 13:22:54,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:22:54,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:54,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:22:54,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:22:54,214 INFO L87 Difference]: Start difference. First operand 10855 states and 34345 transitions. Second operand 4 states. [2019-12-18 13:22:54,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:54,294 INFO L93 Difference]: Finished difference Result 16412 states and 52778 transitions. [2019-12-18 13:22:54,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:22:54,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-18 13:22:54,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:54,309 INFO L225 Difference]: With dead ends: 16412 [2019-12-18 13:22:54,309 INFO L226 Difference]: Without dead ends: 8743 [2019-12-18 13:22:54,310 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 13:22:54,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8743 states. [2019-12-18 13:22:54,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8743 to 8444. [2019-12-18 13:22:54,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8444 states. [2019-12-18 13:22:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8444 states to 8444 states and 26914 transitions. [2019-12-18 13:22:54,456 INFO L78 Accepts]: Start accepts. Automaton has 8444 states and 26914 transitions. Word has length 23 [2019-12-18 13:22:54,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:54,457 INFO L462 AbstractCegarLoop]: Abstraction has 8444 states and 26914 transitions. [2019-12-18 13:22:54,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:22:54,457 INFO L276 IsEmpty]: Start isEmpty. Operand 8444 states and 26914 transitions. [2019-12-18 13:22:54,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 13:22:54,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:54,460 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] [2019-12-18 13:22:54,460 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:22:54,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:54,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1799428640, now seen corresponding path program 2 times [2019-12-18 13:22:54,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:54,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275488035] [2019-12-18 13:22:54,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:54,512 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 13:22:54,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275488035] [2019-12-18 13:22:54,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:54,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:22:54,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617941908] [2019-12-18 13:22:54,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:22:54,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:54,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:22:54,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:22:54,514 INFO L87 Difference]: Start difference. First operand 8444 states and 26914 transitions. Second operand 3 states. [2019-12-18 13:22:54,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:54,567 INFO L93 Difference]: Finished difference Result 8444 states and 26506 transitions. [2019-12-18 13:22:54,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:22:54,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-18 13:22:54,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:54,588 INFO L225 Difference]: With dead ends: 8444 [2019-12-18 13:22:54,588 INFO L226 Difference]: Without dead ends: 8444 [2019-12-18 13:22:54,589 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 13:22:54,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8444 states. [2019-12-18 13:22:54,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8444 to 8146. [2019-12-18 13:22:54,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8146 states. [2019-12-18 13:22:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8146 states to 8146 states and 25593 transitions. [2019-12-18 13:22:54,793 INFO L78 Accepts]: Start accepts. Automaton has 8146 states and 25593 transitions. Word has length 23 [2019-12-18 13:22:54,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:54,794 INFO L462 AbstractCegarLoop]: Abstraction has 8146 states and 25593 transitions. [2019-12-18 13:22:54,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:22:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 8146 states and 25593 transitions. [2019-12-18 13:22:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 13:22:54,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:54,800 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] [2019-12-18 13:22:54,801 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:22:54,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:54,801 INFO L82 PathProgramCache]: Analyzing trace with hash -417737333, now seen corresponding path program 1 times [2019-12-18 13:22:54,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:54,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967366230] [2019-12-18 13:22:54,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:54,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 13:22:54,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967366230] [2019-12-18 13:22:54,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:54,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:22:54,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219898060] [2019-12-18 13:22:54,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:22:54,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:54,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:22:54,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:22:54,884 INFO L87 Difference]: Start difference. First operand 8146 states and 25593 transitions. Second operand 6 states. [2019-12-18 13:22:54,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:54,993 INFO L93 Difference]: Finished difference Result 3111 states and 8924 transitions. [2019-12-18 13:22:54,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:22:54,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 13:22:54,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:54,998 INFO L225 Difference]: With dead ends: 3111 [2019-12-18 13:22:54,999 INFO L226 Difference]: Without dead ends: 2590 [2019-12-18 13:22:55,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:22:55,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2019-12-18 13:22:55,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2590. [2019-12-18 13:22:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2590 states. [2019-12-18 13:22:55,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 7335 transitions. [2019-12-18 13:22:55,043 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 7335 transitions. Word has length 24 [2019-12-18 13:22:55,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:55,044 INFO L462 AbstractCegarLoop]: Abstraction has 2590 states and 7335 transitions. [2019-12-18 13:22:55,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:22:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 7335 transitions. [2019-12-18 13:22:55,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 13:22:55,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:55,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:22:55,051 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:22:55,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:55,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-18 13:22:55,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:55,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121728570] [2019-12-18 13:22:55,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:55,093 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 13:22:55,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121728570] [2019-12-18 13:22:55,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:55,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:22:55,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695836373] [2019-12-18 13:22:55,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:22:55,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:55,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:22:55,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:22:55,095 INFO L87 Difference]: Start difference. First operand 2590 states and 7335 transitions. Second operand 3 states. [2019-12-18 13:22:55,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:55,151 INFO L93 Difference]: Finished difference Result 3908 states and 10998 transitions. [2019-12-18 13:22:55,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:22:55,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 13:22:55,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:55,158 INFO L225 Difference]: With dead ends: 3908 [2019-12-18 13:22:55,158 INFO L226 Difference]: Without dead ends: 3908 [2019-12-18 13:22:55,159 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 13:22:55,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3908 states. [2019-12-18 13:22:55,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3908 to 3066. [2019-12-18 13:22:55,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3066 states. [2019-12-18 13:22:55,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 8797 transitions. [2019-12-18 13:22:55,198 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 8797 transitions. Word has length 32 [2019-12-18 13:22:55,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:55,199 INFO L462 AbstractCegarLoop]: Abstraction has 3066 states and 8797 transitions. [2019-12-18 13:22:55,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:22:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 8797 transitions. [2019-12-18 13:22:55,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 13:22:55,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:55,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:22:55,203 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:22:55,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:55,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-18 13:22:55,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:55,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780711861] [2019-12-18 13:22:55,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:55,326 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 13:22:55,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780711861] [2019-12-18 13:22:55,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:55,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:22:55,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2476] [2019-12-18 13:22:55,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:22:55,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:55,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:22:55,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:22:55,331 INFO L87 Difference]: Start difference. First operand 3066 states and 8797 transitions. Second operand 6 states. [2019-12-18 13:22:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:55,776 INFO L93 Difference]: Finished difference Result 6462 states and 17612 transitions. [2019-12-18 13:22:55,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:22:55,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 13:22:55,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:55,786 INFO L225 Difference]: With dead ends: 6462 [2019-12-18 13:22:55,786 INFO L226 Difference]: Without dead ends: 6324 [2019-12-18 13:22:55,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:22:55,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6324 states. [2019-12-18 13:22:55,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6324 to 3196. [2019-12-18 13:22:55,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3196 states. [2019-12-18 13:22:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3196 states to 3196 states and 9125 transitions. [2019-12-18 13:22:55,839 INFO L78 Accepts]: Start accepts. Automaton has 3196 states and 9125 transitions. Word has length 32 [2019-12-18 13:22:55,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:55,840 INFO L462 AbstractCegarLoop]: Abstraction has 3196 states and 9125 transitions. [2019-12-18 13:22:55,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:22:55,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3196 states and 9125 transitions. [2019-12-18 13:22:55,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:22:55,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:55,845 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:22:55,846 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:22:55,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:55,846 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-12-18 13:22:55,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:55,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353018598] [2019-12-18 13:22:55,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:55,958 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 13:22:55,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353018598] [2019-12-18 13:22:55,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:55,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:22:55,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636453003] [2019-12-18 13:22:55,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:22:55,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:55,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:22:55,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:22:55,961 INFO L87 Difference]: Start difference. First operand 3196 states and 9125 transitions. Second operand 6 states. [2019-12-18 13:22:56,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:56,473 INFO L93 Difference]: Finished difference Result 6123 states and 16579 transitions. [2019-12-18 13:22:56,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:22:56,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 13:22:56,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:56,484 INFO L225 Difference]: With dead ends: 6123 [2019-12-18 13:22:56,484 INFO L226 Difference]: Without dead ends: 5979 [2019-12-18 13:22:56,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:22:56,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5979 states. [2019-12-18 13:22:56,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5979 to 3000. [2019-12-18 13:22:56,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3000 states. [2019-12-18 13:22:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3000 states to 3000 states and 8617 transitions. [2019-12-18 13:22:56,535 INFO L78 Accepts]: Start accepts. Automaton has 3000 states and 8617 transitions. Word has length 33 [2019-12-18 13:22:56,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:56,535 INFO L462 AbstractCegarLoop]: Abstraction has 3000 states and 8617 transitions. [2019-12-18 13:22:56,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:22:56,535 INFO L276 IsEmpty]: Start isEmpty. Operand 3000 states and 8617 transitions. [2019-12-18 13:22:56,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:22:56,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:56,539 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:22:56,539 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:22:56,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:56,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1231616427, now seen corresponding path program 1 times [2019-12-18 13:22:56,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:56,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274763724] [2019-12-18 13:22:56,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:56,637 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 13:22:56,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274763724] [2019-12-18 13:22:56,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:56,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:22:56,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644137054] [2019-12-18 13:22:56,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:22:56,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:56,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:22:56,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:22:56,640 INFO L87 Difference]: Start difference. First operand 3000 states and 8617 transitions. Second operand 7 states. [2019-12-18 13:22:56,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:56,758 INFO L93 Difference]: Finished difference Result 2263 states and 6813 transitions. [2019-12-18 13:22:56,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:22:56,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 13:22:56,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:56,763 INFO L225 Difference]: With dead ends: 2263 [2019-12-18 13:22:56,763 INFO L226 Difference]: Without dead ends: 1607 [2019-12-18 13:22:56,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:22:56,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2019-12-18 13:22:56,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1553. [2019-12-18 13:22:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1553 states. [2019-12-18 13:22:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 4536 transitions. [2019-12-18 13:22:56,791 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 4536 transitions. Word has length 33 [2019-12-18 13:22:56,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:56,791 INFO L462 AbstractCegarLoop]: Abstraction has 1553 states and 4536 transitions. [2019-12-18 13:22:56,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:22:56,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 4536 transitions. [2019-12-18 13:22:56,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 13:22:56,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22: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] [2019-12-18 13:22:56,795 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:22:56,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:56,796 INFO L82 PathProgramCache]: Analyzing trace with hash -978641481, now seen corresponding path program 1 times [2019-12-18 13:22:56,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:56,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79808397] [2019-12-18 13:22:56,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:56,864 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 13:22:56,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79808397] [2019-12-18 13:22:56,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:56,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:22:56,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498719242] [2019-12-18 13:22:56,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:22:56,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:56,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:22:56,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:22:56,866 INFO L87 Difference]: Start difference. First operand 1553 states and 4536 transitions. Second operand 6 states. [2019-12-18 13:22:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:57,088 INFO L93 Difference]: Finished difference Result 4702 states and 13602 transitions. [2019-12-18 13:22:57,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:22:57,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-18 13:22:57,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:57,096 INFO L225 Difference]: With dead ends: 4702 [2019-12-18 13:22:57,097 INFO L226 Difference]: Without dead ends: 3062 [2019-12-18 13:22:57,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:22:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2019-12-18 13:22:57,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 1755. [2019-12-18 13:22:57,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1755 states. [2019-12-18 13:22:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 5105 transitions. [2019-12-18 13:22:57,149 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 5105 transitions. Word has length 48 [2019-12-18 13:22:57,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:57,149 INFO L462 AbstractCegarLoop]: Abstraction has 1755 states and 5105 transitions. [2019-12-18 13:22:57,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:22:57,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 5105 transitions. [2019-12-18 13:22:57,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 13:22:57,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:57,155 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] [2019-12-18 13:22:57,156 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:22:57,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:57,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1923718495, now seen corresponding path program 2 times [2019-12-18 13:22:57,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:57,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906496584] [2019-12-18 13:22:57,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:57,249 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 13:22:57,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906496584] [2019-12-18 13:22:57,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:57,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:22:57,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879403395] [2019-12-18 13:22:57,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:22:57,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:57,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:22:57,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:22:57,255 INFO L87 Difference]: Start difference. First operand 1755 states and 5105 transitions. Second operand 4 states. [2019-12-18 13:22:57,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:57,289 INFO L93 Difference]: Finished difference Result 2211 states and 6131 transitions. [2019-12-18 13:22:57,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:22:57,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-18 13:22:57,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:57,291 INFO L225 Difference]: With dead ends: 2211 [2019-12-18 13:22:57,291 INFO L226 Difference]: Without dead ends: 504 [2019-12-18 13:22:57,292 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 13:22:57,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-12-18 13:22:57,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-12-18 13:22:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-12-18 13:22:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1111 transitions. [2019-12-18 13:22:57,302 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1111 transitions. Word has length 48 [2019-12-18 13:22:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:57,303 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 1111 transitions. [2019-12-18 13:22:57,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:22:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1111 transitions. [2019-12-18 13:22:57,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 13:22:57,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:57,305 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] [2019-12-18 13:22:57,305 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:22:57,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:57,306 INFO L82 PathProgramCache]: Analyzing trace with hash -126758993, now seen corresponding path program 3 times [2019-12-18 13:22:57,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:57,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247300765] [2019-12-18 13:22:57,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:57,447 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 13:22:57,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247300765] [2019-12-18 13:22:57,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:57,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:22:57,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446013714] [2019-12-18 13:22:57,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:22:57,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:57,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:22:57,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:22:57,452 INFO L87 Difference]: Start difference. First operand 504 states and 1111 transitions. Second operand 7 states. [2019-12-18 13:22:57,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:57,599 INFO L93 Difference]: Finished difference Result 892 states and 1938 transitions. [2019-12-18 13:22:57,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:22:57,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-18 13:22:57,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:57,601 INFO L225 Difference]: With dead ends: 892 [2019-12-18 13:22:57,601 INFO L226 Difference]: Without dead ends: 594 [2019-12-18 13:22:57,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:22:57,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-12-18 13:22:57,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 536. [2019-12-18 13:22:57,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-18 13:22:57,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1171 transitions. [2019-12-18 13:22:57,610 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1171 transitions. Word has length 48 [2019-12-18 13:22:57,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:57,612 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1171 transitions. [2019-12-18 13:22:57,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:22:57,612 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1171 transitions. [2019-12-18 13:22:57,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 13:22:57,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:57,613 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:22:57,614 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:22:57,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:57,614 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 4 times [2019-12-18 13:22:57,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:57,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671432916] [2019-12-18 13:22:57,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:22:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:22:57,784 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:22:57,785 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:22:57,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_107| 0 0))) (and (= v_~x~0_71 0) (= 0 v_~weak$$choice0~0_10) (= v_~z$w_buff0_used~0_514 0) (= |v_#memory_int_27| (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t989~0.base_59| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t989~0.base_59|) |v_ULTIMATE.start_main_~#t989~0.offset_37| 0))) (= 0 v_~z$r_buff1_thd3~0_207) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~z$flush_delayed~0_37) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t989~0.base_59| 4)) (= v_~z$mem_tmp~0_16 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t989~0.base_59|)) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t989~0.base_59|) (= v_~y~0_19 0) (= v_~z$w_buff0~0_183 0) (= 0 |v_ULTIMATE.start_main_~#t989~0.offset_37|) (= 0 v_~z$r_buff1_thd1~0_59) (= (store .cse0 |v_ULTIMATE.start_main_~#t989~0.base_59| 1) |v_#valid_105|) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_87) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd0~0_132 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_116 0) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~z$r_buff0_thd3~0_266) (= 0 v_~__unbuffered_p3_EBX~0_88) (= 0 v_~weak$$choice2~0_95) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_107|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t991~0.offset=|v_ULTIMATE.start_main_~#t991~0.offset_23|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_87, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ULTIMATE.start_main_~#t990~0.base=|v_ULTIMATE.start_main_~#t990~0.base_56|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_71, ULTIMATE.start_main_~#t989~0.base=|v_ULTIMATE.start_main_~#t989~0.base_59|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t990~0.offset=|v_ULTIMATE.start_main_~#t990~0.offset_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_132, ULTIMATE.start_main_~#t991~0.base=|v_ULTIMATE.start_main_~#t991~0.base_32|, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_207, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ULTIMATE.start_main_~#t992~0.base=|v_ULTIMATE.start_main_~#t992~0.base_32|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_88, ULTIMATE.start_main_~#t989~0.offset=|v_ULTIMATE.start_main_~#t989~0.offset_37|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_91|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_38|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_116, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58, ULTIMATE.start_main_~#t992~0.offset=|v_ULTIMATE.start_main_~#t992~0.offset_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t991~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t990~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t989~0.base, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t990~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t991~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t992~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t989~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t992~0.offset] because there is no mapped edge [2019-12-18 13:22:57,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t990~0.base_11| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t990~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t990~0.offset_10| 0) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t990~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t990~0.base_11|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t990~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t990~0.base_11|) |v_ULTIMATE.start_main_~#t990~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t990~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t990~0.base=|v_ULTIMATE.start_main_~#t990~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t990~0.offset=|v_ULTIMATE.start_main_~#t990~0.offset_10|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t990~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t990~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 13:22:57,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t991~0.base_12| 1) |v_#valid_46|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t991~0.base_12| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t991~0.base_12|)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t991~0.base_12|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t991~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t991~0.base_12|) |v_ULTIMATE.start_main_~#t991~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t991~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t991~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t991~0.offset=|v_ULTIMATE.start_main_~#t991~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t991~0.base=|v_ULTIMATE.start_main_~#t991~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t991~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t991~0.base, #length] because there is no mapped edge [2019-12-18 13:22:57,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t992~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t992~0.base_12|) |v_ULTIMATE.start_main_~#t992~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t992~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t992~0.base_12| 0)) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t992~0.base_12| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t992~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t992~0.offset_10|) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t992~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|, ULTIMATE.start_main_~#t992~0.base=|v_ULTIMATE.start_main_~#t992~0.base_12|, ULTIMATE.start_main_~#t992~0.offset=|v_ULTIMATE.start_main_~#t992~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, #length, ULTIMATE.start_main_~#t992~0.base, ULTIMATE.start_main_~#t992~0.offset] because there is no mapped edge [2019-12-18 13:22:57,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~b~0_In-734335472 ~__unbuffered_p3_EBX~0_Out-734335472) (= ~z$r_buff0_thd2~0_In-734335472 ~z$r_buff1_thd2~0_Out-734335472) (= ~z$r_buff1_thd3~0_Out-734335472 ~z$r_buff0_thd3~0_In-734335472) (= 1 ~a~0_Out-734335472) (= ~z$r_buff0_thd1~0_In-734335472 ~z$r_buff1_thd1~0_Out-734335472) (= 1 ~z$r_buff0_thd4~0_Out-734335472) (not (= P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-734335472 0)) (= ~z$r_buff0_thd4~0_In-734335472 ~z$r_buff1_thd4~0_Out-734335472) (= ~z$r_buff1_thd0~0_Out-734335472 ~z$r_buff0_thd0~0_In-734335472) (= ~__unbuffered_p3_EAX~0_Out-734335472 ~a~0_Out-734335472)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-734335472, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-734335472, ~b~0=~b~0_In-734335472, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-734335472, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-734335472, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-734335472, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-734335472} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-734335472, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-734335472, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-734335472, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-734335472, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-734335472, ~a~0=~a~0_Out-734335472, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-734335472, ~b~0=~b~0_In-734335472, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-734335472, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-734335472, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-734335472, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-734335472, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-734335472, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-734335472, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-734335472} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 13:22:57,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~x~0_36 1) (= v_P0Thread1of1ForFork3_~arg.base_22 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_22) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_~b~0_48 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|} OutVars{~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_22, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_22, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-18 13:22:57,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_~y~0_15 v_~__unbuffered_p1_EAX~0_14) (= v_P1Thread1of1ForFork0_~arg.base_11 |v_P1Thread1of1ForFork0_#in~arg.base_11|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_23 2) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~y~0=v_~y~0_15} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_11, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_15, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-18 13:22:57,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1710124505 256)))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite8_Out1710124505| |P2Thread1of1ForFork1_#t~ite9_Out1710124505|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1710124505 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1710124505 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In1710124505 256)) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In1710124505 256)) .cse1))) (= |P2Thread1of1ForFork1_#t~ite8_Out1710124505| ~z$w_buff0~0_In1710124505)) (and (not .cse0) (= ~z$w_buff0~0_In1710124505 |P2Thread1of1ForFork1_#t~ite9_Out1710124505|) (= |P2Thread1of1ForFork1_#t~ite8_In1710124505| |P2Thread1of1ForFork1_#t~ite8_Out1710124505|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1710124505, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1710124505, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1710124505, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1710124505, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1710124505, ~weak$$choice2~0=~weak$$choice2~0_In1710124505, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In1710124505|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In1710124505, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1710124505, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1710124505, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1710124505, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1710124505, ~weak$$choice2~0=~weak$$choice2~0_In1710124505, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out1710124505|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out1710124505|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 13:22:57,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1339155983 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite11_Out1339155983| ~z$w_buff1~0_In1339155983) .cse0 (= |P2Thread1of1ForFork1_#t~ite11_Out1339155983| |P2Thread1of1ForFork1_#t~ite12_Out1339155983|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1339155983 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In1339155983 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In1339155983 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1339155983 256)))))) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite11_In1339155983| |P2Thread1of1ForFork1_#t~ite11_Out1339155983|) (= |P2Thread1of1ForFork1_#t~ite12_Out1339155983| ~z$w_buff1~0_In1339155983)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1339155983, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1339155983, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In1339155983|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1339155983, ~z$w_buff1~0=~z$w_buff1~0_In1339155983, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1339155983, ~weak$$choice2~0=~weak$$choice2~0_In1339155983} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1339155983, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1339155983|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1339155983, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1339155983|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1339155983, ~z$w_buff1~0=~z$w_buff1~0_In1339155983, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1339155983, ~weak$$choice2~0=~weak$$choice2~0_In1339155983} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 13:22:57,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1180523042 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1180523042 256) 0))) (or (= (mod ~z$w_buff0_used~0_In1180523042 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In1180523042 256) 0)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1180523042 256))))) (= |P2Thread1of1ForFork1_#t~ite14_Out1180523042| ~z$w_buff0_used~0_In1180523042) (= |P2Thread1of1ForFork1_#t~ite14_Out1180523042| |P2Thread1of1ForFork1_#t~ite15_Out1180523042|)) (and (= ~z$w_buff0_used~0_In1180523042 |P2Thread1of1ForFork1_#t~ite15_Out1180523042|) (= |P2Thread1of1ForFork1_#t~ite14_In1180523042| |P2Thread1of1ForFork1_#t~ite14_Out1180523042|) (not .cse0)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In1180523042|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1180523042, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1180523042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1180523042, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1180523042, ~weak$$choice2~0=~weak$$choice2~0_In1180523042} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1180523042|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out1180523042|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1180523042, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1180523042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1180523042, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1180523042, ~weak$$choice2~0=~weak$$choice2~0_In1180523042} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-18 13:22:57,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_11|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-18 13:22:57,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1795709488 256) 0))) (or (and (= ~z$r_buff1_thd3~0_In-1795709488 |P2Thread1of1ForFork1_#t~ite23_Out-1795709488|) (= |P2Thread1of1ForFork1_#t~ite24_Out-1795709488| |P2Thread1of1ForFork1_#t~ite23_Out-1795709488|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1795709488 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In-1795709488 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-1795709488 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-1795709488 256))))) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite23_In-1795709488| |P2Thread1of1ForFork1_#t~ite23_Out-1795709488|) (= |P2Thread1of1ForFork1_#t~ite24_Out-1795709488| ~z$r_buff1_thd3~0_In-1795709488)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1795709488, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1795709488, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In-1795709488|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1795709488, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1795709488, ~weak$$choice2~0=~weak$$choice2~0_In-1795709488} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out-1795709488|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1795709488, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1795709488, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out-1795709488|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1795709488, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1795709488, ~weak$$choice2~0=~weak$$choice2~0_In-1795709488} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-18 13:22:57,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 13:22:57,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-498826856 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-498826856 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork2_#t~ite28_Out-498826856|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-498826856 |P3Thread1of1ForFork2_#t~ite28_Out-498826856|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-498826856, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-498826856} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-498826856|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-498826856, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-498826856} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 13:22:57,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In1560248254 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1560248254 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1560248254 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1560248254 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite29_Out1560248254|)) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1560248254 |P3Thread1of1ForFork2_#t~ite29_Out1560248254|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1560248254, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1560248254, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1560248254, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1560248254} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1560248254|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1560248254, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1560248254, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1560248254, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1560248254} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 13:22:57,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1479633150 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1479633150 256)))) (or (and (= ~z$r_buff0_thd4~0_Out1479633150 ~z$r_buff0_thd4~0_In1479633150) (or .cse0 .cse1)) (and (= 0 ~z$r_buff0_thd4~0_Out1479633150) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1479633150, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1479633150} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1479633150, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1479633150, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out1479633150|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-18 13:22:57,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In195913890 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In195913890 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In195913890 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In195913890 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite31_Out195913890| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork2_#t~ite31_Out195913890| ~z$r_buff1_thd4~0_In195913890) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In195913890, ~z$w_buff0_used~0=~z$w_buff0_used~0_In195913890, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In195913890, ~z$w_buff1_used~0=~z$w_buff1_used~0_In195913890} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In195913890, ~z$w_buff0_used~0=~z$w_buff0_used~0_In195913890, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In195913890, ~z$w_buff1_used~0=~z$w_buff1_used~0_In195913890, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out195913890|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 13:22:57,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_44| v_~z$r_buff1_thd4~0_62)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_44|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_43|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 13:22:57,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 13:22:57,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1704078368 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1704078368 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite36_Out1704078368| |ULTIMATE.start_main_#t~ite37_Out1704078368|))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In1704078368 |ULTIMATE.start_main_#t~ite36_Out1704078368|)) (and (not .cse1) (not .cse0) .cse2 (= ~z$w_buff1~0_In1704078368 |ULTIMATE.start_main_#t~ite36_Out1704078368|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1704078368, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1704078368, ~z$w_buff1~0=~z$w_buff1~0_In1704078368, ~z~0=~z~0_In1704078368} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1704078368, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1704078368, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1704078368|, ~z$w_buff1~0=~z$w_buff1~0_In1704078368, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1704078368|, ~z~0=~z~0_In1704078368} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 13:22:57,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In2116058524 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In2116058524 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out2116058524| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out2116058524| ~z$w_buff0_used~0_In2116058524) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2116058524, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2116058524} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2116058524, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2116058524, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out2116058524|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 13:22:57,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-2004897119 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2004897119 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2004897119 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-2004897119 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-2004897119|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-2004897119 |ULTIMATE.start_main_#t~ite39_Out-2004897119|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2004897119, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2004897119, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2004897119, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2004897119} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2004897119, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-2004897119|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2004897119, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2004897119, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2004897119} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 13:22:57,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In309020535 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In309020535 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out309020535| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out309020535| ~z$r_buff0_thd0~0_In309020535)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In309020535, ~z$w_buff0_used~0=~z$w_buff0_used~0_In309020535} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In309020535, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out309020535|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In309020535} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 13:22:57,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In850972390 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In850972390 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In850972390 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In850972390 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite41_Out850972390| ~z$r_buff1_thd0~0_In850972390)) (and (= |ULTIMATE.start_main_#t~ite41_Out850972390| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In850972390, ~z$w_buff0_used~0=~z$w_buff0_used~0_In850972390, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In850972390, ~z$w_buff1_used~0=~z$w_buff1_used~0_In850972390} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out850972390|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In850972390, ~z$w_buff0_used~0=~z$w_buff0_used~0_In850972390, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In850972390, ~z$w_buff1_used~0=~z$w_buff1_used~0_In850972390} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 13:22:57,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 0) (= v_~x~0_41 2) (= 0 v_~__unbuffered_p2_EAX~0_17)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:22:57,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:22:57 BasicIcfg [2019-12-18 13:22:57,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:22:57,926 INFO L168 Benchmark]: Toolchain (without parser) took 26972.26 ms. Allocated memory was 138.9 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 102.4 MB in the beginning and 795.2 MB in the end (delta: -692.8 MB). Peak memory consumption was 566.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:22:57,926 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 13:22:57,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.47 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.9 MB in the beginning and 156.4 MB in the end (delta: -54.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:22:57,927 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.86 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.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 13:22:57,931 INFO L168 Benchmark]: Boogie Preprocessor took 36.68 ms. Allocated memory is still 202.9 MB. Free memory was 153.5 MB in the beginning and 151.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:22:57,932 INFO L168 Benchmark]: RCFGBuilder took 833.68 ms. Allocated memory is still 202.9 MB. Free memory was 151.6 MB in the beginning and 105.1 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:22:57,933 INFO L168 Benchmark]: TraceAbstraction took 25283.04 ms. Allocated memory was 202.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 105.1 MB in the beginning and 795.2 MB in the end (delta: -690.1 MB). Peak memory consumption was 504.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:22:57,938 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 138.9 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 726.47 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.9 MB in the beginning and 156.4 MB in the end (delta: -54.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 81.86 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.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 36.68 ms. Allocated memory is still 202.9 MB. Free memory was 153.5 MB in the beginning and 151.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 833.68 ms. Allocated memory is still 202.9 MB. Free memory was 151.6 MB in the beginning and 105.1 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25283.04 ms. Allocated memory was 202.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 105.1 MB in the beginning and 795.2 MB in the end (delta: -690.1 MB). Peak memory consumption was 504.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 5751 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 169 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 44168 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t989, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t990, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t991, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t992, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 24.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1952 SDtfs, 2485 SDslu, 3382 SDs, 0 SdLazy, 1174 SolverSat, 171 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30378occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 17217 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 518 NumberOfCodeBlocks, 518 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 38473 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...