/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:58:20,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:58:20,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:58:20,820 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:58:20,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:58:20,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:58:20,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:58:20,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:58:20,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:58:20,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:58:20,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:58:20,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:58:20,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:58:20,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:58:20,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:58:20,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:58:20,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:58:20,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:58:20,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:58:20,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:58:20,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:58:20,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:58:20,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:58:20,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:58:20,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:58:20,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:58:20,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:58:20,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:58:20,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:58:20,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:58:20,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:58:20,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:58:20,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:58:20,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:58:20,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:58:20,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:58:20,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:58:20,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:58:20,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:58:20,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:58:20,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:58:20,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-MCR.epf [2019-12-27 20:58:20,875 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:58:20,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:58:20,876 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:58:20,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:58:20,877 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:58:20,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:58:20,877 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:58:20,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:58:20,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:58:20,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:58:20,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:58:20,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:58:20,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:58:20,878 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:58:20,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:58:20,879 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:58:20,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:58:20,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:58:20,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:58:20,880 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:58:20,880 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:58:20,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:58:20,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:58:20,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:58:20,881 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:58:20,881 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:58:20,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:58:20,881 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:58:20,881 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:58:20,881 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:58:20,882 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:58:20,882 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:58:21,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:58:21,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:58:21,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:58:21,184 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:58:21,185 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:58:21,186 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_power.opt.i [2019-12-27 20:58:21,248 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e74d1cbb8/a052ba16ff1f4e85a8d3d828953cb2fc/FLAGbff49ce7d [2019-12-27 20:58:21,808 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:58:21,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.opt.i [2019-12-27 20:58:21,822 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e74d1cbb8/a052ba16ff1f4e85a8d3d828953cb2fc/FLAGbff49ce7d [2019-12-27 20:58:22,074 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e74d1cbb8/a052ba16ff1f4e85a8d3d828953cb2fc [2019-12-27 20:58:22,083 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:58:22,085 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:58:22,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:58:22,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:58:22,090 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:58:22,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:58:22" (1/1) ... [2019-12-27 20:58:22,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@562bdfeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:22, skipping insertion in model container [2019-12-27 20:58:22,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:58:22" (1/1) ... [2019-12-27 20:58:22,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:58:22,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:58:22,726 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:58:22,742 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:58:22,796 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:58:22,873 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:58:22,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:22 WrapperNode [2019-12-27 20:58:22,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:58:22,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:58:22,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:58:22,875 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:58:22,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:22" (1/1) ... [2019-12-27 20:58:22,903 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:22" (1/1) ... [2019-12-27 20:58:22,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:58:22,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:58:22,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:58:22,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:58:22,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:22" (1/1) ... [2019-12-27 20:58:22,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:22" (1/1) ... [2019-12-27 20:58:22,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:22" (1/1) ... [2019-12-27 20:58:22,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:22" (1/1) ... [2019-12-27 20:58:22,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:22" (1/1) ... [2019-12-27 20:58:22,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:22" (1/1) ... [2019-12-27 20:58:22,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:22" (1/1) ... [2019-12-27 20:58:22,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:58:22,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:58:22,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:58:22,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:58:22,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:58:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:58:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:58:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:58:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:58:23,050 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:58:23,050 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:58:23,050 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:58:23,050 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:58:23,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:58:23,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:58:23,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:58:23,053 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 20:58:23,768 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:58:23,768 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:58:23,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:58:23 BoogieIcfgContainer [2019-12-27 20:58:23,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:58:23,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:58:23,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:58:23,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:58:23,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:58:22" (1/3) ... [2019-12-27 20:58:23,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3643b7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:58:23, skipping insertion in model container [2019-12-27 20:58:23,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:22" (2/3) ... [2019-12-27 20:58:23,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3643b7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:58:23, skipping insertion in model container [2019-12-27 20:58:23,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:58:23" (3/3) ... [2019-12-27 20:58:23,778 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_power.opt.i [2019-12-27 20:58:23,788 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:58:23,788 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:58:23,796 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:58:23,797 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:58:23,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,834 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,834 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,835 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,835 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,836 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,846 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,846 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,891 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,892 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,892 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,898 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,901 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:23,916 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 20:58:23,932 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:58:23,933 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:58:23,933 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:58:23,933 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:58:23,933 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:58:23,933 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:58:23,933 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:58:23,933 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:58:23,949 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-12-27 20:58:23,951 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-27 20:58:24,035 INFO L132 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-27 20:58:24,035 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:58:24,047 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:58:24,064 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-27 20:58:24,109 INFO L132 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-27 20:58:24,110 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:58:24,116 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:58:24,132 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 20:58:24,133 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:58:27,484 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 20:58:27,604 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 20:58:27,635 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49761 [2019-12-27 20:58:27,635 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 20:58:27,638 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 83 transitions [2019-12-27 20:58:28,047 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8010 states. [2019-12-27 20:58:28,049 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states. [2019-12-27 20:58:28,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:58:28,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:28,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:58:28,057 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:28,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:28,063 INFO L82 PathProgramCache]: Analyzing trace with hash 798121, now seen corresponding path program 1 times [2019-12-27 20:58:28,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:28,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246953523] [2019-12-27 20:58:28,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:28,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:58:28,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246953523] [2019-12-27 20:58:28,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:28,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:58:28,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1916699499] [2019-12-27 20:58:28,276 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:28,281 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:28,294 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:58:28,294 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:28,298 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:28,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:58:28,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:28,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:58:28,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:28,313 INFO L87 Difference]: Start difference. First operand 8010 states. Second operand 3 states. [2019-12-27 20:58:28,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:28,603 INFO L93 Difference]: Finished difference Result 7842 states and 25482 transitions. [2019-12-27 20:58:28,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:58:28,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:58:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:28,697 INFO L225 Difference]: With dead ends: 7842 [2019-12-27 20:58:28,697 INFO L226 Difference]: Without dead ends: 7386 [2019-12-27 20:58:28,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:28,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7386 states. [2019-12-27 20:58:29,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7386 to 7386. [2019-12-27 20:58:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7386 states. [2019-12-27 20:58:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7386 states to 7386 states and 23956 transitions. [2019-12-27 20:58:29,143 INFO L78 Accepts]: Start accepts. Automaton has 7386 states and 23956 transitions. Word has length 3 [2019-12-27 20:58:29,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:29,143 INFO L462 AbstractCegarLoop]: Abstraction has 7386 states and 23956 transitions. [2019-12-27 20:58:29,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:58:29,144 INFO L276 IsEmpty]: Start isEmpty. Operand 7386 states and 23956 transitions. [2019-12-27 20:58:29,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:58:29,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:29,148 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:29,148 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:29,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:29,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1045751384, now seen corresponding path program 1 times [2019-12-27 20:58:29,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:29,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18337244] [2019-12-27 20:58:29,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:58:29,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18337244] [2019-12-27 20:58:29,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:29,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:58:29,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1932064478] [2019-12-27 20:58:29,203 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:29,204 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:29,207 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:58:29,207 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:29,207 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:29,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:58:29,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:29,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:58:29,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:29,210 INFO L87 Difference]: Start difference. First operand 7386 states and 23956 transitions. Second operand 3 states. [2019-12-27 20:58:29,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:29,236 INFO L93 Difference]: Finished difference Result 1203 states and 2726 transitions. [2019-12-27 20:58:29,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:58:29,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 20:58:29,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:29,243 INFO L225 Difference]: With dead ends: 1203 [2019-12-27 20:58:29,243 INFO L226 Difference]: Without dead ends: 1203 [2019-12-27 20:58:29,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:29,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-12-27 20:58:29,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1203. [2019-12-27 20:58:29,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-12-27 20:58:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 2726 transitions. [2019-12-27 20:58:29,276 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 2726 transitions. Word has length 11 [2019-12-27 20:58:29,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:29,277 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 2726 transitions. [2019-12-27 20:58:29,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:58:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 2726 transitions. [2019-12-27 20:58:29,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:58:29,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:29,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:29,279 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:29,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:29,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1102482469, now seen corresponding path program 1 times [2019-12-27 20:58:29,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:29,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227905790] [2019-12-27 20:58:29,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:58:29,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227905790] [2019-12-27 20:58:29,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:29,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:58:29,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [369107848] [2019-12-27 20:58:29,341 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:29,343 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:29,347 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:58:29,347 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:29,347 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:29,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:58:29,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:29,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:58:29,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:29,349 INFO L87 Difference]: Start difference. First operand 1203 states and 2726 transitions. Second operand 3 states. [2019-12-27 20:58:29,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:29,433 INFO L93 Difference]: Finished difference Result 1939 states and 4348 transitions. [2019-12-27 20:58:29,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:58:29,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 20:58:29,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:29,446 INFO L225 Difference]: With dead ends: 1939 [2019-12-27 20:58:29,447 INFO L226 Difference]: Without dead ends: 1939 [2019-12-27 20:58:29,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:29,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-12-27 20:58:29,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1336. [2019-12-27 20:58:29,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-12-27 20:58:29,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 3074 transitions. [2019-12-27 20:58:29,499 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 3074 transitions. Word has length 14 [2019-12-27 20:58:29,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:29,500 INFO L462 AbstractCegarLoop]: Abstraction has 1336 states and 3074 transitions. [2019-12-27 20:58:29,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:58:29,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 3074 transitions. [2019-12-27 20:58:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:58:29,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:29,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:29,502 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:29,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:29,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1024507146, now seen corresponding path program 1 times [2019-12-27 20:58:29,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:29,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947921523] [2019-12-27 20:58:29,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:29,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:58:29,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947921523] [2019-12-27 20:58:29,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:29,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:58:29,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [341004164] [2019-12-27 20:58:29,579 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:29,581 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:29,584 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:58:29,585 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:29,585 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:29,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:58:29,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:29,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:58:29,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:58:29,586 INFO L87 Difference]: Start difference. First operand 1336 states and 3074 transitions. Second operand 4 states. [2019-12-27 20:58:29,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:29,764 INFO L93 Difference]: Finished difference Result 1693 states and 3800 transitions. [2019-12-27 20:58:29,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:58:29,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 20:58:29,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:29,775 INFO L225 Difference]: With dead ends: 1693 [2019-12-27 20:58:29,776 INFO L226 Difference]: Without dead ends: 1693 [2019-12-27 20:58:29,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:29,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2019-12-27 20:58:29,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1629. [2019-12-27 20:58:29,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1629 states. [2019-12-27 20:58:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 3676 transitions. [2019-12-27 20:58:29,825 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 3676 transitions. Word has length 14 [2019-12-27 20:58:29,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:29,825 INFO L462 AbstractCegarLoop]: Abstraction has 1629 states and 3676 transitions. [2019-12-27 20:58:29,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:58:29,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 3676 transitions. [2019-12-27 20:58:29,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:58:29,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:29,827 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:29,827 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:29,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:29,827 INFO L82 PathProgramCache]: Analyzing trace with hash -399327403, now seen corresponding path program 1 times [2019-12-27 20:58:29,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:29,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111938458] [2019-12-27 20:58:29,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:29,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:58:29,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111938458] [2019-12-27 20:58:29,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:29,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:58:29,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [922653169] [2019-12-27 20:58:29,940 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:29,941 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:29,944 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:58:29,945 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:29,945 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:29,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:58:29,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:29,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:58:29,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:58:29,946 INFO L87 Difference]: Start difference. First operand 1629 states and 3676 transitions. Second operand 4 states. [2019-12-27 20:58:30,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:30,198 INFO L93 Difference]: Finished difference Result 1964 states and 4378 transitions. [2019-12-27 20:58:30,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:58:30,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 20:58:30,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:30,210 INFO L225 Difference]: With dead ends: 1964 [2019-12-27 20:58:30,210 INFO L226 Difference]: Without dead ends: 1964 [2019-12-27 20:58:30,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:30,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-12-27 20:58:30,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1704. [2019-12-27 20:58:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-12-27 20:58:30,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 3842 transitions. [2019-12-27 20:58:30,258 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 3842 transitions. Word has length 14 [2019-12-27 20:58:30,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:30,258 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 3842 transitions. [2019-12-27 20:58:30,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:58:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 3842 transitions. [2019-12-27 20:58:30,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:58:30,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:30,261 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:30,261 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:30,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:30,262 INFO L82 PathProgramCache]: Analyzing trace with hash -524969657, now seen corresponding path program 1 times [2019-12-27 20:58:30,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:30,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806403835] [2019-12-27 20:58:30,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:58:30,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806403835] [2019-12-27 20:58:30,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:30,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:58:30,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1556741234] [2019-12-27 20:58:30,375 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:30,381 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:30,392 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 20:58:30,392 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:30,393 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:30,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:58:30,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:30,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:58:30,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:30,394 INFO L87 Difference]: Start difference. First operand 1704 states and 3842 transitions. Second operand 5 states. [2019-12-27 20:58:30,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:30,667 INFO L93 Difference]: Finished difference Result 2231 states and 4892 transitions. [2019-12-27 20:58:30,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:58:30,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 20:58:30,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:30,691 INFO L225 Difference]: With dead ends: 2231 [2019-12-27 20:58:30,697 INFO L226 Difference]: Without dead ends: 2231 [2019-12-27 20:58:30,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:58:30,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-12-27 20:58:30,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1975. [2019-12-27 20:58:30,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2019-12-27 20:58:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 4398 transitions. [2019-12-27 20:58:30,752 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 4398 transitions. Word has length 25 [2019-12-27 20:58:30,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:30,753 INFO L462 AbstractCegarLoop]: Abstraction has 1975 states and 4398 transitions. [2019-12-27 20:58:30,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:58:30,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 4398 transitions. [2019-12-27 20:58:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:58:30,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:30,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:30,756 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:30,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:30,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1656128157, now seen corresponding path program 1 times [2019-12-27 20:58:30,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:30,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556485255] [2019-12-27 20:58:30,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:30,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:58:30,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556485255] [2019-12-27 20:58:30,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:30,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:58:30,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [411477333] [2019-12-27 20:58:30,854 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:30,860 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:30,871 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 20:58:30,872 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:30,876 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:30,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:58:30,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:30,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:58:30,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:30,877 INFO L87 Difference]: Start difference. First operand 1975 states and 4398 transitions. Second operand 3 states. [2019-12-27 20:58:30,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:30,898 INFO L93 Difference]: Finished difference Result 1974 states and 4396 transitions. [2019-12-27 20:58:30,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:58:30,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 20:58:30,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:30,917 INFO L225 Difference]: With dead ends: 1974 [2019-12-27 20:58:30,917 INFO L226 Difference]: Without dead ends: 1974 [2019-12-27 20:58:30,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:30,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-12-27 20:58:30,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1974. [2019-12-27 20:58:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1974 states. [2019-12-27 20:58:30,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 4396 transitions. [2019-12-27 20:58:30,982 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 4396 transitions. Word has length 26 [2019-12-27 20:58:30,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:30,982 INFO L462 AbstractCegarLoop]: Abstraction has 1974 states and 4396 transitions. [2019-12-27 20:58:30,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:58:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 4396 transitions. [2019-12-27 20:58:30,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:58:30,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:30,986 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] [2019-12-27 20:58:30,986 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:30,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:30,986 INFO L82 PathProgramCache]: Analyzing trace with hash 2023210146, now seen corresponding path program 1 times [2019-12-27 20:58:30,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:30,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830184868] [2019-12-27 20:58:30,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:31,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:58:31,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830184868] [2019-12-27 20:58:31,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:31,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:58:31,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1631866071] [2019-12-27 20:58:31,101 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:31,106 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:31,115 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 20:58:31,116 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:31,116 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:31,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:58:31,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:31,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:58:31,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:31,117 INFO L87 Difference]: Start difference. First operand 1974 states and 4396 transitions. Second operand 5 states. [2019-12-27 20:58:31,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:31,419 INFO L93 Difference]: Finished difference Result 2351 states and 5130 transitions. [2019-12-27 20:58:31,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:58:31,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 20:58:31,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:31,434 INFO L225 Difference]: With dead ends: 2351 [2019-12-27 20:58:31,434 INFO L226 Difference]: Without dead ends: 2351 [2019-12-27 20:58:31,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:58:31,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2351 states. [2019-12-27 20:58:31,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2351 to 1824. [2019-12-27 20:58:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-12-27 20:58:31,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 4080 transitions. [2019-12-27 20:58:31,488 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 4080 transitions. Word has length 26 [2019-12-27 20:58:31,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:31,492 INFO L462 AbstractCegarLoop]: Abstraction has 1824 states and 4080 transitions. [2019-12-27 20:58:31,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:58:31,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 4080 transitions. [2019-12-27 20:58:31,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:58:31,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:31,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:31,495 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:31,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:31,497 INFO L82 PathProgramCache]: Analyzing trace with hash 394176671, now seen corresponding path program 1 times [2019-12-27 20:58:31,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:31,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238764552] [2019-12-27 20:58:31,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:31,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:58:31,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238764552] [2019-12-27 20:58:31,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:31,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:58:31,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [392792588] [2019-12-27 20:58:31,590 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:31,596 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:31,607 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 20:58:31,608 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:31,728 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:58:31,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:58:31,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:31,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:58:31,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:58:31,729 INFO L87 Difference]: Start difference. First operand 1824 states and 4080 transitions. Second operand 8 states. [2019-12-27 20:58:32,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:32,546 INFO L93 Difference]: Finished difference Result 2655 states and 5824 transitions. [2019-12-27 20:58:32,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:58:32,546 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 20:58:32,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:32,554 INFO L225 Difference]: With dead ends: 2655 [2019-12-27 20:58:32,554 INFO L226 Difference]: Without dead ends: 2655 [2019-12-27 20:58:32,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:58:32,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2019-12-27 20:58:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2340. [2019-12-27 20:58:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2340 states. [2019-12-27 20:58:32,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 2340 states and 5204 transitions. [2019-12-27 20:58:32,611 INFO L78 Accepts]: Start accepts. Automaton has 2340 states and 5204 transitions. Word has length 27 [2019-12-27 20:58:32,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:32,612 INFO L462 AbstractCegarLoop]: Abstraction has 2340 states and 5204 transitions. [2019-12-27 20:58:32,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:58:32,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 5204 transitions. [2019-12-27 20:58:32,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:58:32,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:32,616 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-27 20:58:32,616 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:32,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:32,617 INFO L82 PathProgramCache]: Analyzing trace with hash 2139749391, now seen corresponding path program 1 times [2019-12-27 20:58:32,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:32,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420475306] [2019-12-27 20:58:32,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:32,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:58:32,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420475306] [2019-12-27 20:58:32,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:32,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:58:32,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [104234216] [2019-12-27 20:58:32,686 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:32,692 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:32,709 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 20:58:32,709 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:32,727 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:58:32,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:58:32,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:32,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:58:32,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:32,728 INFO L87 Difference]: Start difference. First operand 2340 states and 5204 transitions. Second operand 5 states. [2019-12-27 20:58:32,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:32,752 INFO L93 Difference]: Finished difference Result 1309 states and 2783 transitions. [2019-12-27 20:58:32,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:58:32,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 20:58:32,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:32,756 INFO L225 Difference]: With dead ends: 1309 [2019-12-27 20:58:32,756 INFO L226 Difference]: Without dead ends: 1309 [2019-12-27 20:58:32,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:32,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2019-12-27 20:58:32,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1214. [2019-12-27 20:58:32,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-12-27 20:58:32,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 2608 transitions. [2019-12-27 20:58:32,844 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 2608 transitions. Word has length 28 [2019-12-27 20:58:32,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:32,845 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 2608 transitions. [2019-12-27 20:58:32,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:58:32,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 2608 transitions. [2019-12-27 20:58:32,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:58:32,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:32,850 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] [2019-12-27 20:58:32,850 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:32,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:32,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1815455026, now seen corresponding path program 1 times [2019-12-27 20:58:32,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:32,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251329872] [2019-12-27 20:58:32,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:32,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-27 20:58:32,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251329872] [2019-12-27 20:58:32,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:32,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:58:32,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [330697432] [2019-12-27 20:58:32,970 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:32,993 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:33,053 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 131 transitions. [2019-12-27 20:58:33,054 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:33,141 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:58:33,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:58:33,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:33,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:58:33,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:58:33,143 INFO L87 Difference]: Start difference. First operand 1214 states and 2608 transitions. Second operand 10 states. [2019-12-27 20:58:33,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:33,632 INFO L93 Difference]: Finished difference Result 3206 states and 6700 transitions. [2019-12-27 20:58:33,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 20:58:33,632 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-12-27 20:58:33,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:33,640 INFO L225 Difference]: With dead ends: 3206 [2019-12-27 20:58:33,640 INFO L226 Difference]: Without dead ends: 2107 [2019-12-27 20:58:33,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:58:33,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2019-12-27 20:58:33,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 1250. [2019-12-27 20:58:33,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2019-12-27 20:58:33,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 2682 transitions. [2019-12-27 20:58:33,680 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 2682 transitions. Word has length 51 [2019-12-27 20:58:33,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:33,681 INFO L462 AbstractCegarLoop]: Abstraction has 1250 states and 2682 transitions. [2019-12-27 20:58:33,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:58:33,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 2682 transitions. [2019-12-27 20:58:33,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:58:33,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:33,685 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] [2019-12-27 20:58:33,685 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:33,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:33,686 INFO L82 PathProgramCache]: Analyzing trace with hash 700498790, now seen corresponding path program 2 times [2019-12-27 20:58:33,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:33,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473078545] [2019-12-27 20:58:33,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:58:33,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473078545] [2019-12-27 20:58:33,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:33,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:58:33,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [624136473] [2019-12-27 20:58:33,765 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:33,778 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:33,901 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 103 states and 142 transitions. [2019-12-27 20:58:33,901 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:33,910 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:58:33,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:58:33,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:33,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:58:33,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:33,911 INFO L87 Difference]: Start difference. First operand 1250 states and 2682 transitions. Second operand 3 states. [2019-12-27 20:58:33,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:33,973 INFO L93 Difference]: Finished difference Result 1643 states and 3481 transitions. [2019-12-27 20:58:33,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:58:33,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 20:58:33,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:33,979 INFO L225 Difference]: With dead ends: 1643 [2019-12-27 20:58:33,979 INFO L226 Difference]: Without dead ends: 1643 [2019-12-27 20:58:33,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:33,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2019-12-27 20:58:34,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1340. [2019-12-27 20:58:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2019-12-27 20:58:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 2879 transitions. [2019-12-27 20:58:34,010 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 2879 transitions. Word has length 51 [2019-12-27 20:58:34,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:34,010 INFO L462 AbstractCegarLoop]: Abstraction has 1340 states and 2879 transitions. [2019-12-27 20:58:34,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:58:34,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 2879 transitions. [2019-12-27 20:58:34,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:58:34,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:34,014 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] [2019-12-27 20:58:34,014 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:34,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:34,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1020694631, now seen corresponding path program 1 times [2019-12-27 20:58:34,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:34,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454534518] [2019-12-27 20:58:34,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:58:34,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454534518] [2019-12-27 20:58:34,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:34,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:58:34,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [169492826] [2019-12-27 20:58:34,132 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:34,148 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:34,234 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 146 transitions. [2019-12-27 20:58:34,234 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:34,240 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:58:34,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:58:34,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:34,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:58:34,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:58:34,241 INFO L87 Difference]: Start difference. First operand 1340 states and 2879 transitions. Second operand 4 states. [2019-12-27 20:58:34,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:34,313 INFO L93 Difference]: Finished difference Result 1340 states and 2864 transitions. [2019-12-27 20:58:34,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:58:34,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-27 20:58:34,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:34,318 INFO L225 Difference]: With dead ends: 1340 [2019-12-27 20:58:34,318 INFO L226 Difference]: Without dead ends: 1340 [2019-12-27 20:58:34,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:34,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2019-12-27 20:58:34,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1208. [2019-12-27 20:58:34,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2019-12-27 20:58:34,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 2584 transitions. [2019-12-27 20:58:34,345 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 2584 transitions. Word has length 52 [2019-12-27 20:58:34,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:34,346 INFO L462 AbstractCegarLoop]: Abstraction has 1208 states and 2584 transitions. [2019-12-27 20:58:34,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:58:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 2584 transitions. [2019-12-27 20:58:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:58:34,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:34,350 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] [2019-12-27 20:58:34,350 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:34,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:34,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1332632369, now seen corresponding path program 1 times [2019-12-27 20:58:34,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:34,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068416403] [2019-12-27 20:58:34,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:34,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:58:34,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068416403] [2019-12-27 20:58:34,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:34,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:58:34,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2003854464] [2019-12-27 20:58:34,690 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:34,705 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:34,749 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 100 transitions. [2019-12-27 20:58:34,749 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:34,844 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:58:34,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:58:34,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:34,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:58:34,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:58:34,845 INFO L87 Difference]: Start difference. First operand 1208 states and 2584 transitions. Second operand 11 states. [2019-12-27 20:58:35,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:35,836 INFO L93 Difference]: Finished difference Result 1474 states and 2991 transitions. [2019-12-27 20:58:35,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 20:58:35,836 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-12-27 20:58:35,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:35,841 INFO L225 Difference]: With dead ends: 1474 [2019-12-27 20:58:35,841 INFO L226 Difference]: Without dead ends: 1474 [2019-12-27 20:58:35,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:58:35,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2019-12-27 20:58:35,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1114. [2019-12-27 20:58:35,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1114 states. [2019-12-27 20:58:35,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 2301 transitions. [2019-12-27 20:58:35,866 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 2301 transitions. Word has length 52 [2019-12-27 20:58:35,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:35,866 INFO L462 AbstractCegarLoop]: Abstraction has 1114 states and 2301 transitions. [2019-12-27 20:58:35,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:58:35,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 2301 transitions. [2019-12-27 20:58:35,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:58:35,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:35,869 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] [2019-12-27 20:58:35,869 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:35,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:35,870 INFO L82 PathProgramCache]: Analyzing trace with hash 509482779, now seen corresponding path program 2 times [2019-12-27 20:58:35,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:35,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722661958] [2019-12-27 20:58:35,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:58:35,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722661958] [2019-12-27 20:58:35,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:35,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:58:35,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1361364842] [2019-12-27 20:58:35,934 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:35,952 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:36,112 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 114 transitions. [2019-12-27 20:58:36,113 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:36,113 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:36,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:58:36,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:36,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:58:36,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:36,114 INFO L87 Difference]: Start difference. First operand 1114 states and 2301 transitions. Second operand 3 states. [2019-12-27 20:58:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:36,129 INFO L93 Difference]: Finished difference Result 1113 states and 2299 transitions. [2019-12-27 20:58:36,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:58:36,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 20:58:36,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:36,132 INFO L225 Difference]: With dead ends: 1113 [2019-12-27 20:58:36,132 INFO L226 Difference]: Without dead ends: 1113 [2019-12-27 20:58:36,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:36,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-12-27 20:58:36,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 805. [2019-12-27 20:58:36,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-12-27 20:58:36,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1705 transitions. [2019-12-27 20:58:36,148 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1705 transitions. Word has length 52 [2019-12-27 20:58:36,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:36,149 INFO L462 AbstractCegarLoop]: Abstraction has 805 states and 1705 transitions. [2019-12-27 20:58:36,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:58:36,149 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1705 transitions. [2019-12-27 20:58:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:58:36,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:36,151 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:36,151 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:36,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:36,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1167104957, now seen corresponding path program 1 times [2019-12-27 20:58:36,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:36,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77839107] [2019-12-27 20:58:36,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:58:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:58:36,254 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:58:36,254 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:58:36,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_50| 0 0))) (and (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~__unbuffered_p0_EAX~0_13) (= 0 v_~weak$$choice0~0_8) (= v_~z$w_buff0_used~0_109 0) (= v_~main$tmp_guard0~0_7 0) (= v_~z~0_24 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t899~0.base_27| 1) |v_#valid_48|) (= 0 v_~z$r_buff1_thd0~0_21) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t899~0.base_27|) (= v_~z$r_buff0_thd2~0_79 0) (= 0 v_~z$flush_delayed~0_13) (= 0 v_~y~0_7) (= 0 v_~z$r_buff1_thd1~0_18) (= 0 v_~x~0_7) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd1~0_24 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t899~0.base_27|) 0) (= 0 v_~z$mem_tmp~0_9) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t899~0.base_27| 4)) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_18 0) (= |v_ULTIMATE.start_main_~#t899~0.offset_20| 0) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= 0 v_~z$w_buff0~0_28) (= 0 v_~z$w_buff1_used~0_69) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~z$w_buff1~0_26) (= 0 v_~z$r_buff1_thd2~0_50) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_cnt~0_16) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t899~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t899~0.base_27|) |v_ULTIMATE.start_main_~#t899~0.offset_20| 0)) |v_#memory_int_15|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t899~0.base=|v_ULTIMATE.start_main_~#t899~0.base_27|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_50, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_26, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_22|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_21, ULTIMATE.start_main_~#t900~0.base=|v_ULTIMATE.start_main_~#t900~0.base_19|, #length=|v_#length_15|, ~y~0=v_~y~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_79, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_109, ~z$w_buff0~0=v_~z$w_buff0~0_28, ULTIMATE.start_main_~#t900~0.offset=|v_ULTIMATE.start_main_~#t900~0.offset_16|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, ULTIMATE.start_main_~#t899~0.offset=|v_ULTIMATE.start_main_~#t899~0.offset_20|, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_48|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_18, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t899~0.base, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t900~0.base, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t900~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t899~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 20:58:36,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L804-1-->L806: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t900~0.base_13| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t900~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t900~0.base_13|) |v_ULTIMATE.start_main_~#t900~0.offset_11| 1))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t900~0.base_13|) (= |v_ULTIMATE.start_main_~#t900~0.offset_11| 0) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t900~0.base_13|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t900~0.base_13|)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t900~0.base_13| 1) |v_#valid_29|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t900~0.base=|v_ULTIMATE.start_main_~#t900~0.base_13|, ULTIMATE.start_main_~#t900~0.offset=|v_ULTIMATE.start_main_~#t900~0.offset_11|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t900~0.base, ULTIMATE.start_main_~#t900~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 20:58:36,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= (mod ~z$w_buff1_used~0_Out754446862 256) 0) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out754446862| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out754446862) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out754446862|) (= P0Thread1of1ForFork0_~arg.base_Out754446862 |P0Thread1of1ForFork0_#in~arg.base_In754446862|) (= ~z$w_buff1~0_Out754446862 ~z$w_buff0~0_In754446862) (= 1 ~z$w_buff0_used~0_Out754446862) (= ~z$w_buff0_used~0_In754446862 ~z$w_buff1_used~0_Out754446862) (= ~z$w_buff0~0_Out754446862 1) (= |P0Thread1of1ForFork0_#in~arg.offset_In754446862| P0Thread1of1ForFork0_~arg.offset_Out754446862)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In754446862|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In754446862, ~z$w_buff0~0=~z$w_buff0~0_In754446862, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In754446862|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In754446862|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out754446862, ~z$w_buff0~0=~z$w_buff0~0_Out754446862, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out754446862, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out754446862, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In754446862|, ~z$w_buff1~0=~z$w_buff1~0_Out754446862, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out754446862, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out754446862|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out754446862} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 20:58:36,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L773-->L773-8: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out1054457475| |P1Thread1of1ForFork1_#t~ite24_Out1054457475|)) (.cse0 (= (mod ~weak$$choice2~0_In1054457475 256) 0)) (.cse4 (= 0 (mod ~z$w_buff0_used~0_In1054457475 256))) (.cse5 (= (mod ~z$w_buff1_used~0_In1054457475 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1054457475 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1054457475 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In1054457475| |P1Thread1of1ForFork1_#t~ite22_Out1054457475|) (or (and (= |P1Thread1of1ForFork1_#t~ite23_Out1054457475| |P1Thread1of1ForFork1_#t~ite23_In1054457475|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite24_Out1054457475| ~z$w_buff1_used~0_In1054457475)) (and .cse1 .cse0 (or (and .cse2 .cse3) .cse4 (and .cse2 .cse5)) (= |P1Thread1of1ForFork1_#t~ite23_Out1054457475| ~z$w_buff1_used~0_In1054457475)))) (let ((.cse6 (not .cse2))) (and .cse1 .cse0 (not .cse4) (or .cse6 (not .cse5)) (= |P1Thread1of1ForFork1_#t~ite23_Out1054457475| |P1Thread1of1ForFork1_#t~ite22_Out1054457475|) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out1054457475|) (or .cse6 (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1054457475, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1054457475, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1054457475, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1054457475|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In1054457475|, ~weak$$choice2~0=~weak$$choice2~0_In1054457475, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1054457475} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1054457475, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1054457475, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1054457475|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1054457475, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1054457475|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out1054457475|, ~weak$$choice2~0=~weak$$choice2~0_In1054457475, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1054457475} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 20:58:36,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L774-->L775: Formula: (and (= v_~z$r_buff0_thd2~0_64 v_~z$r_buff0_thd2~0_63) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_64} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_63, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 20:58:36,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L775-->L775-8: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out1581137003| |P1Thread1of1ForFork1_#t~ite29_Out1581137003|)) (.cse1 (= 0 (mod ~weak$$choice2~0_In1581137003 256))) (.cse5 (= 0 (mod ~z$r_buff1_thd2~0_In1581137003 256))) (.cse4 (= (mod ~z$w_buff0_used~0_In1581137003 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1581137003 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In1581137003 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_In1581137003| |P1Thread1of1ForFork1_#t~ite28_Out1581137003|) (or (and .cse0 .cse1 (= ~z$r_buff1_thd2~0_In1581137003 |P1Thread1of1ForFork1_#t~ite29_Out1581137003|) (or (and .cse2 .cse3) .cse4 (and .cse5 .cse2))) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In1581137003| |P1Thread1of1ForFork1_#t~ite29_Out1581137003|) (= |P1Thread1of1ForFork1_#t~ite30_Out1581137003| ~z$r_buff1_thd2~0_In1581137003)))) (let ((.cse6 (not .cse2))) (and (= |P1Thread1of1ForFork1_#t~ite28_Out1581137003| |P1Thread1of1ForFork1_#t~ite29_Out1581137003|) .cse0 .cse1 (= |P1Thread1of1ForFork1_#t~ite28_Out1581137003| 0) (or .cse6 (not .cse5)) (not .cse4) (or .cse6 (not .cse3)))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1581137003|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1581137003, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1581137003, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1581137003, ~weak$$choice2~0=~weak$$choice2~0_In1581137003, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1581137003, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In1581137003|} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1581137003|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1581137003|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1581137003, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1581137003, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1581137003, ~weak$$choice2~0=~weak$$choice2~0_In1581137003, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1581137003, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1581137003|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 20:58:36,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_17 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 20:58:36,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In1224212908 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1224212908 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1224212908| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1224212908| ~z$w_buff0_used~0_In1224212908) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1224212908, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1224212908} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1224212908|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1224212908, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1224212908} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 20:58:36,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1933167268 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In1933167268 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1933167268 256))) (.cse0 (= (mod ~z$r_buff1_thd1~0_In1933167268 256) 0))) (or (and (= ~z$w_buff1_used~0_In1933167268 |P0Thread1of1ForFork0_#t~ite6_Out1933167268|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1933167268|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1933167268, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1933167268, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1933167268, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1933167268} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1933167268|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1933167268, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1933167268, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1933167268, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1933167268} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 20:58:36,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In822212038 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In822212038 256) 0))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out822212038 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In822212038 ~z$r_buff0_thd1~0_Out822212038)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In822212038, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In822212038} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In822212038, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out822212038|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out822212038} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:58:36,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In693489664 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In693489664 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In693489664 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In693489664 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out693489664| ~z$r_buff1_thd1~0_In693489664)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out693489664| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In693489664, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In693489664, ~z$w_buff1_used~0=~z$w_buff1_used~0_In693489664, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In693489664} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In693489664, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out693489664|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In693489664, ~z$w_buff1_used~0=~z$w_buff1_used~0_In693489664, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In693489664} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:58:36,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In32423083 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out32423083| |P1Thread1of1ForFork1_#t~ite32_Out32423083|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In32423083 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In32423083 |P1Thread1of1ForFork1_#t~ite32_Out32423083|) .cse2) (and (= |P1Thread1of1ForFork1_#t~ite32_Out32423083| ~z$w_buff1~0_In32423083) (not .cse0) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In32423083, ~z$w_buff1_used~0=~z$w_buff1_used~0_In32423083, ~z$w_buff1~0=~z$w_buff1~0_In32423083, ~z~0=~z~0_In32423083} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In32423083, ~z$w_buff1_used~0=~z$w_buff1_used~0_In32423083, ~z$w_buff1~0=~z$w_buff1~0_In32423083, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out32423083|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out32423083|, ~z~0=~z~0_In32423083} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 20:58:36,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In288697797 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In288697797 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out288697797| 0)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out288697797| ~z$w_buff0_used~0_In288697797) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In288697797, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In288697797} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In288697797, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out288697797|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In288697797} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 20:58:36,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-2129553959 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-2129553959 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-2129553959 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2129553959 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-2129553959| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite35_Out-2129553959| ~z$w_buff1_used~0_In-2129553959) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2129553959, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2129553959, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2129553959, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2129553959} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2129553959, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2129553959, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2129553959, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-2129553959|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2129553959} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 20:58:36,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In487999895 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In487999895 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out487999895|) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In487999895 |P1Thread1of1ForFork1_#t~ite36_Out487999895|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In487999895, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In487999895} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In487999895, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In487999895, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out487999895|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 20:58:36,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In457058894 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In457058894 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In457058894 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In457058894 256) 0))) (or (and (= ~z$r_buff1_thd2~0_In457058894 |P1Thread1of1ForFork1_#t~ite37_Out457058894|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite37_Out457058894| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In457058894, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In457058894, ~z$w_buff1_used~0=~z$w_buff1_used~0_In457058894, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In457058894} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In457058894, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In457058894, ~z$w_buff1_used~0=~z$w_buff1_used~0_In457058894, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In457058894, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out457058894|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:58:36,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_40 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_40, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:58:36,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:58:36,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 20:58:36,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-931681051 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-931681051 256)))) (or (and (= ~z~0_In-931681051 |ULTIMATE.start_main_#t~ite40_Out-931681051|) (or .cse0 .cse1)) (and (not .cse1) (= ~z$w_buff1~0_In-931681051 |ULTIMATE.start_main_#t~ite40_Out-931681051|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-931681051, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-931681051, ~z$w_buff1~0=~z$w_buff1~0_In-931681051, ~z~0=~z~0_In-931681051} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-931681051|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-931681051, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-931681051, ~z$w_buff1~0=~z$w_buff1~0_In-931681051, ~z~0=~z~0_In-931681051} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 20:58:36,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_15 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~z~0=v_~z~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-27 20:58:36,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In231415659 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In231415659 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out231415659|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In231415659 |ULTIMATE.start_main_#t~ite42_Out231415659|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In231415659, ~z$w_buff0_used~0=~z$w_buff0_used~0_In231415659} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In231415659, ~z$w_buff0_used~0=~z$w_buff0_used~0_In231415659, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out231415659|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:58:36,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1960997281 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1960997281 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1960997281 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1960997281 256)))) (or (and (= ~z$w_buff1_used~0_In-1960997281 |ULTIMATE.start_main_#t~ite43_Out-1960997281|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1960997281|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1960997281, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1960997281, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1960997281, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1960997281} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1960997281, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1960997281, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1960997281, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1960997281, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1960997281|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 20:58:36,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1455229061 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1455229061 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1455229061| ~z$r_buff0_thd0~0_In-1455229061) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1455229061| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1455229061, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1455229061} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1455229061, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1455229061, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1455229061|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:58:36,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In416973173 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In416973173 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In416973173 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In416973173 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out416973173| 0)) (and (= |ULTIMATE.start_main_#t~ite45_Out416973173| ~z$r_buff1_thd0~0_In416973173) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In416973173, ~z$w_buff0_used~0=~z$w_buff0_used~0_In416973173, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In416973173, ~z$w_buff1_used~0=~z$w_buff1_used~0_In416973173} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In416973173, ~z$w_buff0_used~0=~z$w_buff0_used~0_In416973173, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In416973173, ~z$w_buff1_used~0=~z$w_buff1_used~0_In416973173, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out416973173|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:58:36,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EAX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 1 v_~__unbuffered_p1_EAX~0_8) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_7 0) (= |v_ULTIMATE.start_main_#t~ite45_12| v_~z$r_buff1_thd0~0_14) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:58:36,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:58:36 BasicIcfg [2019-12-27 20:58:36,363 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:58:36,366 INFO L168 Benchmark]: Toolchain (without parser) took 14280.31 ms. Allocated memory was 145.8 MB in the beginning and 524.8 MB in the end (delta: 379.1 MB). Free memory was 102.3 MB in the beginning and 335.5 MB in the end (delta: -233.2 MB). Peak memory consumption was 145.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:36,366 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 20:58:36,367 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.78 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 154.9 MB in the end (delta: -53.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:36,372 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.04 ms. Allocated memory is still 202.9 MB. Free memory was 154.9 MB in the beginning and 152.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:36,372 INFO L168 Benchmark]: Boogie Preprocessor took 39.13 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 150.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:36,375 INFO L168 Benchmark]: RCFGBuilder took 795.45 ms. Allocated memory is still 202.9 MB. Free memory was 150.0 MB in the beginning and 106.0 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:36,375 INFO L168 Benchmark]: TraceAbstraction took 12592.23 ms. Allocated memory was 202.9 MB in the beginning and 524.8 MB in the end (delta: 321.9 MB). Free memory was 105.0 MB in the beginning and 335.5 MB in the end (delta: -230.5 MB). Peak memory consumption was 91.4 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:36,384 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.22 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 787.78 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 154.9 MB in the end (delta: -53.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.04 ms. Allocated memory is still 202.9 MB. Free memory was 154.9 MB in the beginning and 152.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.13 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 150.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 795.45 ms. Allocated memory is still 202.9 MB. Free memory was 150.0 MB in the beginning and 106.0 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12592.23 ms. Allocated memory was 202.9 MB in the beginning and 524.8 MB in the end (delta: 321.9 MB). Free memory was 105.0 MB in the beginning and 335.5 MB in the end (delta: -230.5 MB). Peak memory consumption was 91.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 149 ProgramPointsBefore, 74 ProgramPointsAfterwards, 183 TransitionsBefore, 83 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 28 ChoiceCompositions, 4346 VarBasedMoverChecksPositive, 182 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49761 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t899, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] FCALL, FORK 0 pthread_create(&t900, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.3s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1820 SDtfs, 1488 SDslu, 4509 SDs, 0 SdLazy, 2634 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 37 SyntacticMatches, 22 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8010occurred 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: 1.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 4080 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 499 NumberOfCodeBlocks, 499 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 431 ConstructedInterpolants, 0 QuantifiedInterpolants, 53982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...