/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:12:52,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:12:52,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:12:52,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:12:52,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:12:52,791 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:12:52,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:12:52,803 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:12:52,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:12:52,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:12:52,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:12:52,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:12:52,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:12:52,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:12:52,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:12:52,819 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:12:52,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:12:52,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:12:52,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:12:52,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:12:52,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:12:52,836 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:12:52,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:12:52,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:12:52,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:12:52,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:12:52,842 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:12:52,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:12:52,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:12:52,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:12:52,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:12:52,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:12:52,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:12:52,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:12:52,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:12:52,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:12:52,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:12:52,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:12:52,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:12:52,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:12:52,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:12:52,854 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.epf [2019-12-18 21:12:52,874 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:12:52,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:12:52,878 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:12:52,878 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:12:52,878 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:12:52,879 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:12:52,879 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:12:52,879 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:12:52,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:12:52,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:12:52,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:12:52,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:12:52,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:12:52,882 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:12:52,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:12:52,884 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:12:52,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:12:52,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:12:52,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:12:52,885 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:12:52,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:12:52,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:12:52,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:12:52,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:12:52,886 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:12:52,886 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:12:52,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:12:52,886 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:12:52,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:12:52,887 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:12:53,193 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:12:53,218 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:12:53,221 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:12:53,223 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:12:53,223 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:12:53,224 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_power.opt.i [2019-12-18 21:12:53,292 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/229532241/8b67097c0644449ab29c75982a689fd8/FLAG737595b14 [2019-12-18 21:12:53,840 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:12:53,841 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_power.opt.i [2019-12-18 21:12:53,859 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/229532241/8b67097c0644449ab29c75982a689fd8/FLAG737595b14 [2019-12-18 21:12:54,124 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/229532241/8b67097c0644449ab29c75982a689fd8 [2019-12-18 21:12:54,135 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:12:54,137 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:12:54,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:12:54,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:12:54,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:12:54,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:12:54" (1/1) ... [2019-12-18 21:12:54,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e483e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:12:54, skipping insertion in model container [2019-12-18 21:12:54,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:12:54" (1/1) ... [2019-12-18 21:12:54,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:12:54,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:12:54,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:12:54,770 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:12:54,847 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:12:54,926 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:12:54,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:12:54 WrapperNode [2019-12-18 21:12:54,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:12:54,928 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:12:54,928 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:12:54,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:12:54,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:12:54" (1/1) ... [2019-12-18 21:12:54,957 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:12:54" (1/1) ... [2019-12-18 21:12:55,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:12:55,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:12:55,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:12:55,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:12:55,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:12:54" (1/1) ... [2019-12-18 21:12:55,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:12:54" (1/1) ... [2019-12-18 21:12:55,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:12:54" (1/1) ... [2019-12-18 21:12:55,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:12:54" (1/1) ... [2019-12-18 21:12:55,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:12:54" (1/1) ... [2019-12-18 21:12:55,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:12:54" (1/1) ... [2019-12-18 21:12:55,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:12:54" (1/1) ... [2019-12-18 21:12:55,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:12:55,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:12:55,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:12:55,042 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:12:55,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:12:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:12:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:12:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:12:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:12:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:12:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:12:55,108 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:12:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:12:55,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:12:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:12:55,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:12:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:12:55,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:12:55,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:12:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:12:55,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:12:55,115 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:12:55,886 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:12:55,886 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:12:55,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:12:55 BoogieIcfgContainer [2019-12-18 21:12:55,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:12:55,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:12:55,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:12:55,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:12:55,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:12:54" (1/3) ... [2019-12-18 21:12:55,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11dd599a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:12:55, skipping insertion in model container [2019-12-18 21:12:55,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:12:54" (2/3) ... [2019-12-18 21:12:55,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11dd599a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:12:55, skipping insertion in model container [2019-12-18 21:12:55,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:12:55" (3/3) ... [2019-12-18 21:12:55,901 INFO L109 eAbstractionObserver]: Analyzing ICFG mix036_power.opt.i [2019-12-18 21:12:55,913 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:12:55,913 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:12:55,926 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:12:55,927 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:12:55,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:55,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:55,996 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:55,997 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:55,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:55,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,006 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,007 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,066 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,066 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,070 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,071 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,071 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,081 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,081 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,083 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,083 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,083 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,083 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,083 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,083 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,094 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,094 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,095 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,100 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,100 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,103 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,106 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,110 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,110 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,110 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:12:56,127 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:12:56,147 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:12:56,147 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:12:56,147 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:12:56,147 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:12:56,147 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:12:56,147 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:12:56,147 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:12:56,147 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:12:56,164 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 211 transitions [2019-12-18 21:12:56,166 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 183 places, 211 transitions [2019-12-18 21:12:56,286 INFO L126 PetriNetUnfolder]: 41/207 cut-off events. [2019-12-18 21:12:56,286 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:12:56,310 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 207 events. 41/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 449 event pairs. 12/176 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:12:56,337 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 183 places, 211 transitions [2019-12-18 21:12:56,399 INFO L126 PetriNetUnfolder]: 41/207 cut-off events. [2019-12-18 21:12:56,400 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:12:56,406 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 207 events. 41/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 449 event pairs. 12/176 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:12:56,427 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 21:12:56,428 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:13:00,044 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 21:13:00,184 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 21:13:00,558 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-18 21:13:00,716 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-12-18 21:13:00,743 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77566 [2019-12-18 21:13:00,744 INFO L214 etLargeBlockEncoding]: Total number of compositions: 124 [2019-12-18 21:13:00,747 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-18 21:13:37,372 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 177426 states. [2019-12-18 21:13:37,374 INFO L276 IsEmpty]: Start isEmpty. Operand 177426 states. [2019-12-18 21:13:37,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 21:13:37,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:37,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:13:37,383 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:13:37,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:37,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1556658876, now seen corresponding path program 1 times [2019-12-18 21:13:37,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:37,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866897341] [2019-12-18 21:13:37,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:37,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:13:37,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866897341] [2019-12-18 21:13:37,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:37,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:13:37,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212903880] [2019-12-18 21:13:37,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:13:37,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:37,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:13:37,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:13:37,675 INFO L87 Difference]: Start difference. First operand 177426 states. Second operand 3 states. [2019-12-18 21:13:42,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:42,247 INFO L93 Difference]: Finished difference Result 174206 states and 838758 transitions. [2019-12-18 21:13:42,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:13:42,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 21:13:42,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:43,195 INFO L225 Difference]: With dead ends: 174206 [2019-12-18 21:13:43,196 INFO L226 Difference]: Without dead ends: 164066 [2019-12-18 21:13:43,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:13:53,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164066 states. [2019-12-18 21:14:00,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164066 to 164066. [2019-12-18 21:14:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164066 states. [2019-12-18 21:14:01,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164066 states to 164066 states and 788968 transitions. [2019-12-18 21:14:01,931 INFO L78 Accepts]: Start accepts. Automaton has 164066 states and 788968 transitions. Word has length 7 [2019-12-18 21:14:01,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:01,933 INFO L462 AbstractCegarLoop]: Abstraction has 164066 states and 788968 transitions. [2019-12-18 21:14:01,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:14:01,933 INFO L276 IsEmpty]: Start isEmpty. Operand 164066 states and 788968 transitions. [2019-12-18 21:14:01,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:14:01,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:01,944 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:14:01,945 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:01,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:01,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1187468255, now seen corresponding path program 1 times [2019-12-18 21:14:01,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:01,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260311643] [2019-12-18 21:14:01,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:14:02,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260311643] [2019-12-18 21:14:02,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:02,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:14:02,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798033056] [2019-12-18 21:14:02,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:14:02,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:02,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:14:02,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:14:02,029 INFO L87 Difference]: Start difference. First operand 164066 states and 788968 transitions. Second operand 3 states. [2019-12-18 21:14:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:08,646 INFO L93 Difference]: Finished difference Result 103562 states and 449532 transitions. [2019-12-18 21:14:08,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:14:08,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 21:14:08,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:08,973 INFO L225 Difference]: With dead ends: 103562 [2019-12-18 21:14:08,973 INFO L226 Difference]: Without dead ends: 103562 [2019-12-18 21:14:08,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:14:11,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103562 states. [2019-12-18 21:14:13,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103562 to 103562. [2019-12-18 21:14:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103562 states. [2019-12-18 21:14:13,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103562 states to 103562 states and 449532 transitions. [2019-12-18 21:14:13,850 INFO L78 Accepts]: Start accepts. Automaton has 103562 states and 449532 transitions. Word has length 15 [2019-12-18 21:14:13,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:13,851 INFO L462 AbstractCegarLoop]: Abstraction has 103562 states and 449532 transitions. [2019-12-18 21:14:13,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:14:13,851 INFO L276 IsEmpty]: Start isEmpty. Operand 103562 states and 449532 transitions. [2019-12-18 21:14:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:14:13,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:13,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:14:13,854 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:13,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:13,855 INFO L82 PathProgramCache]: Analyzing trace with hash -444517235, now seen corresponding path program 1 times [2019-12-18 21:14:13,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:13,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673634694] [2019-12-18 21:14:13,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:14:13,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673634694] [2019-12-18 21:14:13,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:13,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:14:13,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954356601] [2019-12-18 21:14:13,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:14:13,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:13,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:14:13,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:14:13,972 INFO L87 Difference]: Start difference. First operand 103562 states and 449532 transitions. Second operand 4 states. [2019-12-18 21:14:16,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:16,263 INFO L93 Difference]: Finished difference Result 160711 states and 667320 transitions. [2019-12-18 21:14:16,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:14:16,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:14:16,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:16,947 INFO L225 Difference]: With dead ends: 160711 [2019-12-18 21:14:16,947 INFO L226 Difference]: Without dead ends: 160592 [2019-12-18 21:14:16,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:14:26,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160592 states. [2019-12-18 21:14:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160592 to 146257. [2019-12-18 21:14:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146257 states. [2019-12-18 21:14:30,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146257 states to 146257 states and 614556 transitions. [2019-12-18 21:14:30,495 INFO L78 Accepts]: Start accepts. Automaton has 146257 states and 614556 transitions. Word has length 15 [2019-12-18 21:14:30,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:30,496 INFO L462 AbstractCegarLoop]: Abstraction has 146257 states and 614556 transitions. [2019-12-18 21:14:30,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:14:30,496 INFO L276 IsEmpty]: Start isEmpty. Operand 146257 states and 614556 transitions. [2019-12-18 21:14:30,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:14:30,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:30,503 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:14:30,503 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:30,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:30,503 INFO L82 PathProgramCache]: Analyzing trace with hash -798602882, now seen corresponding path program 1 times [2019-12-18 21:14:30,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:30,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965734010] [2019-12-18 21:14:30,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:14:30,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965734010] [2019-12-18 21:14:30,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:30,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:14:30,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675493053] [2019-12-18 21:14:30,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:14:30,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:30,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:14:30,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:14:30,572 INFO L87 Difference]: Start difference. First operand 146257 states and 614556 transitions. Second operand 4 states. [2019-12-18 21:14:30,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:30,776 INFO L93 Difference]: Finished difference Result 39473 states and 140838 transitions. [2019-12-18 21:14:30,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:14:30,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:14:30,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:30,885 INFO L225 Difference]: With dead ends: 39473 [2019-12-18 21:14:30,886 INFO L226 Difference]: Without dead ends: 39473 [2019-12-18 21:14:30,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:14:31,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39473 states. [2019-12-18 21:14:31,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39473 to 39473. [2019-12-18 21:14:31,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39473 states. [2019-12-18 21:14:31,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39473 states to 39473 states and 140838 transitions. [2019-12-18 21:14:31,694 INFO L78 Accepts]: Start accepts. Automaton has 39473 states and 140838 transitions. Word has length 16 [2019-12-18 21:14:31,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:31,694 INFO L462 AbstractCegarLoop]: Abstraction has 39473 states and 140838 transitions. [2019-12-18 21:14:31,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:14:31,694 INFO L276 IsEmpty]: Start isEmpty. Operand 39473 states and 140838 transitions. [2019-12-18 21:14:31,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:14:31,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:31,698 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:14:31,698 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:31,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:31,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1050404483, now seen corresponding path program 1 times [2019-12-18 21:14:31,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:31,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083529117] [2019-12-18 21:14:31,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:31,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:14:31,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083529117] [2019-12-18 21:14:31,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:31,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:14:31,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112166380] [2019-12-18 21:14:31,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:14:31,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:31,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:14:31,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:14:31,770 INFO L87 Difference]: Start difference. First operand 39473 states and 140838 transitions. Second operand 4 states. [2019-12-18 21:14:32,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:32,183 INFO L93 Difference]: Finished difference Result 50748 states and 179051 transitions. [2019-12-18 21:14:32,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:14:32,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:14:32,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:33,494 INFO L225 Difference]: With dead ends: 50748 [2019-12-18 21:14:33,494 INFO L226 Difference]: Without dead ends: 50737 [2019-12-18 21:14:33,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:14:33,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50737 states. [2019-12-18 21:14:34,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50737 to 45038. [2019-12-18 21:14:34,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45038 states. [2019-12-18 21:14:34,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45038 states to 45038 states and 160086 transitions. [2019-12-18 21:14:34,320 INFO L78 Accepts]: Start accepts. Automaton has 45038 states and 160086 transitions. Word has length 16 [2019-12-18 21:14:34,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:34,321 INFO L462 AbstractCegarLoop]: Abstraction has 45038 states and 160086 transitions. [2019-12-18 21:14:34,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:14:34,321 INFO L276 IsEmpty]: Start isEmpty. Operand 45038 states and 160086 transitions. [2019-12-18 21:14:34,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:14:34,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:34,323 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:14:34,323 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:34,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:34,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1050284482, now seen corresponding path program 1 times [2019-12-18 21:14:34,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:34,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914741935] [2019-12-18 21:14:34,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:14:34,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914741935] [2019-12-18 21:14:34,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:34,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:14:34,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52146917] [2019-12-18 21:14:34,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:14:34,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:34,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:14:34,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:14:34,387 INFO L87 Difference]: Start difference. First operand 45038 states and 160086 transitions. Second operand 4 states. [2019-12-18 21:14:34,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:34,790 INFO L93 Difference]: Finished difference Result 54579 states and 192301 transitions. [2019-12-18 21:14:34,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:14:34,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:14:34,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:34,903 INFO L225 Difference]: With dead ends: 54579 [2019-12-18 21:14:34,903 INFO L226 Difference]: Without dead ends: 54568 [2019-12-18 21:14:34,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:14:35,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54568 states. [2019-12-18 21:14:36,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54568 to 44263. [2019-12-18 21:14:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44263 states. [2019-12-18 21:14:36,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44263 states to 44263 states and 157261 transitions. [2019-12-18 21:14:36,947 INFO L78 Accepts]: Start accepts. Automaton has 44263 states and 157261 transitions. Word has length 16 [2019-12-18 21:14:36,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:36,947 INFO L462 AbstractCegarLoop]: Abstraction has 44263 states and 157261 transitions. [2019-12-18 21:14:36,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:14:36,947 INFO L276 IsEmpty]: Start isEmpty. Operand 44263 states and 157261 transitions. [2019-12-18 21:14:36,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 21:14:36,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:36,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:14:36,964 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:36,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:36,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1735803470, now seen corresponding path program 1 times [2019-12-18 21:14:36,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:36,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405725516] [2019-12-18 21:14:36,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:37,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:14:37,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405725516] [2019-12-18 21:14:37,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:37,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:14:37,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976050018] [2019-12-18 21:14:37,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:14:37,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:37,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:14:37,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:14:37,040 INFO L87 Difference]: Start difference. First operand 44263 states and 157261 transitions. Second operand 5 states. [2019-12-18 21:14:37,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:37,677 INFO L93 Difference]: Finished difference Result 64369 states and 224813 transitions. [2019-12-18 21:14:37,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:14:37,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 21:14:37,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:37,810 INFO L225 Difference]: With dead ends: 64369 [2019-12-18 21:14:37,810 INFO L226 Difference]: Without dead ends: 64346 [2019-12-18 21:14:37,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:14:38,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64346 states. [2019-12-18 21:14:41,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64346 to 47079. [2019-12-18 21:14:41,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47079 states. [2019-12-18 21:14:41,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47079 states to 47079 states and 167291 transitions. [2019-12-18 21:14:41,950 INFO L78 Accepts]: Start accepts. Automaton has 47079 states and 167291 transitions. Word has length 24 [2019-12-18 21:14:41,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:41,950 INFO L462 AbstractCegarLoop]: Abstraction has 47079 states and 167291 transitions. [2019-12-18 21:14:41,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:14:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand 47079 states and 167291 transitions. [2019-12-18 21:14:41,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 21:14:41,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:41,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:14:41,964 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:41,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:41,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1241237007, now seen corresponding path program 1 times [2019-12-18 21:14:41,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:41,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597254616] [2019-12-18 21:14:41,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:42,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:14:42,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597254616] [2019-12-18 21:14:42,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:42,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:14:42,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778078069] [2019-12-18 21:14:42,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:14:42,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:42,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:14:42,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:14:42,057 INFO L87 Difference]: Start difference. First operand 47079 states and 167291 transitions. Second operand 5 states. [2019-12-18 21:14:42,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:42,818 INFO L93 Difference]: Finished difference Result 66062 states and 230201 transitions. [2019-12-18 21:14:42,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:14:42,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 21:14:42,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:42,955 INFO L225 Difference]: With dead ends: 66062 [2019-12-18 21:14:42,955 INFO L226 Difference]: Without dead ends: 66039 [2019-12-18 21:14:42,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:14:43,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66039 states. [2019-12-18 21:14:44,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66039 to 43165. [2019-12-18 21:14:44,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43165 states. [2019-12-18 21:14:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43165 states to 43165 states and 153089 transitions. [2019-12-18 21:14:44,332 INFO L78 Accepts]: Start accepts. Automaton has 43165 states and 153089 transitions. Word has length 24 [2019-12-18 21:14:44,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:44,333 INFO L462 AbstractCegarLoop]: Abstraction has 43165 states and 153089 transitions. [2019-12-18 21:14:44,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:14:44,333 INFO L276 IsEmpty]: Start isEmpty. Operand 43165 states and 153089 transitions. [2019-12-18 21:14:44,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 21:14:44,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:44,353 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:14:44,354 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:44,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:44,354 INFO L82 PathProgramCache]: Analyzing trace with hash -2135952936, now seen corresponding path program 1 times [2019-12-18 21:14:44,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:44,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383255267] [2019-12-18 21:14:44,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:44,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:14:44,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383255267] [2019-12-18 21:14:44,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:44,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:14:44,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121353485] [2019-12-18 21:14:44,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:14:44,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:44,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:14:44,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:14:44,444 INFO L87 Difference]: Start difference. First operand 43165 states and 153089 transitions. Second operand 5 states. [2019-12-18 21:14:44,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:44,564 INFO L93 Difference]: Finished difference Result 22104 states and 79422 transitions. [2019-12-18 21:14:44,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:14:44,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 21:14:44,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:44,606 INFO L225 Difference]: With dead ends: 22104 [2019-12-18 21:14:44,606 INFO L226 Difference]: Without dead ends: 22104 [2019-12-18 21:14:44,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:14:44,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22104 states. [2019-12-18 21:14:44,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22104 to 21800. [2019-12-18 21:14:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21800 states. [2019-12-18 21:14:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21800 states to 21800 states and 78390 transitions. [2019-12-18 21:14:45,554 INFO L78 Accepts]: Start accepts. Automaton has 21800 states and 78390 transitions. Word has length 28 [2019-12-18 21:14:45,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:45,555 INFO L462 AbstractCegarLoop]: Abstraction has 21800 states and 78390 transitions. [2019-12-18 21:14:45,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:14:45,555 INFO L276 IsEmpty]: Start isEmpty. Operand 21800 states and 78390 transitions. [2019-12-18 21:14:45,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 21:14:45,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:45,593 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] [2019-12-18 21:14:45,593 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:45,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:45,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1861342996, now seen corresponding path program 1 times [2019-12-18 21:14:45,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:45,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850232628] [2019-12-18 21:14:45,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:14:45,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850232628] [2019-12-18 21:14:45,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:45,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:14:45,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996692920] [2019-12-18 21:14:45,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:14:45,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:45,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:14:45,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:14:45,671 INFO L87 Difference]: Start difference. First operand 21800 states and 78390 transitions. Second operand 4 states. [2019-12-18 21:14:45,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:45,872 INFO L93 Difference]: Finished difference Result 31588 states and 108507 transitions. [2019-12-18 21:14:45,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:14:45,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-18 21:14:45,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:45,942 INFO L225 Difference]: With dead ends: 31588 [2019-12-18 21:14:45,944 INFO L226 Difference]: Without dead ends: 22114 [2019-12-18 21:14:45,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:14:46,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22114 states. [2019-12-18 21:14:46,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22114 to 22018. [2019-12-18 21:14:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22018 states. [2019-12-18 21:14:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22018 states to 22018 states and 78252 transitions. [2019-12-18 21:14:46,464 INFO L78 Accepts]: Start accepts. Automaton has 22018 states and 78252 transitions. Word has length 42 [2019-12-18 21:14:46,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:46,464 INFO L462 AbstractCegarLoop]: Abstraction has 22018 states and 78252 transitions. [2019-12-18 21:14:46,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:14:46,465 INFO L276 IsEmpty]: Start isEmpty. Operand 22018 states and 78252 transitions. [2019-12-18 21:14:46,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 21:14:46,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:46,505 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] [2019-12-18 21:14:46,505 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:46,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:46,505 INFO L82 PathProgramCache]: Analyzing trace with hash 405367934, now seen corresponding path program 2 times [2019-12-18 21:14:46,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:46,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117639821] [2019-12-18 21:14:46,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:14:46,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117639821] [2019-12-18 21:14:46,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:46,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:14:46,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955917543] [2019-12-18 21:14:46,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:14:46,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:46,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:14:46,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:14:46,610 INFO L87 Difference]: Start difference. First operand 22018 states and 78252 transitions. Second operand 6 states. [2019-12-18 21:14:46,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:46,776 INFO L93 Difference]: Finished difference Result 20676 states and 74842 transitions. [2019-12-18 21:14:46,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:14:46,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 21:14:46,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:46,814 INFO L225 Difference]: With dead ends: 20676 [2019-12-18 21:14:46,814 INFO L226 Difference]: Without dead ends: 18829 [2019-12-18 21:14:46,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-18 21:14:46,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18829 states. [2019-12-18 21:14:47,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18829 to 17981. [2019-12-18 21:14:47,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17981 states. [2019-12-18 21:14:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17981 states to 17981 states and 65223 transitions. [2019-12-18 21:14:47,135 INFO L78 Accepts]: Start accepts. Automaton has 17981 states and 65223 transitions. Word has length 42 [2019-12-18 21:14:47,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:47,136 INFO L462 AbstractCegarLoop]: Abstraction has 17981 states and 65223 transitions. [2019-12-18 21:14:47,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:14:47,136 INFO L276 IsEmpty]: Start isEmpty. Operand 17981 states and 65223 transitions. [2019-12-18 21:14:47,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:14:47,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:47,162 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] [2019-12-18 21:14:47,162 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:47,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:47,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1684532697, now seen corresponding path program 1 times [2019-12-18 21:14:47,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:47,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038203051] [2019-12-18 21:14:47,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:14:47,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038203051] [2019-12-18 21:14:47,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:47,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:14:47,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164686588] [2019-12-18 21:14:47,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:14:47,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:47,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:14:47,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:14:47,241 INFO L87 Difference]: Start difference. First operand 17981 states and 65223 transitions. Second operand 4 states. [2019-12-18 21:14:47,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:47,487 INFO L93 Difference]: Finished difference Result 25903 states and 90377 transitions. [2019-12-18 21:14:47,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:14:47,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-18 21:14:47,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:47,502 INFO L225 Difference]: With dead ends: 25903 [2019-12-18 21:14:47,502 INFO L226 Difference]: Without dead ends: 8473 [2019-12-18 21:14:47,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:14:47,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8473 states. [2019-12-18 21:14:47,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8473 to 8473. [2019-12-18 21:14:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8473 states. [2019-12-18 21:14:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8473 states to 8473 states and 26713 transitions. [2019-12-18 21:14:47,627 INFO L78 Accepts]: Start accepts. Automaton has 8473 states and 26713 transitions. Word has length 57 [2019-12-18 21:14:47,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:47,627 INFO L462 AbstractCegarLoop]: Abstraction has 8473 states and 26713 transitions. [2019-12-18 21:14:47,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:14:47,627 INFO L276 IsEmpty]: Start isEmpty. Operand 8473 states and 26713 transitions. [2019-12-18 21:14:47,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:14:47,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:47,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:14:47,637 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:47,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:47,637 INFO L82 PathProgramCache]: Analyzing trace with hash -710246511, now seen corresponding path program 2 times [2019-12-18 21:14:47,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:47,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343950683] [2019-12-18 21:14:47,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:14:47,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343950683] [2019-12-18 21:14:47,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:47,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:14:47,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749374862] [2019-12-18 21:14:47,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:14:47,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:47,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:14:47,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:14:47,729 INFO L87 Difference]: Start difference. First operand 8473 states and 26713 transitions. Second operand 7 states. [2019-12-18 21:14:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:48,144 INFO L93 Difference]: Finished difference Result 23527 states and 74268 transitions. [2019-12-18 21:14:48,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:14:48,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 21:14:48,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:48,183 INFO L225 Difference]: With dead ends: 23527 [2019-12-18 21:14:48,183 INFO L226 Difference]: Without dead ends: 17959 [2019-12-18 21:14:48,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:14:48,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17959 states. [2019-12-18 21:14:48,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17959 to 10609. [2019-12-18 21:14:48,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10609 states. [2019-12-18 21:14:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10609 states to 10609 states and 33720 transitions. [2019-12-18 21:14:48,423 INFO L78 Accepts]: Start accepts. Automaton has 10609 states and 33720 transitions. Word has length 57 [2019-12-18 21:14:48,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:48,423 INFO L462 AbstractCegarLoop]: Abstraction has 10609 states and 33720 transitions. [2019-12-18 21:14:48,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:14:48,423 INFO L276 IsEmpty]: Start isEmpty. Operand 10609 states and 33720 transitions. [2019-12-18 21:14:48,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:14:48,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:48,438 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:14:48,438 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:48,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:48,439 INFO L82 PathProgramCache]: Analyzing trace with hash -417360961, now seen corresponding path program 3 times [2019-12-18 21:14:48,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:48,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175625636] [2019-12-18 21:14:48,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:48,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:14:48,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175625636] [2019-12-18 21:14:48,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:48,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:14:48,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986780911] [2019-12-18 21:14:48,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:14:48,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:48,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:14:48,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:14:48,537 INFO L87 Difference]: Start difference. First operand 10609 states and 33720 transitions. Second operand 7 states. [2019-12-18 21:14:48,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:48,942 INFO L93 Difference]: Finished difference Result 29160 states and 90983 transitions. [2019-12-18 21:14:48,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:14:48,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 21:14:48,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:48,975 INFO L225 Difference]: With dead ends: 29160 [2019-12-18 21:14:48,975 INFO L226 Difference]: Without dead ends: 20669 [2019-12-18 21:14:48,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:14:49,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20669 states. [2019-12-18 21:14:49,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20669 to 13166. [2019-12-18 21:14:49,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13166 states. [2019-12-18 21:14:49,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13166 states to 13166 states and 41783 transitions. [2019-12-18 21:14:49,245 INFO L78 Accepts]: Start accepts. Automaton has 13166 states and 41783 transitions. Word has length 57 [2019-12-18 21:14:49,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:49,246 INFO L462 AbstractCegarLoop]: Abstraction has 13166 states and 41783 transitions. [2019-12-18 21:14:49,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:14:49,246 INFO L276 IsEmpty]: Start isEmpty. Operand 13166 states and 41783 transitions. [2019-12-18 21:14:49,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:14:49,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:49,267 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] [2019-12-18 21:14:49,267 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:49,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:49,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1532130975, now seen corresponding path program 4 times [2019-12-18 21:14:49,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:49,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370694200] [2019-12-18 21:14:49,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:49,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:14:49,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370694200] [2019-12-18 21:14:49,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:49,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:14:49,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220334010] [2019-12-18 21:14:49,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:14:49,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:49,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:14:49,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:14:49,442 INFO L87 Difference]: Start difference. First operand 13166 states and 41783 transitions. Second operand 9 states. [2019-12-18 21:14:51,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:51,552 INFO L93 Difference]: Finished difference Result 84351 states and 272691 transitions. [2019-12-18 21:14:51,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 21:14:51,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 21:14:51,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:51,681 INFO L225 Difference]: With dead ends: 84351 [2019-12-18 21:14:51,682 INFO L226 Difference]: Without dead ends: 69565 [2019-12-18 21:14:51,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=454, Invalid=1616, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 21:14:51,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69565 states. [2019-12-18 21:14:52,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69565 to 18751. [2019-12-18 21:14:52,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18751 states. [2019-12-18 21:14:52,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18751 states to 18751 states and 60469 transitions. [2019-12-18 21:14:52,358 INFO L78 Accepts]: Start accepts. Automaton has 18751 states and 60469 transitions. Word has length 57 [2019-12-18 21:14:52,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:52,358 INFO L462 AbstractCegarLoop]: Abstraction has 18751 states and 60469 transitions. [2019-12-18 21:14:52,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:14:52,358 INFO L276 IsEmpty]: Start isEmpty. Operand 18751 states and 60469 transitions. [2019-12-18 21:14:52,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:14:52,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:52,381 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] [2019-12-18 21:14:52,381 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:52,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:52,381 INFO L82 PathProgramCache]: Analyzing trace with hash -2118129567, now seen corresponding path program 5 times [2019-12-18 21:14:52,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:52,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156924156] [2019-12-18 21:14:52,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:52,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:14:52,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156924156] [2019-12-18 21:14:52,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:52,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:14:52,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093272870] [2019-12-18 21:14:52,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:14:52,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:52,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:14:52,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:14:52,489 INFO L87 Difference]: Start difference. First operand 18751 states and 60469 transitions. Second operand 9 states. [2019-12-18 21:14:54,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:54,392 INFO L93 Difference]: Finished difference Result 77940 states and 248782 transitions. [2019-12-18 21:14:54,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 21:14:54,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 21:14:54,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:54,511 INFO L225 Difference]: With dead ends: 77940 [2019-12-18 21:14:54,512 INFO L226 Difference]: Without dead ends: 68131 [2019-12-18 21:14:54,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 21:14:54,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68131 states. [2019-12-18 21:14:55,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68131 to 18392. [2019-12-18 21:14:55,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18392 states. [2019-12-18 21:14:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18392 states to 18392 states and 59320 transitions. [2019-12-18 21:14:55,179 INFO L78 Accepts]: Start accepts. Automaton has 18392 states and 59320 transitions. Word has length 57 [2019-12-18 21:14:55,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:55,179 INFO L462 AbstractCegarLoop]: Abstraction has 18392 states and 59320 transitions. [2019-12-18 21:14:55,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:14:55,179 INFO L276 IsEmpty]: Start isEmpty. Operand 18392 states and 59320 transitions. [2019-12-18 21:14:55,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:14:55,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:55,199 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] [2019-12-18 21:14:55,200 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:55,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:55,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1404679823, now seen corresponding path program 6 times [2019-12-18 21:14:55,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:55,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993628803] [2019-12-18 21:14:55,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:55,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:14:55,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993628803] [2019-12-18 21:14:55,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:55,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:14:55,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726985874] [2019-12-18 21:14:55,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:14:55,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:55,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:14:55,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:14:55,278 INFO L87 Difference]: Start difference. First operand 18392 states and 59320 transitions. Second operand 3 states. [2019-12-18 21:14:55,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:55,344 INFO L93 Difference]: Finished difference Result 17138 states and 53973 transitions. [2019-12-18 21:14:55,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:14:55,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 21:14:55,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:55,368 INFO L225 Difference]: With dead ends: 17138 [2019-12-18 21:14:55,368 INFO L226 Difference]: Without dead ends: 17138 [2019-12-18 21:14:55,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:14:55,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17138 states. [2019-12-18 21:14:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17138 to 16452. [2019-12-18 21:14:55,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16452 states. [2019-12-18 21:14:55,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16452 states to 16452 states and 51551 transitions. [2019-12-18 21:14:55,748 INFO L78 Accepts]: Start accepts. Automaton has 16452 states and 51551 transitions. Word has length 57 [2019-12-18 21:14:55,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:55,748 INFO L462 AbstractCegarLoop]: Abstraction has 16452 states and 51551 transitions. [2019-12-18 21:14:55,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:14:55,749 INFO L276 IsEmpty]: Start isEmpty. Operand 16452 states and 51551 transitions. [2019-12-18 21:14:55,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:14:55,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:55,766 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] [2019-12-18 21:14:55,766 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:55,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:55,767 INFO L82 PathProgramCache]: Analyzing trace with hash -2094949333, now seen corresponding path program 1 times [2019-12-18 21:14:55,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:55,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351921410] [2019-12-18 21:14:55,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:55,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-18 21:14:55,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351921410] [2019-12-18 21:14:55,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:55,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:14:55,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879148274] [2019-12-18 21:14:55,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:14:55,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:55,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:14:55,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:14:55,981 INFO L87 Difference]: Start difference. First operand 16452 states and 51551 transitions. Second operand 11 states. [2019-12-18 21:14:56,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:57,000 INFO L93 Difference]: Finished difference Result 33921 states and 106171 transitions. [2019-12-18 21:14:57,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 21:14:57,000 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-18 21:14:57,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:57,052 INFO L225 Difference]: With dead ends: 33921 [2019-12-18 21:14:57,052 INFO L226 Difference]: Without dead ends: 33119 [2019-12-18 21:14:57,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 21:14:57,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33119 states. [2019-12-18 21:14:57,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33119 to 20802. [2019-12-18 21:14:57,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20802 states. [2019-12-18 21:14:57,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20802 states to 20802 states and 65133 transitions. [2019-12-18 21:14:57,468 INFO L78 Accepts]: Start accepts. Automaton has 20802 states and 65133 transitions. Word has length 58 [2019-12-18 21:14:57,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:57,469 INFO L462 AbstractCegarLoop]: Abstraction has 20802 states and 65133 transitions. [2019-12-18 21:14:57,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:14:57,469 INFO L276 IsEmpty]: Start isEmpty. Operand 20802 states and 65133 transitions. [2019-12-18 21:14:57,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:14:57,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:57,490 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] [2019-12-18 21:14:57,490 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:57,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:57,491 INFO L82 PathProgramCache]: Analyzing trace with hash 528069611, now seen corresponding path program 2 times [2019-12-18 21:14:57,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:57,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666815639] [2019-12-18 21:14:57,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:57,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:14:57,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666815639] [2019-12-18 21:14:57,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:57,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:14:57,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173160744] [2019-12-18 21:14:57,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:14:57,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:57,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:14:57,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:14:57,670 INFO L87 Difference]: Start difference. First operand 20802 states and 65133 transitions. Second operand 11 states. [2019-12-18 21:14:58,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:58,615 INFO L93 Difference]: Finished difference Result 33743 states and 104900 transitions. [2019-12-18 21:14:58,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 21:14:58,617 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-18 21:14:58,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:58,658 INFO L225 Difference]: With dead ends: 33743 [2019-12-18 21:14:58,658 INFO L226 Difference]: Without dead ends: 26875 [2019-12-18 21:14:58,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:14:58,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26875 states. [2019-12-18 21:14:59,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26875 to 16606. [2019-12-18 21:14:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16606 states. [2019-12-18 21:14:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16606 states to 16606 states and 51706 transitions. [2019-12-18 21:14:59,118 INFO L78 Accepts]: Start accepts. Automaton has 16606 states and 51706 transitions. Word has length 58 [2019-12-18 21:14:59,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:59,119 INFO L462 AbstractCegarLoop]: Abstraction has 16606 states and 51706 transitions. [2019-12-18 21:14:59,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:14:59,119 INFO L276 IsEmpty]: Start isEmpty. Operand 16606 states and 51706 transitions. [2019-12-18 21:14:59,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:14:59,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:59,136 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] [2019-12-18 21:14:59,136 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:59,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:59,137 INFO L82 PathProgramCache]: Analyzing trace with hash 57959717, now seen corresponding path program 3 times [2019-12-18 21:14:59,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:59,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191336824] [2019-12-18 21:14:59,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:59,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:14:59,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191336824] [2019-12-18 21:14:59,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:59,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 21:14:59,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621627243] [2019-12-18 21:14:59,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:14:59,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:59,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:14:59,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:14:59,326 INFO L87 Difference]: Start difference. First operand 16606 states and 51706 transitions. Second operand 12 states. [2019-12-18 21:15:00,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:00,359 INFO L93 Difference]: Finished difference Result 27163 states and 83918 transitions. [2019-12-18 21:15:00,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 21:15:00,360 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-12-18 21:15:00,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:00,430 INFO L225 Difference]: With dead ends: 27163 [2019-12-18 21:15:00,431 INFO L226 Difference]: Without dead ends: 26811 [2019-12-18 21:15:00,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 21:15:00,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26811 states. [2019-12-18 21:15:00,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26811 to 16350. [2019-12-18 21:15:00,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16350 states. [2019-12-18 21:15:01,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16350 states to 16350 states and 50970 transitions. [2019-12-18 21:15:01,004 INFO L78 Accepts]: Start accepts. Automaton has 16350 states and 50970 transitions. Word has length 58 [2019-12-18 21:15:01,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:01,004 INFO L462 AbstractCegarLoop]: Abstraction has 16350 states and 50970 transitions. [2019-12-18 21:15:01,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:15:01,004 INFO L276 IsEmpty]: Start isEmpty. Operand 16350 states and 50970 transitions. [2019-12-18 21:15:01,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:15:01,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:01,030 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] [2019-12-18 21:15:01,030 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:01,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:01,030 INFO L82 PathProgramCache]: Analyzing trace with hash 505460967, now seen corresponding path program 4 times [2019-12-18 21:15:01,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:01,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964305865] [2019-12-18 21:15:01,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:15:01,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964305865] [2019-12-18 21:15:01,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:01,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:15:01,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040233306] [2019-12-18 21:15:01,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:15:01,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:01,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:15:01,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:15:01,105 INFO L87 Difference]: Start difference. First operand 16350 states and 50970 transitions. Second operand 3 states. [2019-12-18 21:15:01,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:01,186 INFO L93 Difference]: Finished difference Result 16348 states and 50965 transitions. [2019-12-18 21:15:01,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:15:01,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 21:15:01,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:01,221 INFO L225 Difference]: With dead ends: 16348 [2019-12-18 21:15:01,221 INFO L226 Difference]: Without dead ends: 16348 [2019-12-18 21:15:01,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:15:01,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16348 states. [2019-12-18 21:15:01,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16348 to 15714. [2019-12-18 21:15:01,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15714 states. [2019-12-18 21:15:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15714 states to 15714 states and 49251 transitions. [2019-12-18 21:15:01,912 INFO L78 Accepts]: Start accepts. Automaton has 15714 states and 49251 transitions. Word has length 58 [2019-12-18 21:15:01,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:01,912 INFO L462 AbstractCegarLoop]: Abstraction has 15714 states and 49251 transitions. [2019-12-18 21:15:01,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:15:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 15714 states and 49251 transitions. [2019-12-18 21:15:01,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:15:01,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:01,940 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] [2019-12-18 21:15:01,941 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:01,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:01,941 INFO L82 PathProgramCache]: Analyzing trace with hash 982633720, now seen corresponding path program 1 times [2019-12-18 21:15:01,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:01,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800158963] [2019-12-18 21:15:01,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:15:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:15:02,120 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:15:02,120 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:15:02,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] ULTIMATE.startENTRY-->L850: Formula: (let ((.cse0 (store |v_#valid_70| 0 0))) (and (= 0 v_~y$w_buff1~0_28) (= 0 v_~a~0_9) (= v_~x~0_11 0) (= v_~main$tmp_guard1~0_18 0) (= 0 v_~y$r_buff1_thd3~0_20) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff0_thd1~0_11 0) (= v_~y~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~__unbuffered_p0_EAX~0_15) (= v_~y$read_delayed~0_7 0) (= |v_#NULL.offset_3| 0) (= 0 v_~__unbuffered_p3_EAX~0_14) (= 0 |v_ULTIMATE.start_main_~#t941~0.offset_15|) (= v_~y$w_buff0_used~0_109 0) (= 0 v_~y$flush_delayed~0_14) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t941~0.base_18| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t941~0.base_18|) |v_ULTIMATE.start_main_~#t941~0.offset_15| 0)) |v_#memory_int_27|) (= v_~y$r_buff0_thd2~0_72 0) (= v_~b~0_11 0) (= 0 v_~y$r_buff1_thd0~0_24) (= v_~y$r_buff0_thd0~0_22 0) (= v_~y$mem_tmp~0_11 0) (= 0 v_~y$w_buff0~0_29) (= v_~y$r_buff0_thd4~0_21 0) (= 0 v_~__unbuffered_p2_EAX~0_16) (= 0 v_~y$r_buff1_thd1~0_11) (= (store .cse0 |v_ULTIMATE.start_main_~#t941~0.base_18| 1) |v_#valid_68|) (= (select .cse0 |v_ULTIMATE.start_main_~#t941~0.base_18|) 0) (= v_~y$w_buff1_used~0_68 0) (= 0 v_~y$r_buff1_thd2~0_44) (= 0 v_~__unbuffered_cnt~0_24) (< 0 |v_#StackHeapBarrier_20|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t941~0.base_18|) (= 0 v_~__unbuffered_p3_EBX~0_14) (= 0 |v_#NULL.base_3|) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t941~0.base_18| 4)) (= 0 v_~y$read_delayed_var~0.base_8) (= v_~z~0_12 0) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~weak$$choice2~0_31) (= 0 v_~y$r_buff1_thd4~0_20) (= v_~y$r_buff0_thd3~0_29 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_23|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_9, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ULTIMATE.start_main_~#t941~0.offset=|v_ULTIMATE.start_main_~#t941~0.offset_15|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, ULTIMATE.start_main_~#t941~0.base=|v_ULTIMATE.start_main_~#t941~0.base_18|, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ULTIMATE.start_main_~#t944~0.base=|v_ULTIMATE.start_main_~#t944~0.base_20|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_8|, ULTIMATE.start_main_~#t943~0.base=|v_ULTIMATE.start_main_~#t943~0.base_22|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff1~0=v_~y$w_buff1~0_28, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_72, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_11, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_109, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_~#t942~0.offset=|v_ULTIMATE.start_main_~#t942~0.offset_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_~#t942~0.base=|v_ULTIMATE.start_main_~#t942~0.base_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y~0=v_~y~0_25, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ULTIMATE.start_main_~#t943~0.offset=|v_ULTIMATE.start_main_~#t943~0.offset_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_44, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ULTIMATE.start_main_~#t944~0.offset=|v_ULTIMATE.start_main_~#t944~0.offset_15|, ~b~0=v_~b~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_12, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t941~0.offset, ~y$r_buff0_thd1~0, ULTIMATE.start_main_~#t941~0.base, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t944~0.base, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t943~0.base, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_~#t942~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t942~0.base, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t943~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t944~0.offset, ~b~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:15:02,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L850-1-->L852: Formula: (and (= |v_ULTIMATE.start_main_~#t942~0.offset_11| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t942~0.base_12|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t942~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t942~0.base_12|) |v_ULTIMATE.start_main_~#t942~0.offset_11| 1))) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t942~0.base_12|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t942~0.base_12| 4)) (= (store |v_#valid_43| |v_ULTIMATE.start_main_~#t942~0.base_12| 1) |v_#valid_42|) (not (= 0 |v_ULTIMATE.start_main_~#t942~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t942~0.offset=|v_ULTIMATE.start_main_~#t942~0.offset_11|, #length=|v_#length_21|, ULTIMATE.start_main_~#t942~0.base=|v_ULTIMATE.start_main_~#t942~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t942~0.offset, #length, ULTIMATE.start_main_~#t942~0.base] because there is no mapped edge [2019-12-18 21:15:02,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L852-1-->L854: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t943~0.base_13|)) (= |v_ULTIMATE.start_main_~#t943~0.offset_11| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t943~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t943~0.base_13|) |v_ULTIMATE.start_main_~#t943~0.offset_11| 2)) |v_#memory_int_17|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t943~0.base_13| 4) |v_#length_19|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t943~0.base_13|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t943~0.base_13|) 0) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t943~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t943~0.offset=|v_ULTIMATE.start_main_~#t943~0.offset_11|, ULTIMATE.start_main_~#t943~0.base=|v_ULTIMATE.start_main_~#t943~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t943~0.offset, ULTIMATE.start_main_~#t943~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 21:15:02,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L4-->L801: Formula: (and (= v_~__unbuffered_p2_EAX~0_5 v_~z~0_6) (= v_~y$r_buff0_thd0~0_16 v_~y$r_buff1_thd0~0_12) (= v_~y$r_buff0_thd3~0_19 v_~y$r_buff1_thd3~0_13) (= v_~y$r_buff0_thd4~0_16 v_~y$r_buff1_thd4~0_14) (= v_~y$r_buff0_thd3~0_18 1) (= v_~y$r_buff0_thd2~0_53 v_~y$r_buff1_thd2~0_29) (= v_~y$r_buff1_thd1~0_5 v_~y$r_buff0_thd1~0_5) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_16, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_19, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_53, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_5, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6, ~z~0=v_~z~0_6} OutVars{P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_29, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_16, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_5, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_14, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_13, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_53, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_5, ~z~0=v_~z~0_6, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_12} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 21:15:02,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L854-1-->L856: Formula: (and (= |v_ULTIMATE.start_main_~#t944~0.offset_10| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t944~0.base_12| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t944~0.base_12|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t944~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t944~0.base_12|) |v_ULTIMATE.start_main_~#t944~0.offset_10| 3)) |v_#memory_int_21|) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t944~0.base_12| 1) |v_#valid_46|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t944~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t944~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t944~0.offset=|v_ULTIMATE.start_main_~#t944~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t944~0.base=|v_ULTIMATE.start_main_~#t944~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t944~0.offset, ULTIMATE.start_main_#t~nondet40, #valid, #memory_int, #length, ULTIMATE.start_main_~#t944~0.base] because there is no mapped edge [2019-12-18 21:15:02,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_4 |v_P0Thread1of1ForFork1_#in~arg.base_4|) (= v_P0Thread1of1ForFork1_~arg.offset_4 |v_P0Thread1of1ForFork1_#in~arg.offset_4|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 1 v_~b~0_5) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_5) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, ~x~0=v_~x~0_5} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~b~0=v_~b~0_5, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, ~x~0=v_~x~0_5, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 21:15:02,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L827-2-->L827-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1210393993 256))) (.cse0 (= |P3Thread1of1ForFork0_#t~ite32_Out1210393993| |P3Thread1of1ForFork0_#t~ite33_Out1210393993|)) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In1210393993 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P3Thread1of1ForFork0_#t~ite32_Out1210393993| ~y~0_In1210393993)) (and (not .cse1) .cse0 (= |P3Thread1of1ForFork0_#t~ite32_Out1210393993| ~y$w_buff1~0_In1210393993) (not .cse2)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1210393993, ~y$w_buff1~0=~y$w_buff1~0_In1210393993, ~y~0=~y~0_In1210393993, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1210393993} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1210393993, ~y$w_buff1~0=~y$w_buff1~0_In1210393993, ~y~0=~y~0_In1210393993, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out1210393993|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out1210393993|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1210393993} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 21:15:02,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-990008509 256))) (.cse1 (= (mod ~y$r_buff0_thd4~0_In-990008509 256) 0))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out-990008509|) (not .cse1)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out-990008509| ~y$w_buff0_used~0_In-990008509)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-990008509, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-990008509} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-990008509, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-990008509, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out-990008509|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 21:15:02,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1895579132 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1895579132 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1895579132 |P2Thread1of1ForFork3_#t~ite28_Out-1895579132|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork3_#t~ite28_Out-1895579132|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1895579132, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1895579132} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1895579132, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1895579132, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-1895579132|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 21:15:02,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1412880034 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In1412880034 256))) (.cse3 (= (mod ~y$r_buff1_thd4~0_In1412880034 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1412880034 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork0_#t~ite35_Out1412880034| ~y$w_buff1_used~0_In1412880034)) (and (= |P3Thread1of1ForFork0_#t~ite35_Out1412880034| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1412880034, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1412880034, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1412880034, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1412880034} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1412880034, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1412880034, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1412880034, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out1412880034|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1412880034} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 21:15:02,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1920973759 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1920973759 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-1920973759 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1920973759 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite29_Out-1920973759| ~y$w_buff1_used~0_In-1920973759)) (and (= |P2Thread1of1ForFork3_#t~ite29_Out-1920973759| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1920973759, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1920973759, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1920973759, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1920973759} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1920973759, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1920973759, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1920973759, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-1920973759|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1920973759} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 21:15:02,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L804-->L805: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-245666713 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-245666713 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out-245666713 ~y$r_buff0_thd3~0_In-245666713)) (and (not .cse0) (= ~y$r_buff0_thd3~0_Out-245666713 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-245666713, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-245666713} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-245666713|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-245666713, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-245666713} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 21:15:02,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L805-->L805-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-669779421 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-669779421 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-669779421 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-669779421 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite31_Out-669779421| ~y$r_buff1_thd3~0_In-669779421) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork3_#t~ite31_Out-669779421| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-669779421, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-669779421, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-669779421, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-669779421} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-669779421, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-669779421, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-669779421, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-669779421|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-669779421} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 21:15:02,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L805-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= |v_P2Thread1of1ForFork3_#t~ite31_8| v_~y$r_buff1_thd3~0_14) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 21:15:02,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1214178082 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out1214178082| ~y$w_buff0~0_In1214178082) (= |P1Thread1of1ForFork2_#t~ite8_In1214178082| |P1Thread1of1ForFork2_#t~ite8_Out1214178082|)) (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1214178082 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1214178082 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1214178082 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1214178082 256))))) (= |P1Thread1of1ForFork2_#t~ite8_Out1214178082| |P1Thread1of1ForFork2_#t~ite9_Out1214178082|) (= |P1Thread1of1ForFork2_#t~ite8_Out1214178082| ~y$w_buff0~0_In1214178082)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1214178082, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1214178082, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In1214178082|, ~y$w_buff0~0=~y$w_buff0~0_In1214178082, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1214178082, ~weak$$choice2~0=~weak$$choice2~0_In1214178082, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1214178082} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1214178082, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1214178082|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1214178082, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out1214178082|, ~y$w_buff0~0=~y$w_buff0~0_In1214178082, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1214178082, ~weak$$choice2~0=~weak$$choice2~0_In1214178082, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1214178082} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:15:02,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In735838118 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_In735838118| |P1Thread1of1ForFork2_#t~ite11_Out735838118|) (= |P1Thread1of1ForFork2_#t~ite12_Out735838118| ~y$w_buff1~0_In735838118)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In735838118 256) 0))) (or (and (= (mod ~y$r_buff1_thd2~0_In735838118 256) 0) .cse1) (and (= (mod ~y$w_buff1_used~0_In735838118 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In735838118 256) 0))) (= ~y$w_buff1~0_In735838118 |P1Thread1of1ForFork2_#t~ite11_Out735838118|) (= |P1Thread1of1ForFork2_#t~ite12_Out735838118| |P1Thread1of1ForFork2_#t~ite11_Out735838118|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In735838118, ~y$w_buff1~0=~y$w_buff1~0_In735838118, ~y$w_buff0_used~0=~y$w_buff0_used~0_In735838118, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In735838118, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In735838118|, ~weak$$choice2~0=~weak$$choice2~0_In735838118, ~y$w_buff1_used~0=~y$w_buff1_used~0_In735838118} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In735838118, ~y$w_buff1~0=~y$w_buff1~0_In735838118, ~y$w_buff0_used~0=~y$w_buff0_used~0_In735838118, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In735838118, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out735838118|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out735838118|, ~weak$$choice2~0=~weak$$choice2~0_In735838118, ~y$w_buff1_used~0=~y$w_buff1_used~0_In735838118} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 21:15:02,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L769-->L770: Formula: (and (= v_~y$r_buff0_thd2~0_56 v_~y$r_buff0_thd2~0_55) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_9|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 21:15:02,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L770-->L770-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1607855401 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite24_Out1607855401| ~y$r_buff1_thd2~0_In1607855401) (= |P1Thread1of1ForFork2_#t~ite23_In1607855401| |P1Thread1of1ForFork2_#t~ite23_Out1607855401|)) (and (= |P1Thread1of1ForFork2_#t~ite23_Out1607855401| ~y$r_buff1_thd2~0_In1607855401) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1607855401 256)))) (or (= (mod ~y$w_buff0_used~0_In1607855401 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1607855401 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1607855401 256))))) .cse0 (= |P1Thread1of1ForFork2_#t~ite23_Out1607855401| |P1Thread1of1ForFork2_#t~ite24_Out1607855401|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1607855401, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1607855401, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1607855401, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In1607855401|, ~weak$$choice2~0=~weak$$choice2~0_In1607855401, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1607855401} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1607855401, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1607855401, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1607855401, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out1607855401|, ~weak$$choice2~0=~weak$$choice2~0_In1607855401, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out1607855401|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1607855401} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 21:15:02,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L772-->L780: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_17 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_17, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 21:15:02,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1765990926 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In1765990926 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd4~0_In1765990926 |P3Thread1of1ForFork0_#t~ite36_Out1765990926|)) (and (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite36_Out1765990926|) (not .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1765990926, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1765990926} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1765990926, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1765990926, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out1765990926|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 21:15:02,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd4~0_In289591043 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In289591043 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In289591043 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd4~0_In289591043 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite37_Out289591043|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$r_buff1_thd4~0_In289591043 |P3Thread1of1ForFork0_#t~ite37_Out289591043|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In289591043, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In289591043, ~y$w_buff0_used~0=~y$w_buff0_used~0_In289591043, ~y$w_buff1_used~0=~y$w_buff1_used~0_In289591043} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In289591043, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In289591043, ~y$w_buff0_used~0=~y$w_buff0_used~0_In289591043, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out289591043|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In289591043} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 21:15:02,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L831-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#t~ite37_8| v_~y$r_buff1_thd4~0_15) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_15, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:15:02,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L856-1-->L862: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:15:02,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L862-2-->L862-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1315854447 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1315854447 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-1315854447 |ULTIMATE.start_main_#t~ite42_Out-1315854447|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1315854447| ~y$w_buff1~0_In-1315854447) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1315854447, ~y~0=~y~0_In-1315854447, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1315854447, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1315854447} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1315854447, ~y~0=~y~0_In-1315854447, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1315854447|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1315854447, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1315854447} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:15:02,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L862-4-->L863: Formula: (= v_~y~0_16 |v_ULTIMATE.start_main_#t~ite42_7|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_6|, ~y~0=v_~y~0_16, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:15:02,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L863-->L863-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1447097123 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1447097123 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1447097123| ~y$w_buff0_used~0_In1447097123)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out1447097123|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1447097123, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1447097123} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1447097123, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1447097123, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1447097123|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:15:02,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L864-->L864-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In100132569 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In100132569 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In100132569 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In100132569 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out100132569| ~y$w_buff1_used~0_In100132569) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out100132569|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In100132569, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In100132569, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In100132569, ~y$w_buff1_used~0=~y$w_buff1_used~0_In100132569} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In100132569, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In100132569, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In100132569, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out100132569|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In100132569} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 21:15:02,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L865-->L865-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1532753052 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1532753052 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite46_Out1532753052|)) (and (= ~y$r_buff0_thd0~0_In1532753052 |ULTIMATE.start_main_#t~ite46_Out1532753052|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1532753052, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1532753052} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1532753052, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1532753052, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1532753052|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 21:15:02,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L866-->L866-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-969953556 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-969953556 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-969953556 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-969953556 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-969953556| ~y$r_buff1_thd0~0_In-969953556) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite47_Out-969953556| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-969953556, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-969953556, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-969953556, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-969953556} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-969953556, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-969953556, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-969953556|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-969953556, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-969953556} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 21:15:02,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L866-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p3_EAX~0_8) (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= 0 v_~__unbuffered_p1_EAX~0_9) (= 0 v_~__unbuffered_p3_EBX~0_8) (= |v_ULTIMATE.start_main_#t~ite47_12| v_~y$r_buff1_thd0~0_15) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_8 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:15:02,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:15:02 BasicIcfg [2019-12-18 21:15:02,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:15:02,275 INFO L168 Benchmark]: Toolchain (without parser) took 128134.26 ms. Allocated memory was 138.9 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 101.5 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 21:15:02,278 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 21:15:02,278 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.74 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.3 MB in the beginning and 155.9 MB in the end (delta: -54.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:15:02,280 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.77 ms. Allocated memory is still 202.9 MB. Free memory was 155.9 MB in the beginning and 153.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:15:02,280 INFO L168 Benchmark]: Boogie Preprocessor took 38.86 ms. Allocated memory is still 202.9 MB. Free memory was 153.3 MB in the beginning and 150.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:15:02,281 INFO L168 Benchmark]: RCFGBuilder took 845.83 ms. Allocated memory is still 202.9 MB. Free memory was 150.7 MB in the beginning and 101.1 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:15:02,281 INFO L168 Benchmark]: TraceAbstraction took 126379.50 ms. Allocated memory was 202.9 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 101.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-18 21:15:02,288 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.53 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.74 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.3 MB in the beginning and 155.9 MB in the end (delta: -54.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.77 ms. Allocated memory is still 202.9 MB. Free memory was 155.9 MB in the beginning and 153.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.86 ms. Allocated memory is still 202.9 MB. Free memory was 153.3 MB in the beginning and 150.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 845.83 ms. Allocated memory is still 202.9 MB. Free memory was 150.7 MB in the beginning and 101.1 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 126379.50 ms. Allocated memory was 202.9 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 101.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 183 ProgramPointsBefore, 90 ProgramPointsAfterwards, 211 TransitionsBefore, 97 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 6901 VarBasedMoverChecksPositive, 180 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 77566 CheckedPairsTotal, 124 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L850] FCALL, FORK 0 pthread_create(&t941, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] FCALL, FORK 0 pthread_create(&t942, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L854] FCALL, FORK 0 pthread_create(&t943, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 1 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t944, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 4 z = 1 [L818] 4 a = 1 [L821] 4 __unbuffered_p3_EAX = a [L824] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L827] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L828] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L757] 2 x = 1 [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L829] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L862] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L863] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L864] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L865] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 125.9s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 29.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4700 SDtfs, 7117 SDslu, 16444 SDs, 0 SdLazy, 5253 SolverSat, 326 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 259 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1548 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177426occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 52.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 221501 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 878 NumberOfCodeBlocks, 878 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 798 ConstructedInterpolants, 0 QuantifiedInterpolants, 133310 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...