/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:45:50,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:45:50,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:45:50,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:45:50,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:45:50,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:45:50,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:45:50,783 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:45:50,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:45:50,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:45:50,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:45:50,794 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:45:50,794 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:45:50,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:45:50,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:45:50,799 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:45:50,801 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:45:50,802 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:45:50,803 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:45:50,808 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:45:50,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:45:50,816 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:45:50,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:45:50,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:45:50,822 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:45:50,822 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:45:50,823 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:45:50,824 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:45:50,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:45:50,827 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:45:50,827 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:45:50,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:45:50,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:45:50,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:45:50,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:45:50,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:45:50,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:45:50,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:45:50,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:45:50,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:45:50,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:45:50,837 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 20:45:50,863 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:45:50,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:45:50,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:45:50,865 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:45:50,865 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:45:50,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:45:50,865 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:45:50,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:45:50,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:45:50,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:45:50,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:45:50,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:45:50,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:45:50,867 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:45:50,867 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:45:50,867 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:45:50,867 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:45:50,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:45:50,868 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:45:50,868 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:45:50,868 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:45:50,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:45:50,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:45:50,869 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:45:50,869 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:45:50,869 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:45:50,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:45:50,869 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:45:50,870 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:45:50,870 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:45:50,870 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:45:50,870 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:45:51,150 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:45:51,169 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:45:51,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:45:51,174 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:45:51,174 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:45:51,175 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_rmo.opt.i [2019-12-27 20:45:51,237 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d90fa75ff/59189298218d47f6bb60f3ebbbac1476/FLAG39f4dfc50 [2019-12-27 20:45:51,793 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:45:51,794 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_rmo.opt.i [2019-12-27 20:45:51,810 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d90fa75ff/59189298218d47f6bb60f3ebbbac1476/FLAG39f4dfc50 [2019-12-27 20:45:52,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d90fa75ff/59189298218d47f6bb60f3ebbbac1476 [2019-12-27 20:45:52,107 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:45:52,108 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:45:52,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:45:52,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:45:52,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:45:52,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:45:52" (1/1) ... [2019-12-27 20:45:52,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bfdc9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:52, skipping insertion in model container [2019-12-27 20:45:52,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:45:52" (1/1) ... [2019-12-27 20:45:52,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:45:52,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:45:52,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:45:52,790 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:45:52,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:45:52,952 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:45:52,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:52 WrapperNode [2019-12-27 20:45:52,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:45:52,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:45:52,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:45:52,954 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:45:52,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:52" (1/1) ... [2019-12-27 20:45:52,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:52" (1/1) ... [2019-12-27 20:45:53,032 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:45:53,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:45:53,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:45:53,033 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:45:53,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:52" (1/1) ... [2019-12-27 20:45:53,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:52" (1/1) ... [2019-12-27 20:45:53,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:52" (1/1) ... [2019-12-27 20:45:53,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:52" (1/1) ... [2019-12-27 20:45:53,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:52" (1/1) ... [2019-12-27 20:45:53,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:52" (1/1) ... [2019-12-27 20:45:53,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:52" (1/1) ... [2019-12-27 20:45:53,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:45:53,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:45:53,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:45:53,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:45:53,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:45:53,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:45:53,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:45:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:45:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:45:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:45:53,144 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:45:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:45:53,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:45:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:45:53,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:45:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:45:53,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:45:53,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:45:53,148 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 20:45:53,968 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:45:53,968 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:45:53,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:45:53 BoogieIcfgContainer [2019-12-27 20:45:53,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:45:53,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:45:53,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:45:53,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:45:53,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:45:52" (1/3) ... [2019-12-27 20:45:53,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d2f42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:45:53, skipping insertion in model container [2019-12-27 20:45:53,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:52" (2/3) ... [2019-12-27 20:45:53,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d2f42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:45:53, skipping insertion in model container [2019-12-27 20:45:53,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:45:53" (3/3) ... [2019-12-27 20:45:53,979 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_rmo.opt.i [2019-12-27 20:45:53,990 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:45:53,990 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:45:54,003 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:45:54,004 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:45:54,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,081 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,082 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,097 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,097 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,099 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,100 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,101 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,110 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,110 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,128 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,129 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,139 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,139 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,140 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,143 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,144 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:54,160 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:45:54,181 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:45:54,181 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:45:54,181 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:45:54,181 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:45:54,181 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:45:54,182 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:45:54,182 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:45:54,182 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:45:54,198 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 20:45:54,199 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 20:45:54,305 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 20:45:54,305 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:45:54,320 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:45:54,343 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 20:45:54,397 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 20:45:54,397 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:45:54,405 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:45:54,425 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 20:45:54,426 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:45:57,736 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 20:45:57,874 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 20:45:57,905 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82846 [2019-12-27 20:45:57,906 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 20:45:57,910 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 97 places, 110 transitions [2019-12-27 20:46:18,685 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 125660 states. [2019-12-27 20:46:18,686 INFO L276 IsEmpty]: Start isEmpty. Operand 125660 states. [2019-12-27 20:46:18,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 20:46:18,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:46:18,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 20:46:18,694 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:46:18,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:46:18,699 INFO L82 PathProgramCache]: Analyzing trace with hash 807924105, now seen corresponding path program 1 times [2019-12-27 20:46:18,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:46:18,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003629480] [2019-12-27 20:46:18,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:46:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:46:18,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:46:18,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003629480] [2019-12-27 20:46:18,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:46:18,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:46:18,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1644135961] [2019-12-27 20:46:18,983 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:46:18,990 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:46:19,005 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 20:46:19,005 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:46:19,009 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:46:19,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:46:19,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:46:19,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:46:19,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:46:19,028 INFO L87 Difference]: Start difference. First operand 125660 states. Second operand 3 states. [2019-12-27 20:46:20,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:46:20,171 INFO L93 Difference]: Finished difference Result 125096 states and 540334 transitions. [2019-12-27 20:46:20,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:46:20,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 20:46:20,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:46:24,077 INFO L225 Difference]: With dead ends: 125096 [2019-12-27 20:46:24,077 INFO L226 Difference]: Without dead ends: 122548 [2019-12-27 20:46:24,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:46:28,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122548 states. [2019-12-27 20:46:31,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122548 to 122548. [2019-12-27 20:46:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122548 states. [2019-12-27 20:46:35,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122548 states to 122548 states and 529960 transitions. [2019-12-27 20:46:35,749 INFO L78 Accepts]: Start accepts. Automaton has 122548 states and 529960 transitions. Word has length 5 [2019-12-27 20:46:35,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:46:35,750 INFO L462 AbstractCegarLoop]: Abstraction has 122548 states and 529960 transitions. [2019-12-27 20:46:35,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:46:35,750 INFO L276 IsEmpty]: Start isEmpty. Operand 122548 states and 529960 transitions. [2019-12-27 20:46:35,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:46:35,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:46:35,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:46:35,753 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:46:35,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:46:35,754 INFO L82 PathProgramCache]: Analyzing trace with hash 311209173, now seen corresponding path program 1 times [2019-12-27 20:46:35,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:46:35,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132876630] [2019-12-27 20:46:35,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:46:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:46:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:46:35,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132876630] [2019-12-27 20:46:35,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:46:35,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:46:35,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1471794581] [2019-12-27 20:46:35,880 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:46:35,881 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:46:35,886 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 20:46:35,886 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:46:35,922 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:46:35,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:46:35,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:46:35,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:46:35,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:46:35,925 INFO L87 Difference]: Start difference. First operand 122548 states and 529960 transitions. Second operand 5 states. [2019-12-27 20:46:42,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:46:42,158 INFO L93 Difference]: Finished difference Result 196578 states and 812188 transitions. [2019-12-27 20:46:42,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:46:42,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 20:46:42,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:46:42,844 INFO L225 Difference]: With dead ends: 196578 [2019-12-27 20:46:42,844 INFO L226 Difference]: Without dead ends: 196529 [2019-12-27 20:46:42,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:46:48,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196529 states. [2019-12-27 20:46:52,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196529 to 180333. [2019-12-27 20:46:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180333 states. [2019-12-27 20:46:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180333 states to 180333 states and 754389 transitions. [2019-12-27 20:46:53,232 INFO L78 Accepts]: Start accepts. Automaton has 180333 states and 754389 transitions. Word has length 11 [2019-12-27 20:46:53,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:46:53,233 INFO L462 AbstractCegarLoop]: Abstraction has 180333 states and 754389 transitions. [2019-12-27 20:46:53,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:46:53,233 INFO L276 IsEmpty]: Start isEmpty. Operand 180333 states and 754389 transitions. [2019-12-27 20:46:53,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:46:53,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:46:53,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:46:53,240 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:46:53,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:46:53,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1817604182, now seen corresponding path program 1 times [2019-12-27 20:46:53,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:46:53,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336184613] [2019-12-27 20:46:53,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:46:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:46:53,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:46:53,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336184613] [2019-12-27 20:46:53,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:46:53,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:46:53,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1468621069] [2019-12-27 20:46:53,340 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:46:53,341 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:46:53,343 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:46:53,343 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:46:53,343 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:46:53,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:46:53,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:46:53,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:46:53,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:46:53,344 INFO L87 Difference]: Start difference. First operand 180333 states and 754389 transitions. Second operand 4 states. [2019-12-27 20:47:00,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:00,845 INFO L93 Difference]: Finished difference Result 255988 states and 1044211 transitions. [2019-12-27 20:47:00,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:47:00,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 20:47:00,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:01,838 INFO L225 Difference]: With dead ends: 255988 [2019-12-27 20:47:01,838 INFO L226 Difference]: Without dead ends: 255925 [2019-12-27 20:47:01,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:47:09,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255925 states. [2019-12-27 20:47:20,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255925 to 217043. [2019-12-27 20:47:20,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217043 states. [2019-12-27 20:47:20,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217043 states to 217043 states and 900881 transitions. [2019-12-27 20:47:20,742 INFO L78 Accepts]: Start accepts. Automaton has 217043 states and 900881 transitions. Word has length 13 [2019-12-27 20:47:20,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:20,743 INFO L462 AbstractCegarLoop]: Abstraction has 217043 states and 900881 transitions. [2019-12-27 20:47:20,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:47:20,743 INFO L276 IsEmpty]: Start isEmpty. Operand 217043 states and 900881 transitions. [2019-12-27 20:47:20,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:47:20,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:20,747 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:47:20,747 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:20,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:20,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1719204338, now seen corresponding path program 1 times [2019-12-27 20:47:20,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:20,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270869943] [2019-12-27 20:47:20,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:20,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:47:20,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270869943] [2019-12-27 20:47:20,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:20,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:47:20,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [608924211] [2019-12-27 20:47:20,814 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:20,818 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:20,819 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:47:20,819 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:20,820 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:47:20,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:47:20,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:20,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:47:20,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:47:20,821 INFO L87 Difference]: Start difference. First operand 217043 states and 900881 transitions. Second operand 3 states. [2019-12-27 20:47:20,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:20,964 INFO L93 Difference]: Finished difference Result 41850 states and 136635 transitions. [2019-12-27 20:47:20,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:47:20,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:47:20,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:21,031 INFO L225 Difference]: With dead ends: 41850 [2019-12-27 20:47:21,031 INFO L226 Difference]: Without dead ends: 41850 [2019-12-27 20:47:21,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:47:21,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41850 states. [2019-12-27 20:47:22,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41850 to 41850. [2019-12-27 20:47:22,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41850 states. [2019-12-27 20:47:23,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41850 states to 41850 states and 136635 transitions. [2019-12-27 20:47:23,080 INFO L78 Accepts]: Start accepts. Automaton has 41850 states and 136635 transitions. Word has length 13 [2019-12-27 20:47:23,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:23,080 INFO L462 AbstractCegarLoop]: Abstraction has 41850 states and 136635 transitions. [2019-12-27 20:47:23,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:47:23,080 INFO L276 IsEmpty]: Start isEmpty. Operand 41850 states and 136635 transitions. [2019-12-27 20:47:23,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 20:47:23,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:23,085 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:47:23,085 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:23,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:23,086 INFO L82 PathProgramCache]: Analyzing trace with hash 565965362, now seen corresponding path program 1 times [2019-12-27 20:47:23,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:23,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83411326] [2019-12-27 20:47:23,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:47:23,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83411326] [2019-12-27 20:47:23,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:23,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:47:23,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [626559162] [2019-12-27 20:47:23,161 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:23,164 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:23,171 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 83 transitions. [2019-12-27 20:47:23,171 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:23,228 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:47:23,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:47:23,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:23,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:47:23,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:47:23,230 INFO L87 Difference]: Start difference. First operand 41850 states and 136635 transitions. Second operand 7 states. [2019-12-27 20:47:24,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:24,109 INFO L93 Difference]: Finished difference Result 56420 states and 180098 transitions. [2019-12-27 20:47:24,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:47:24,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 20:47:24,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:24,199 INFO L225 Difference]: With dead ends: 56420 [2019-12-27 20:47:24,199 INFO L226 Difference]: Without dead ends: 56407 [2019-12-27 20:47:24,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:47:24,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56407 states. [2019-12-27 20:47:27,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56407 to 42107. [2019-12-27 20:47:27,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42107 states. [2019-12-27 20:47:27,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42107 states to 42107 states and 137336 transitions. [2019-12-27 20:47:27,952 INFO L78 Accepts]: Start accepts. Automaton has 42107 states and 137336 transitions. Word has length 19 [2019-12-27 20:47:27,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:27,952 INFO L462 AbstractCegarLoop]: Abstraction has 42107 states and 137336 transitions. [2019-12-27 20:47:27,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:47:27,953 INFO L276 IsEmpty]: Start isEmpty. Operand 42107 states and 137336 transitions. [2019-12-27 20:47:27,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:47:27,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:27,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:47:27,966 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:27,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:27,967 INFO L82 PathProgramCache]: Analyzing trace with hash 967390355, now seen corresponding path program 1 times [2019-12-27 20:47:27,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:27,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758386534] [2019-12-27 20:47:27,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:28,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:47:28,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758386534] [2019-12-27 20:47:28,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:28,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:47:28,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1718436880] [2019-12-27 20:47:28,041 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:28,045 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:28,059 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 121 transitions. [2019-12-27 20:47:28,060 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:28,108 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:47:28,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:47:28,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:28,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:47:28,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:47:28,109 INFO L87 Difference]: Start difference. First operand 42107 states and 137336 transitions. Second operand 6 states. [2019-12-27 20:47:28,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:28,164 INFO L93 Difference]: Finished difference Result 7672 states and 21026 transitions. [2019-12-27 20:47:28,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:47:28,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 20:47:28,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:28,178 INFO L225 Difference]: With dead ends: 7672 [2019-12-27 20:47:28,178 INFO L226 Difference]: Without dead ends: 7672 [2019-12-27 20:47:28,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:47:28,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7672 states. [2019-12-27 20:47:28,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7672 to 7532. [2019-12-27 20:47:28,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7532 states. [2019-12-27 20:47:28,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7532 states to 7532 states and 20626 transitions. [2019-12-27 20:47:28,283 INFO L78 Accepts]: Start accepts. Automaton has 7532 states and 20626 transitions. Word has length 25 [2019-12-27 20:47:28,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:28,283 INFO L462 AbstractCegarLoop]: Abstraction has 7532 states and 20626 transitions. [2019-12-27 20:47:28,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:47:28,283 INFO L276 IsEmpty]: Start isEmpty. Operand 7532 states and 20626 transitions. [2019-12-27 20:47:28,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 20:47:28,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:28,295 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] [2019-12-27 20:47:28,296 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:28,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:28,296 INFO L82 PathProgramCache]: Analyzing trace with hash 628706666, now seen corresponding path program 1 times [2019-12-27 20:47:28,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:28,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913985772] [2019-12-27 20:47:28,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:47:28,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913985772] [2019-12-27 20:47:28,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:28,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:47:28,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1322185252] [2019-12-27 20:47:28,377 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:28,385 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:28,420 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 134 transitions. [2019-12-27 20:47:28,421 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:28,421 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:47:28,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:47:28,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:28,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:47:28,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:47:28,422 INFO L87 Difference]: Start difference. First operand 7532 states and 20626 transitions. Second operand 5 states. [2019-12-27 20:47:28,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:28,464 INFO L93 Difference]: Finished difference Result 5403 states and 15530 transitions. [2019-12-27 20:47:28,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:47:28,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 20:47:28,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:28,474 INFO L225 Difference]: With dead ends: 5403 [2019-12-27 20:47:28,474 INFO L226 Difference]: Without dead ends: 5403 [2019-12-27 20:47:28,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:47:28,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5403 states. [2019-12-27 20:47:28,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5403 to 4990. [2019-12-27 20:47:28,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4990 states. [2019-12-27 20:47:28,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4990 states to 4990 states and 14413 transitions. [2019-12-27 20:47:28,584 INFO L78 Accepts]: Start accepts. Automaton has 4990 states and 14413 transitions. Word has length 37 [2019-12-27 20:47:28,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:28,584 INFO L462 AbstractCegarLoop]: Abstraction has 4990 states and 14413 transitions. [2019-12-27 20:47:28,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:47:28,584 INFO L276 IsEmpty]: Start isEmpty. Operand 4990 states and 14413 transitions. [2019-12-27 20:47:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:47:28,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:28,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:47:28,596 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:28,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:28,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2046604178, now seen corresponding path program 1 times [2019-12-27 20:47:28,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:28,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080583917] [2019-12-27 20:47:28,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:47:28,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080583917] [2019-12-27 20:47:28,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:28,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:47:28,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [902800406] [2019-12-27 20:47:28,688 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:28,709 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:28,871 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 296 transitions. [2019-12-27 20:47:28,872 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:28,873 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:47:28,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:47:28,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:28,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:47:28,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:47:28,874 INFO L87 Difference]: Start difference. First operand 4990 states and 14413 transitions. Second operand 3 states. [2019-12-27 20:47:28,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:28,940 INFO L93 Difference]: Finished difference Result 4999 states and 14422 transitions. [2019-12-27 20:47:28,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:47:28,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 20:47:28,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:28,953 INFO L225 Difference]: With dead ends: 4999 [2019-12-27 20:47:28,953 INFO L226 Difference]: Without dead ends: 4999 [2019-12-27 20:47:28,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:47:28,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4999 states. [2019-12-27 20:47:29,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4999 to 4995. [2019-12-27 20:47:29,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4995 states. [2019-12-27 20:47:29,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4995 states to 4995 states and 14418 transitions. [2019-12-27 20:47:29,056 INFO L78 Accepts]: Start accepts. Automaton has 4995 states and 14418 transitions. Word has length 65 [2019-12-27 20:47:29,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:29,057 INFO L462 AbstractCegarLoop]: Abstraction has 4995 states and 14418 transitions. [2019-12-27 20:47:29,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:47:29,057 INFO L276 IsEmpty]: Start isEmpty. Operand 4995 states and 14418 transitions. [2019-12-27 20:47:29,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:47:29,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:29,066 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:47:29,066 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:29,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:29,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1953615188, now seen corresponding path program 1 times [2019-12-27 20:47:29,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:29,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249688006] [2019-12-27 20:47:29,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:47:29,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249688006] [2019-12-27 20:47:29,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:29,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:47:29,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1471358791] [2019-12-27 20:47:29,419 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:29,441 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:29,546 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 296 transitions. [2019-12-27 20:47:29,546 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:29,611 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:47:29,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:47:29,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:29,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:47:29,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:47:29,612 INFO L87 Difference]: Start difference. First operand 4995 states and 14418 transitions. Second operand 7 states. [2019-12-27 20:47:30,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:30,010 INFO L93 Difference]: Finished difference Result 7929 states and 22569 transitions. [2019-12-27 20:47:30,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:47:30,010 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 20:47:30,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:30,025 INFO L225 Difference]: With dead ends: 7929 [2019-12-27 20:47:30,025 INFO L226 Difference]: Without dead ends: 7929 [2019-12-27 20:47:30,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:47:30,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7929 states. [2019-12-27 20:47:30,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7929 to 5807. [2019-12-27 20:47:30,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5807 states. [2019-12-27 20:47:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5807 states to 5807 states and 16815 transitions. [2019-12-27 20:47:30,222 INFO L78 Accepts]: Start accepts. Automaton has 5807 states and 16815 transitions. Word has length 65 [2019-12-27 20:47:30,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:30,222 INFO L462 AbstractCegarLoop]: Abstraction has 5807 states and 16815 transitions. [2019-12-27 20:47:30,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:47:30,222 INFO L276 IsEmpty]: Start isEmpty. Operand 5807 states and 16815 transitions. [2019-12-27 20:47:30,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:47:30,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:30,235 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:47:30,235 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:30,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:30,235 INFO L82 PathProgramCache]: Analyzing trace with hash -353598434, now seen corresponding path program 2 times [2019-12-27 20:47:30,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:30,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505725895] [2019-12-27 20:47:30,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:30,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:47:30,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505725895] [2019-12-27 20:47:30,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:30,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:47:30,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [121548721] [2019-12-27 20:47:30,379 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:30,400 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:30,522 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 244 transitions. [2019-12-27 20:47:30,522 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:30,605 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 20:47:30,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:47:30,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:30,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:47:30,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:47:30,607 INFO L87 Difference]: Start difference. First operand 5807 states and 16815 transitions. Second operand 9 states. [2019-12-27 20:47:31,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:31,997 INFO L93 Difference]: Finished difference Result 13241 states and 38383 transitions. [2019-12-27 20:47:32,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 20:47:32,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 20:47:32,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:32,026 INFO L225 Difference]: With dead ends: 13241 [2019-12-27 20:47:32,026 INFO L226 Difference]: Without dead ends: 13241 [2019-12-27 20:47:32,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-12-27 20:47:32,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13241 states. [2019-12-27 20:47:32,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13241 to 6352. [2019-12-27 20:47:32,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6352 states. [2019-12-27 20:47:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6352 states to 6352 states and 18446 transitions. [2019-12-27 20:47:32,221 INFO L78 Accepts]: Start accepts. Automaton has 6352 states and 18446 transitions. Word has length 65 [2019-12-27 20:47:32,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:32,221 INFO L462 AbstractCegarLoop]: Abstraction has 6352 states and 18446 transitions. [2019-12-27 20:47:32,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:47:32,222 INFO L276 IsEmpty]: Start isEmpty. Operand 6352 states and 18446 transitions. [2019-12-27 20:47:32,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:47:32,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:32,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:47:32,233 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:32,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:32,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1550061698, now seen corresponding path program 3 times [2019-12-27 20:47:32,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:32,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279121551] [2019-12-27 20:47:32,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:32,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:47:32,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279121551] [2019-12-27 20:47:32,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:32,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:47:32,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2027324875] [2019-12-27 20:47:32,348 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:32,374 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:32,771 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 282 states and 560 transitions. [2019-12-27 20:47:32,771 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:32,968 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 20:47:32,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 20:47:32,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:32,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 20:47:32,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:47:32,969 INFO L87 Difference]: Start difference. First operand 6352 states and 18446 transitions. Second operand 13 states. [2019-12-27 20:47:35,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:35,227 INFO L93 Difference]: Finished difference Result 13864 states and 39378 transitions. [2019-12-27 20:47:35,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 20:47:35,228 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 20:47:35,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:35,249 INFO L225 Difference]: With dead ends: 13864 [2019-12-27 20:47:35,249 INFO L226 Difference]: Without dead ends: 13864 [2019-12-27 20:47:35,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=245, Invalid=567, Unknown=0, NotChecked=0, Total=812 [2019-12-27 20:47:35,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13864 states. [2019-12-27 20:47:35,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13864 to 6957. [2019-12-27 20:47:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6957 states. [2019-12-27 20:47:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6957 states to 6957 states and 19846 transitions. [2019-12-27 20:47:35,446 INFO L78 Accepts]: Start accepts. Automaton has 6957 states and 19846 transitions. Word has length 65 [2019-12-27 20:47:35,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:35,447 INFO L462 AbstractCegarLoop]: Abstraction has 6957 states and 19846 transitions. [2019-12-27 20:47:35,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 20:47:35,447 INFO L276 IsEmpty]: Start isEmpty. Operand 6957 states and 19846 transitions. [2019-12-27 20:47:35,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:47:35,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:35,456 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:47:35,456 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:35,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:35,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1062434320, now seen corresponding path program 4 times [2019-12-27 20:47:35,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:35,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679168974] [2019-12-27 20:47:35,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:35,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:47:35,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679168974] [2019-12-27 20:47:35,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:35,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:47:35,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [748818057] [2019-12-27 20:47:35,533 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:35,583 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:35,790 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 263 states and 507 transitions. [2019-12-27 20:47:35,791 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:35,797 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:47:35,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:47:35,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:35,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:47:35,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:47:35,798 INFO L87 Difference]: Start difference. First operand 6957 states and 19846 transitions. Second operand 4 states. [2019-12-27 20:47:35,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:35,841 INFO L93 Difference]: Finished difference Result 6366 states and 17934 transitions. [2019-12-27 20:47:35,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:47:35,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 20:47:35,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:35,849 INFO L225 Difference]: With dead ends: 6366 [2019-12-27 20:47:35,849 INFO L226 Difference]: Without dead ends: 6366 [2019-12-27 20:47:35,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:47:35,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6366 states. [2019-12-27 20:47:35,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6366 to 6198. [2019-12-27 20:47:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6198 states. [2019-12-27 20:47:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6198 states to 6198 states and 17468 transitions. [2019-12-27 20:47:35,963 INFO L78 Accepts]: Start accepts. Automaton has 6198 states and 17468 transitions. Word has length 65 [2019-12-27 20:47:35,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:35,963 INFO L462 AbstractCegarLoop]: Abstraction has 6198 states and 17468 transitions. [2019-12-27 20:47:35,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:47:35,963 INFO L276 IsEmpty]: Start isEmpty. Operand 6198 states and 17468 transitions. [2019-12-27 20:47:35,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:47:35,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:35,972 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:47:35,972 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:35,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:35,972 INFO L82 PathProgramCache]: Analyzing trace with hash 522553115, now seen corresponding path program 1 times [2019-12-27 20:47:35,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:35,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691754448] [2019-12-27 20:47:35,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:47:36,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691754448] [2019-12-27 20:47:36,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:36,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:47:36,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [259303781] [2019-12-27 20:47:36,076 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:36,095 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:36,240 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 287 transitions. [2019-12-27 20:47:36,241 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:36,254 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:47:36,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:47:36,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:36,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:47:36,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:47:36,255 INFO L87 Difference]: Start difference. First operand 6198 states and 17468 transitions. Second operand 6 states. [2019-12-27 20:47:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:36,662 INFO L93 Difference]: Finished difference Result 8237 states and 22950 transitions. [2019-12-27 20:47:36,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:47:36,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 20:47:36,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:36,674 INFO L225 Difference]: With dead ends: 8237 [2019-12-27 20:47:36,674 INFO L226 Difference]: Without dead ends: 8237 [2019-12-27 20:47:36,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:47:36,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8237 states. [2019-12-27 20:47:36,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8237 to 6534. [2019-12-27 20:47:36,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6534 states. [2019-12-27 20:47:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6534 states to 6534 states and 18400 transitions. [2019-12-27 20:47:36,772 INFO L78 Accepts]: Start accepts. Automaton has 6534 states and 18400 transitions. Word has length 66 [2019-12-27 20:47:36,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:36,772 INFO L462 AbstractCegarLoop]: Abstraction has 6534 states and 18400 transitions. [2019-12-27 20:47:36,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:47:36,772 INFO L276 IsEmpty]: Start isEmpty. Operand 6534 states and 18400 transitions. [2019-12-27 20:47:36,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:47:36,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:36,780 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:47:36,781 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:36,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:36,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1443851743, now seen corresponding path program 2 times [2019-12-27 20:47:36,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:36,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186937944] [2019-12-27 20:47:36,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:47:36,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186937944] [2019-12-27 20:47:36,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:36,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:47:36,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1107703148] [2019-12-27 20:47:36,861 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:36,880 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:37,081 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 232 states and 436 transitions. [2019-12-27 20:47:37,081 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:37,082 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:47:37,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:47:37,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:37,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:47:37,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:47:37,083 INFO L87 Difference]: Start difference. First operand 6534 states and 18400 transitions. Second operand 3 states. [2019-12-27 20:47:37,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:37,144 INFO L93 Difference]: Finished difference Result 6534 states and 18399 transitions. [2019-12-27 20:47:37,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:47:37,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 20:47:37,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:37,154 INFO L225 Difference]: With dead ends: 6534 [2019-12-27 20:47:37,154 INFO L226 Difference]: Without dead ends: 6534 [2019-12-27 20:47:37,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:47:37,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6534 states. [2019-12-27 20:47:37,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6534 to 4161. [2019-12-27 20:47:37,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4161 states. [2019-12-27 20:47:37,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4161 states to 4161 states and 11857 transitions. [2019-12-27 20:47:37,259 INFO L78 Accepts]: Start accepts. Automaton has 4161 states and 11857 transitions. Word has length 66 [2019-12-27 20:47:37,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:37,260 INFO L462 AbstractCegarLoop]: Abstraction has 4161 states and 11857 transitions. [2019-12-27 20:47:37,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:47:37,260 INFO L276 IsEmpty]: Start isEmpty. Operand 4161 states and 11857 transitions. [2019-12-27 20:47:37,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:47:37,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:37,268 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:47:37,268 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:37,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:37,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1668465747, now seen corresponding path program 1 times [2019-12-27 20:47:37,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:37,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904995103] [2019-12-27 20:47:37,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:37,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:47:37,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904995103] [2019-12-27 20:47:37,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:37,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:47:37,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [191165615] [2019-12-27 20:47:37,335 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:37,354 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:37,599 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 313 transitions. [2019-12-27 20:47:37,600 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:37,603 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:47:37,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:47:37,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:37,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:47:37,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:47:37,604 INFO L87 Difference]: Start difference. First operand 4161 states and 11857 transitions. Second operand 3 states. [2019-12-27 20:47:37,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:37,637 INFO L93 Difference]: Finished difference Result 3866 states and 10846 transitions. [2019-12-27 20:47:37,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:47:37,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 20:47:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:37,645 INFO L225 Difference]: With dead ends: 3866 [2019-12-27 20:47:37,645 INFO L226 Difference]: Without dead ends: 3866 [2019-12-27 20:47:37,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:47:37,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3866 states. [2019-12-27 20:47:37,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3866 to 3410. [2019-12-27 20:47:37,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3410 states. [2019-12-27 20:47:37,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3410 states to 3410 states and 9570 transitions. [2019-12-27 20:47:37,742 INFO L78 Accepts]: Start accepts. Automaton has 3410 states and 9570 transitions. Word has length 67 [2019-12-27 20:47:37,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:37,742 INFO L462 AbstractCegarLoop]: Abstraction has 3410 states and 9570 transitions. [2019-12-27 20:47:37,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:47:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3410 states and 9570 transitions. [2019-12-27 20:47:37,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 20:47:37,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:37,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:47:37,756 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:37,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:37,756 INFO L82 PathProgramCache]: Analyzing trace with hash 567215771, now seen corresponding path program 1 times [2019-12-27 20:47:37,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:37,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768109374] [2019-12-27 20:47:37,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:38,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:47:38,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768109374] [2019-12-27 20:47:38,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:38,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 20:47:38,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [963559296] [2019-12-27 20:47:38,030 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:38,047 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:38,212 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 312 transitions. [2019-12-27 20:47:38,212 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:38,361 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 20:47:38,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 20:47:38,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:38,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 20:47:38,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:47:38,363 INFO L87 Difference]: Start difference. First operand 3410 states and 9570 transitions. Second operand 14 states. [2019-12-27 20:47:40,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:40,238 INFO L93 Difference]: Finished difference Result 13123 states and 37053 transitions. [2019-12-27 20:47:40,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 20:47:40,239 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-27 20:47:40,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:40,247 INFO L225 Difference]: With dead ends: 13123 [2019-12-27 20:47:40,247 INFO L226 Difference]: Without dead ends: 5315 [2019-12-27 20:47:40,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=637, Unknown=0, NotChecked=0, Total=870 [2019-12-27 20:47:40,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5315 states. [2019-12-27 20:47:40,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5315 to 2822. [2019-12-27 20:47:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2019-12-27 20:47:40,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 7863 transitions. [2019-12-27 20:47:40,301 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 7863 transitions. Word has length 68 [2019-12-27 20:47:40,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:40,301 INFO L462 AbstractCegarLoop]: Abstraction has 2822 states and 7863 transitions. [2019-12-27 20:47:40,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 20:47:40,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 7863 transitions. [2019-12-27 20:47:40,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 20:47:40,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:40,304 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:47:40,304 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:40,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:40,304 INFO L82 PathProgramCache]: Analyzing trace with hash 823879635, now seen corresponding path program 2 times [2019-12-27 20:47:40,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:40,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075789274] [2019-12-27 20:47:40,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:40,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:47:40,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075789274] [2019-12-27 20:47:40,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:40,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:47:40,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1227225605] [2019-12-27 20:47:40,416 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:40,433 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:40,699 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 168 states and 265 transitions. [2019-12-27 20:47:40,699 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:40,700 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:47:40,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:47:40,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:40,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:47:40,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:47:40,702 INFO L87 Difference]: Start difference. First operand 2822 states and 7863 transitions. Second operand 5 states. [2019-12-27 20:47:40,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:40,769 INFO L93 Difference]: Finished difference Result 4679 states and 13028 transitions. [2019-12-27 20:47:40,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:47:40,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-27 20:47:40,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:40,773 INFO L225 Difference]: With dead ends: 4679 [2019-12-27 20:47:40,773 INFO L226 Difference]: Without dead ends: 1898 [2019-12-27 20:47:40,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:47:40,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2019-12-27 20:47:40,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1898. [2019-12-27 20:47:40,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2019-12-27 20:47:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 5237 transitions. [2019-12-27 20:47:40,821 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 5237 transitions. Word has length 68 [2019-12-27 20:47:40,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:40,821 INFO L462 AbstractCegarLoop]: Abstraction has 1898 states and 5237 transitions. [2019-12-27 20:47:40,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:47:40,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 5237 transitions. [2019-12-27 20:47:40,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 20:47:40,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:40,824 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:47:40,824 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:40,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:40,825 INFO L82 PathProgramCache]: Analyzing trace with hash -149569657, now seen corresponding path program 3 times [2019-12-27 20:47:40,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:40,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011015562] [2019-12-27 20:47:40,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:47:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:47:40,955 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:47:40,955 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:47:40,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t760~0.base_20| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t760~0.base_20|) |v_ULTIMATE.start_main_~#t760~0.offset_17| 0))) (= 0 v_~weak$$choice0~0_8) (= v_~x$r_buff1_thd2~0_17 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t760~0.base_20| 1) |v_#valid_55|) (= 0 v_~x$w_buff1~0_28) (= 0 v_~x$r_buff0_thd2~0_26) (= v_~x$flush_delayed~0_15 0) (= 0 v_~x$r_buff0_thd1~0_20) (= v_~main$tmp_guard1~0_11 0) (= v_~main$tmp_guard0~0_8 0) (= 0 v_~x$r_buff0_thd0~0_78) (= 0 |v_ULTIMATE.start_main_~#t760~0.offset_17|) (< 0 |v_#StackHeapBarrier_17|) (= v_~x~0_29 0) (= v_~__unbuffered_p2_EAX~0_8 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_18 0) (= v_~y~0_12 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t760~0.base_20|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~__unbuffered_cnt~0_19) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$w_buff1_used~0_72 0) (= v_~x$r_buff1_thd0~0_46 0) (= v_~__unbuffered_p2_EBX~0_8 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t760~0.base_20| 4) |v_#length_25|) (= |v_#NULL.offset_5| 0) (= 0 v_~z~0_9) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$w_buff0_used~0_118) (= 0 v_~x$r_buff0_thd3~0_19) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0~0_30) (= (select .cse0 |v_ULTIMATE.start_main_~#t760~0.base_20|) 0) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t760~0.base=|v_ULTIMATE.start_main_~#t760~0.base_20|, ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ~x$w_buff0~0=v_~x$w_buff0~0_30, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ULTIMATE.start_main_~#t761~0.offset=|v_ULTIMATE.start_main_~#t761~0.offset_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_78, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ~x$w_buff1~0=v_~x$w_buff1~0_28, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_29, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ULTIMATE.start_main_~#t760~0.offset=|v_ULTIMATE.start_main_~#t760~0.offset_17|, ~y~0=v_~y~0_12, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_46, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, ULTIMATE.start_main_~#t761~0.base=|v_ULTIMATE.start_main_~#t761~0.base_21|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t762~0.base=|v_ULTIMATE.start_main_~#t762~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_55|, ULTIMATE.start_main_~#t762~0.offset=|v_ULTIMATE.start_main_~#t762~0.offset_17|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t760~0.base, ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t761~0.offset, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t760~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t761~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t762~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t762~0.offset, #memory_int, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 20:47:40,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L810-1-->L812: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t761~0.base_13| 4) |v_#length_17|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t761~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t761~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t761~0.offset_11|) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t761~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t761~0.base_13|) |v_ULTIMATE.start_main_~#t761~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t761~0.base_13|)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t761~0.base_13| 1) |v_#valid_36|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t761~0.offset=|v_ULTIMATE.start_main_~#t761~0.offset_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t761~0.base=|v_ULTIMATE.start_main_~#t761~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t761~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t761~0.base] because there is no mapped edge [2019-12-27 20:47:40,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L812-1-->L814: Formula: (and (not (= |v_ULTIMATE.start_main_~#t762~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t762~0.offset_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t762~0.base_13| 4) |v_#length_15|) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t762~0.base_13|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t762~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t762~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t762~0.base_13|) |v_ULTIMATE.start_main_~#t762~0.offset_11| 2)) |v_#memory_int_13|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t762~0.base_13| 1) |v_#valid_34|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t762~0.base=|v_ULTIMATE.start_main_~#t762~0.base_13|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, ULTIMATE.start_main_~#t762~0.offset=|v_ULTIMATE.start_main_~#t762~0.offset_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t762~0.base, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_~#t762~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 20:47:40,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] P1ENTRY-->L4-3: Formula: (and (= v_~x$w_buff1_used~0_62 v_~x$w_buff0_used~0_105) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= v_~x$w_buff0~0_19 v_~x$w_buff1~0_20) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= 1 v_~x$w_buff0_used~0_104) (= (mod v_~x$w_buff1_used~0_62 256) 0) (= 2 v_~x$w_buff0~0_18) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~x$w_buff0~0=v_~x$w_buff0~0_18, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~x$w_buff1~0=v_~x$w_buff1~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 20:47:40,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L787-2-->L787-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1718230371 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In1718230371 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out1718230371| ~x$w_buff1~0_In1718230371) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out1718230371| ~x~0_In1718230371)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1718230371, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1718230371, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1718230371, ~x~0=~x~0_In1718230371} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1718230371|, ~x$w_buff1~0=~x$w_buff1~0_In1718230371, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1718230371, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1718230371, ~x~0=~x~0_In1718230371} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 20:47:40,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L787-4-->L788: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_19) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 20:47:40,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L735-2-->L735-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out329990519| |P0Thread1of1ForFork0_#t~ite3_Out329990519|)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In329990519 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In329990519 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out329990519| ~x~0_In329990519) .cse0 (or .cse1 .cse2)) (and .cse0 (not .cse2) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out329990519| ~x$w_buff1~0_In329990519)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In329990519, ~x$w_buff1_used~0=~x$w_buff1_used~0_In329990519, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In329990519, ~x~0=~x~0_In329990519} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out329990519|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out329990519|, ~x$w_buff1~0=~x$w_buff1~0_In329990519, ~x$w_buff1_used~0=~x$w_buff1_used~0_In329990519, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In329990519, ~x~0=~x~0_In329990519} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 20:47:40,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In999906155 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In999906155 256) 0))) (or (and (= ~x$w_buff0_used~0_In999906155 |P0Thread1of1ForFork0_#t~ite5_Out999906155|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out999906155|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In999906155, ~x$w_buff0_used~0=~x$w_buff0_used~0_In999906155} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out999906155|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In999906155, ~x$w_buff0_used~0=~x$w_buff0_used~0_In999906155} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 20:47:40,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1793069984 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1793069984 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out1793069984| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out1793069984| ~x$w_buff0_used~0_In1793069984) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1793069984, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1793069984} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1793069984, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1793069984|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1793069984} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 20:47:40,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In1743007294 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1743007294 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1743007294 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1743007294 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite18_Out1743007294| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite18_Out1743007294| ~x$w_buff1_used~0_In1743007294) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1743007294, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1743007294, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1743007294, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1743007294} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1743007294, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1743007294, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1743007294, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1743007294|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1743007294} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 20:47:40,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L737-->L737-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In121326199 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In121326199 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd1~0_In121326199 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In121326199 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out121326199| ~x$w_buff1_used~0_In121326199) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out121326199| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In121326199, ~x$w_buff1_used~0=~x$w_buff1_used~0_In121326199, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In121326199, ~x$w_buff0_used~0=~x$w_buff0_used~0_In121326199} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out121326199|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In121326199, ~x$w_buff1_used~0=~x$w_buff1_used~0_In121326199, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In121326199, ~x$w_buff0_used~0=~x$w_buff0_used~0_In121326199} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 20:47:40,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-824525818 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-824525818 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite19_Out-824525818|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd3~0_In-824525818 |P2Thread1of1ForFork2_#t~ite19_Out-824525818|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-824525818, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-824525818} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-824525818, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-824525818|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-824525818} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 20:47:40,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L791-->L791-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-1842516607 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-1842516607 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-1842516607 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1842516607 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1842516607| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite20_Out-1842516607| ~x$r_buff1_thd3~0_In-1842516607)))) InVars {~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1842516607, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1842516607, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1842516607, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1842516607} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1842516607|, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1842516607, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1842516607, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1842516607, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1842516607} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 20:47:40,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L791-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~x$r_buff1_thd3~0_12) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 20:47:40,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In2032108307 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In2032108307 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out2032108307| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In2032108307 |P1Thread1of1ForFork1_#t~ite11_Out2032108307|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2032108307, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2032108307} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out2032108307|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2032108307, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2032108307} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 20:47:40,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-514639736 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-514639736 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-514639736 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-514639736 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-514639736| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite12_Out-514639736| ~x$w_buff1_used~0_In-514639736)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-514639736, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-514639736, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-514639736, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-514639736} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-514639736, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-514639736, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-514639736|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-514639736, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-514639736} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 20:47:40,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L767-->L768: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-818305795 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-818305795 256)))) (or (and (= ~x$r_buff0_thd2~0_In-818305795 ~x$r_buff0_thd2~0_Out-818305795) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-818305795)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-818305795, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-818305795} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-818305795|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-818305795, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-818305795} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 20:47:40,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-884908566 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-884908566 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-884908566 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-884908566 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-884908566| ~x$r_buff1_thd2~0_In-884908566) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-884908566|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-884908566, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-884908566, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-884908566, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-884908566} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-884908566, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-884908566, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-884908566, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-884908566|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-884908566} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 20:47:40,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 20:47:40,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L738-->L738-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In94595416 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In94595416 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out94595416| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out94595416| ~x$r_buff0_thd1~0_In94595416)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In94595416, ~x$w_buff0_used~0=~x$w_buff0_used~0_In94595416} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In94595416, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out94595416|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In94595416} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 20:47:40,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L739-->L739-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1495802245 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-1495802245 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-1495802245 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1495802245 256) 0))) (or (and (= ~x$r_buff1_thd1~0_In-1495802245 |P0Thread1of1ForFork0_#t~ite8_Out-1495802245|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1495802245|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1495802245, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1495802245, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1495802245, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1495802245} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1495802245, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1495802245|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1495802245, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1495802245, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1495802245} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:47:40,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L739-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_14 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 20:47:40,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L820: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:47:40,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L820-2-->L820-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite24_Out-1801268712| |ULTIMATE.start_main_#t~ite25_Out-1801268712|)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1801268712 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1801268712 256) 0))) (or (and (not .cse0) (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite24_Out-1801268712| ~x$w_buff1~0_In-1801268712)) (and (= |ULTIMATE.start_main_#t~ite24_Out-1801268712| ~x~0_In-1801268712) .cse2 (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1801268712, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1801268712, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1801268712, ~x~0=~x~0_In-1801268712} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1801268712, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1801268712|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1801268712|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1801268712, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1801268712, ~x~0=~x~0_In-1801268712} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 20:47:40,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1818396963 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1818396963 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite26_Out1818396963| 0)) (and (= ~x$w_buff0_used~0_In1818396963 |ULTIMATE.start_main_#t~ite26_Out1818396963|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1818396963, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1818396963} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1818396963, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1818396963|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1818396963} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 20:47:40,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1068671548 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1068671548 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1068671548 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1068671548 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite27_Out1068671548|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In1068671548 |ULTIMATE.start_main_#t~ite27_Out1068671548|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1068671548, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1068671548, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1068671548, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1068671548} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1068671548, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1068671548, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1068671548|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1068671548, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1068671548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 20:47:40,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In450180946 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In450180946 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In450180946 |ULTIMATE.start_main_#t~ite28_Out450180946|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out450180946| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In450180946, ~x$w_buff0_used~0=~x$w_buff0_used~0_In450180946} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In450180946, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out450180946|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In450180946} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 20:47:40,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-798874046 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-798874046 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-798874046 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-798874046 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out-798874046| ~x$r_buff1_thd0~0_In-798874046) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite29_Out-798874046| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-798874046, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-798874046, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-798874046, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-798874046} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-798874046, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-798874046|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-798874046, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-798874046, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-798874046} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 20:47:40,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L836-->L837: Formula: (and (= v_~x$r_buff0_thd0~0_59 v_~x$r_buff0_thd0~0_58) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_58, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 20:47:40,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L839-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_8 256)) (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= v_~x$flush_delayed~0_10 0) (= v_~x$mem_tmp~0_7 v_~x~0_25)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~x~0=v_~x~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:47:40,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 20:47:41,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:47:41 BasicIcfg [2019-12-27 20:47:41,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:47:41,102 INFO L168 Benchmark]: Toolchain (without parser) took 108993.37 ms. Allocated memory was 139.5 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 102.7 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 775.4 MB. Max. memory is 7.1 GB. [2019-12-27 20:47:41,103 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 20:47:41,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 843.52 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 102.3 MB in the beginning and 154.8 MB in the end (delta: -52.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:47:41,106 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.53 ms. Allocated memory is still 203.4 MB. Free memory was 154.8 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:47:41,107 INFO L168 Benchmark]: Boogie Preprocessor took 38.64 ms. Allocated memory is still 203.4 MB. Free memory was 152.1 MB in the beginning and 149.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:47:41,108 INFO L168 Benchmark]: RCFGBuilder took 898.80 ms. Allocated memory is still 203.4 MB. Free memory was 149.5 MB in the beginning and 99.4 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:47:41,111 INFO L168 Benchmark]: TraceAbstraction took 107127.44 ms. Allocated memory was 203.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 98.7 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 707.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:47:41,117 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.16 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 843.52 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 102.3 MB in the beginning and 154.8 MB in the end (delta: -52.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.53 ms. Allocated memory is still 203.4 MB. Free memory was 154.8 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.64 ms. Allocated memory is still 203.4 MB. Free memory was 152.1 MB in the beginning and 149.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 898.80 ms. Allocated memory is still 203.4 MB. Free memory was 149.5 MB in the beginning and 99.4 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 107127.44 ms. Allocated memory was 203.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 98.7 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 707.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 175 ProgramPointsBefore, 97 ProgramPointsAfterwards, 212 TransitionsBefore, 110 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 28 ChoiceCompositions, 5221 VarBasedMoverChecksPositive, 172 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 82846 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t760, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t761, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t762, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L754] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L755] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L756] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L757] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L758] 2 x$r_buff0_thd2 = (_Bool)1 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L778] 3 y = 2 [L781] 3 __unbuffered_p2_EAX = y [L784] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L729] 1 z = 1 [L732] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L735] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L788] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L736] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L789] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L790] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L738] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L820] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L821] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L822] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L823] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L824] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 x$flush_delayed = weak$$choice2 [L830] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L831] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L832] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L832] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L833] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L833] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L834] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L834] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L835] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L835] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L837] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 106.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 28.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2806 SDtfs, 3060 SDslu, 6948 SDs, 0 SdLazy, 5482 SolverSat, 258 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 88 SyntacticMatches, 32 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217043occurred 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: 48.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 93046 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 851 NumberOfCodeBlocks, 851 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 766 ConstructedInterpolants, 0 QuantifiedInterpolants, 115918 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...