/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/mix012_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:03:01,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:03:01,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:03:01,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:03:01,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:03:01,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:03:01,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:03:01,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:03:01,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:03:01,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:03:01,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:03:01,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:03:01,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:03:01,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:03:01,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:03:01,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:03:01,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:03:01,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:03:01,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:03:01,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:03:01,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:03:01,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:03:01,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:03:01,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:03:01,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:03:01,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:03:01,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:03:01,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:03:01,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:03:01,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:03:01,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:03:01,863 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:03:01,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:03:01,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:03:01,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:03:01,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:03:01,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:03:01,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:03:01,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:03:01,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:03:01,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:03:01,870 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:03:01,905 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:03:01,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:03:01,906 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:03:01,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:03:01,909 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:03:01,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:03:01,909 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:03:01,909 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:03:01,909 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:03:01,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:03:01,910 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:03:01,910 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:03:01,910 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:03:01,910 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:03:01,911 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:03:01,911 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:03:01,911 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:03:01,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:03:01,911 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:03:01,911 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:03:01,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:03:01,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:03:01,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:03:01,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:03:01,912 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:03:01,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:03:01,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:03:01,914 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:03:01,914 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:03:01,915 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:03:01,915 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:03:01,915 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:03:02,200 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:03:02,212 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:03:02,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:03:02,217 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:03:02,218 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:03:02,218 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_rmo.opt.i [2019-12-27 20:03:02,278 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1507b7c88/177fa1375c424c2485d7aaff5dd6f447/FLAG775388fa8 [2019-12-27 20:03:02,769 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:03:02,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_rmo.opt.i [2019-12-27 20:03:02,789 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1507b7c88/177fa1375c424c2485d7aaff5dd6f447/FLAG775388fa8 [2019-12-27 20:03:03,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1507b7c88/177fa1375c424c2485d7aaff5dd6f447 [2019-12-27 20:03:03,106 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:03:03,108 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:03:03,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:03:03,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:03:03,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:03:03,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:03:03" (1/1) ... [2019-12-27 20:03:03,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1335d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:03:03, skipping insertion in model container [2019-12-27 20:03:03,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:03:03" (1/1) ... [2019-12-27 20:03:03,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:03:03,194 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:03:03,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:03:03,704 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:03:03,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:03:03,899 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:03:03,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:03:03 WrapperNode [2019-12-27 20:03:03,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:03:03,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:03:03,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:03:03,902 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:03:03,909 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:03:03" (1/1) ... [2019-12-27 20:03:03,928 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:03:03" (1/1) ... [2019-12-27 20:03:03,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:03:03,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:03:03,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:03:03,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:03:03,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:03:03" (1/1) ... [2019-12-27 20:03:03,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:03:03" (1/1) ... [2019-12-27 20:03:03,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:03:03" (1/1) ... [2019-12-27 20:03:03,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:03:03" (1/1) ... [2019-12-27 20:03:03,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:03:03" (1/1) ... [2019-12-27 20:03:03,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:03:03" (1/1) ... [2019-12-27 20:03:03,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:03:03" (1/1) ... [2019-12-27 20:03:04,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:03:04,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:03:04,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:03:04,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:03:04,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:03:03" (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:03:04,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:03:04,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:03:04,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:03:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:03:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:03:04,072 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:03:04,072 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:03:04,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:03:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:03:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:03:04,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:03:04,076 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:03:04,839 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:03:04,840 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:03:04,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:03:04 BoogieIcfgContainer [2019-12-27 20:03:04,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:03:04,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:03:04,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:03:04,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:03:04,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:03:03" (1/3) ... [2019-12-27 20:03:04,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b866e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:03:04, skipping insertion in model container [2019-12-27 20:03:04,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:03:03" (2/3) ... [2019-12-27 20:03:04,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b866e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:03:04, skipping insertion in model container [2019-12-27 20:03:04,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:03:04" (3/3) ... [2019-12-27 20:03:04,857 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_rmo.opt.i [2019-12-27 20:03:04,865 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:03:04,865 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:03:04,873 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:03:04,875 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:03:04,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,912 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,912 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,913 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,913 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,914 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,923 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,923 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,972 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,972 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,973 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,978 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,981 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:03:04,996 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 20:03:05,016 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:03:05,016 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:03:05,016 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:03:05,016 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:03:05,017 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:03:05,017 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:03:05,017 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:03:05,017 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:03:05,034 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 20:03:05,036 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 20:03:05,123 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 20:03:05,123 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:03:05,137 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:03:05,156 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 20:03:05,233 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 20:03:05,234 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:03:05,242 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:03:05,259 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 20:03:05,260 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:03:08,527 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 20:03:08,633 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 20:03:08,657 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49139 [2019-12-27 20:03:08,657 INFO L214 etLargeBlockEncoding]: Total number of compositions: 103 [2019-12-27 20:03:08,661 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-27 20:03:09,097 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8357 states. [2019-12-27 20:03:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 8357 states. [2019-12-27 20:03:09,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:03:09,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:09,117 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:03:09,117 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:03:09,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:09,125 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-12-27 20:03:09,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:09,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604252126] [2019-12-27 20:03:09,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:09,367 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:03:09,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604252126] [2019-12-27 20:03:09,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:09,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:03:09,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2099417233] [2019-12-27 20:03:09,371 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:09,375 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:09,383 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:03:09,384 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:09,386 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:09,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:03:09,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:09,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:03:09,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:09,402 INFO L87 Difference]: Start difference. First operand 8357 states. Second operand 3 states. [2019-12-27 20:03:09,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:09,688 INFO L93 Difference]: Finished difference Result 8205 states and 26514 transitions. [2019-12-27 20:03:09,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:09,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:03:09,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:09,767 INFO L225 Difference]: With dead ends: 8205 [2019-12-27 20:03:09,767 INFO L226 Difference]: Without dead ends: 7724 [2019-12-27 20:03:09,769 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:03:09,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7724 states. [2019-12-27 20:03:10,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7724 to 7724. [2019-12-27 20:03:10,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7724 states. [2019-12-27 20:03:10,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7724 states to 7724 states and 24917 transitions. [2019-12-27 20:03:10,344 INFO L78 Accepts]: Start accepts. Automaton has 7724 states and 24917 transitions. Word has length 3 [2019-12-27 20:03:10,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:10,345 INFO L462 AbstractCegarLoop]: Abstraction has 7724 states and 24917 transitions. [2019-12-27 20:03:10,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:03:10,345 INFO L276 IsEmpty]: Start isEmpty. Operand 7724 states and 24917 transitions. [2019-12-27 20:03:10,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:03:10,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:10,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:03:10,353 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:03:10,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:10,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-12-27 20:03:10,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:10,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781368299] [2019-12-27 20:03:10,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:10,461 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:03:10,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781368299] [2019-12-27 20:03:10,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:10,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:03:10,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1281524622] [2019-12-27 20:03:10,462 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:10,463 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:10,466 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:03:10,466 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:10,466 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:10,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:03:10,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:10,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:03:10,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:10,468 INFO L87 Difference]: Start difference. First operand 7724 states and 24917 transitions. Second operand 3 states. [2019-12-27 20:03:10,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:10,499 INFO L93 Difference]: Finished difference Result 1230 states and 2764 transitions. [2019-12-27 20:03:10,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:10,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 20:03:10,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:10,506 INFO L225 Difference]: With dead ends: 1230 [2019-12-27 20:03:10,507 INFO L226 Difference]: Without dead ends: 1230 [2019-12-27 20:03:10,508 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:03:10,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-12-27 20:03:10,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2019-12-27 20:03:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-27 20:03:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2764 transitions. [2019-12-27 20:03:10,550 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2764 transitions. Word has length 11 [2019-12-27 20:03:10,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:10,550 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2764 transitions. [2019-12-27 20:03:10,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:03:10,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2764 transitions. [2019-12-27 20:03:10,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:03:10,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:10,556 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:03:10,557 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:03:10,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:10,558 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-12-27 20:03:10,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:10,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259953001] [2019-12-27 20:03:10,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:10,734 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:03:10,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259953001] [2019-12-27 20:03:10,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:10,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:03:10,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1287879209] [2019-12-27 20:03:10,736 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:10,739 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:10,744 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:03:10,744 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:10,744 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:10,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:03:10,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:10,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:03:10,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:03:10,746 INFO L87 Difference]: Start difference. First operand 1230 states and 2764 transitions. Second operand 5 states. [2019-12-27 20:03:11,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:11,085 INFO L93 Difference]: Finished difference Result 1827 states and 4035 transitions. [2019-12-27 20:03:11,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:03:11,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:03:11,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:11,096 INFO L225 Difference]: With dead ends: 1827 [2019-12-27 20:03:11,096 INFO L226 Difference]: Without dead ends: 1827 [2019-12-27 20:03:11,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:03:11,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2019-12-27 20:03:11,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1570. [2019-12-27 20:03:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2019-12-27 20:03:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 3505 transitions. [2019-12-27 20:03:11,144 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 3505 transitions. Word has length 14 [2019-12-27 20:03:11,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:11,145 INFO L462 AbstractCegarLoop]: Abstraction has 1570 states and 3505 transitions. [2019-12-27 20:03:11,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:03:11,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 3505 transitions. [2019-12-27 20:03:11,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:03:11,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:11,148 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:03:11,148 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:03:11,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:11,148 INFO L82 PathProgramCache]: Analyzing trace with hash -2113363587, now seen corresponding path program 1 times [2019-12-27 20:03:11,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:11,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425032037] [2019-12-27 20:03:11,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:11,250 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:03:11,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425032037] [2019-12-27 20:03:11,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:11,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:03:11,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1919994212] [2019-12-27 20:03:11,254 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:11,260 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:11,267 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 20:03:11,267 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:11,268 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:11,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:03:11,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:11,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:03:11,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:03:11,269 INFO L87 Difference]: Start difference. First operand 1570 states and 3505 transitions. Second operand 6 states. [2019-12-27 20:03:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:11,808 INFO L93 Difference]: Finished difference Result 2335 states and 5008 transitions. [2019-12-27 20:03:11,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:03:11,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 20:03:11,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:11,820 INFO L225 Difference]: With dead ends: 2335 [2019-12-27 20:03:11,821 INFO L226 Difference]: Without dead ends: 2335 [2019-12-27 20:03:11,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:03:11,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2019-12-27 20:03:11,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 1703. [2019-12-27 20:03:11,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2019-12-27 20:03:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 3769 transitions. [2019-12-27 20:03:11,869 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 3769 transitions. Word has length 25 [2019-12-27 20:03:11,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:11,869 INFO L462 AbstractCegarLoop]: Abstraction has 1703 states and 3769 transitions. [2019-12-27 20:03:11,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:03:11,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 3769 transitions. [2019-12-27 20:03:11,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:03:11,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:11,872 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:03:11,872 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:03:11,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:11,873 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-12-27 20:03:11,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:11,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082460014] [2019-12-27 20:03:11,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:11,980 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:03:11,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082460014] [2019-12-27 20:03:11,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:11,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:03:11,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2085681097] [2019-12-27 20:03:11,982 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:11,987 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:11,996 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 20:03:11,996 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:11,998 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:11,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:03:11,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:11,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:03:11,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:11,999 INFO L87 Difference]: Start difference. First operand 1703 states and 3769 transitions. Second operand 3 states. [2019-12-27 20:03:12,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:12,012 INFO L93 Difference]: Finished difference Result 1702 states and 3767 transitions. [2019-12-27 20:03:12,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:12,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 20:03:12,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:12,022 INFO L225 Difference]: With dead ends: 1702 [2019-12-27 20:03:12,022 INFO L226 Difference]: Without dead ends: 1702 [2019-12-27 20:03:12,022 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:03:12,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2019-12-27 20:03:12,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1702. [2019-12-27 20:03:12,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2019-12-27 20:03:12,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 3767 transitions. [2019-12-27 20:03:12,063 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 3767 transitions. Word has length 26 [2019-12-27 20:03:12,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:12,064 INFO L462 AbstractCegarLoop]: Abstraction has 1702 states and 3767 transitions. [2019-12-27 20:03:12,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:03:12,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 3767 transitions. [2019-12-27 20:03:12,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:03:12,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:12,067 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:03:12,067 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:03:12,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:12,067 INFO L82 PathProgramCache]: Analyzing trace with hash -691470702, now seen corresponding path program 1 times [2019-12-27 20:03:12,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:12,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883454727] [2019-12-27 20:03:12,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:12,147 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:03:12,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883454727] [2019-12-27 20:03:12,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:12,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:03:12,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [540953281] [2019-12-27 20:03:12,149 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:12,156 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:12,163 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 33 transitions. [2019-12-27 20:03:12,164 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:12,169 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:03:12,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:03:12,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:12,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:03:12,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:03:12,170 INFO L87 Difference]: Start difference. First operand 1702 states and 3767 transitions. Second operand 4 states. [2019-12-27 20:03:12,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:12,200 INFO L93 Difference]: Finished difference Result 2698 states and 6019 transitions. [2019-12-27 20:03:12,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:03:12,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-27 20:03:12,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:12,217 INFO L225 Difference]: With dead ends: 2698 [2019-12-27 20:03:12,218 INFO L226 Difference]: Without dead ends: 1248 [2019-12-27 20:03:12,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:03:12,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2019-12-27 20:03:12,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1231. [2019-12-27 20:03:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2019-12-27 20:03:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 2688 transitions. [2019-12-27 20:03:12,252 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 2688 transitions. Word has length 27 [2019-12-27 20:03:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:12,253 INFO L462 AbstractCegarLoop]: Abstraction has 1231 states and 2688 transitions. [2019-12-27 20:03:12,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:03:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 2688 transitions. [2019-12-27 20:03:12,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:03:12,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:12,255 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:03:12,255 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:03:12,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:12,256 INFO L82 PathProgramCache]: Analyzing trace with hash -250638352, now seen corresponding path program 2 times [2019-12-27 20:03:12,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:12,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038296061] [2019-12-27 20:03:12,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:12,350 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:03:12,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038296061] [2019-12-27 20:03:12,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:12,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:03:12,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1131962270] [2019-12-27 20:03:12,352 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:12,357 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:12,369 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 20:03:12,369 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:12,503 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:03:12,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:03:12,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:12,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:03:12,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:03:12,504 INFO L87 Difference]: Start difference. First operand 1231 states and 2688 transitions. Second operand 8 states. [2019-12-27 20:03:13,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:13,369 INFO L93 Difference]: Finished difference Result 1897 states and 4072 transitions. [2019-12-27 20:03:13,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:03:13,370 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 20:03:13,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:13,378 INFO L225 Difference]: With dead ends: 1897 [2019-12-27 20:03:13,378 INFO L226 Difference]: Without dead ends: 1897 [2019-12-27 20:03:13,378 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:03:13,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2019-12-27 20:03:13,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1702. [2019-12-27 20:03:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2019-12-27 20:03:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 3698 transitions. [2019-12-27 20:03:13,418 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 3698 transitions. Word has length 27 [2019-12-27 20:03:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:13,419 INFO L462 AbstractCegarLoop]: Abstraction has 1702 states and 3698 transitions. [2019-12-27 20:03:13,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:03:13,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 3698 transitions. [2019-12-27 20:03:13,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:03:13,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:13,422 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:03:13,422 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:03:13,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:13,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1889347286, now seen corresponding path program 1 times [2019-12-27 20:03:13,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:13,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974696164] [2019-12-27 20:03:13,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:13,460 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:03:13,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974696164] [2019-12-27 20:03:13,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:13,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:03:13,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2102127204] [2019-12-27 20:03:13,461 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:13,465 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:13,477 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 20:03:13,477 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:13,497 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:03:13,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:03:13,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:13,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:03:13,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:03:13,498 INFO L87 Difference]: Start difference. First operand 1702 states and 3698 transitions. Second operand 5 states. [2019-12-27 20:03:13,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:13,517 INFO L93 Difference]: Finished difference Result 921 states and 1892 transitions. [2019-12-27 20:03:13,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:03:13,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 20:03:13,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:13,521 INFO L225 Difference]: With dead ends: 921 [2019-12-27 20:03:13,521 INFO L226 Difference]: Without dead ends: 824 [2019-12-27 20:03:13,522 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:03:13,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-12-27 20:03:13,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 782. [2019-12-27 20:03:13,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-27 20:03:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1664 transitions. [2019-12-27 20:03:13,539 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1664 transitions. Word has length 28 [2019-12-27 20:03:13,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:13,539 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1664 transitions. [2019-12-27 20:03:13,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:03:13,539 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1664 transitions. [2019-12-27 20:03:13,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:03:13,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:13,542 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:03:13,542 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:03:13,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:13,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1472734739, now seen corresponding path program 1 times [2019-12-27 20:03:13,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:13,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856473304] [2019-12-27 20:03:13,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:13,630 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:03:13,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856473304] [2019-12-27 20:03:13,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:13,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:03:13,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [725900999] [2019-12-27 20:03:13,632 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:13,647 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:13,710 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 167 transitions. [2019-12-27 20:03:13,710 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:13,775 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:03:13,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:03:13,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:13,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:03:13,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:03:13,776 INFO L87 Difference]: Start difference. First operand 782 states and 1664 transitions. Second operand 9 states. [2019-12-27 20:03:14,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:14,116 INFO L93 Difference]: Finished difference Result 1342 states and 2781 transitions. [2019-12-27 20:03:14,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:03:14,117 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-27 20:03:14,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:14,120 INFO L225 Difference]: With dead ends: 1342 [2019-12-27 20:03:14,121 INFO L226 Difference]: Without dead ends: 903 [2019-12-27 20:03:14,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:03:14,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-27 20:03:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 773. [2019-12-27 20:03:14,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-27 20:03:14,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1630 transitions. [2019-12-27 20:03:14,139 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1630 transitions. Word has length 51 [2019-12-27 20:03:14,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:14,139 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1630 transitions. [2019-12-27 20:03:14,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:03:14,139 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1630 transitions. [2019-12-27 20:03:14,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:03:14,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:14,141 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:03:14,142 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:03:14,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:14,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1162443569, now seen corresponding path program 2 times [2019-12-27 20:03:14,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:14,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448539142] [2019-12-27 20:03:14,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:14,311 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:03:14,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448539142] [2019-12-27 20:03:14,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:14,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:03:14,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1865857625] [2019-12-27 20:03:14,313 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:14,327 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:14,395 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 166 transitions. [2019-12-27 20:03:14,396 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:14,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:03:14,561 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 20:03:14,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:03:14,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:14,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:03:14,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:03:14,562 INFO L87 Difference]: Start difference. First operand 773 states and 1630 transitions. Second operand 10 states. [2019-12-27 20:03:15,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:15,576 INFO L93 Difference]: Finished difference Result 1157 states and 2371 transitions. [2019-12-27 20:03:15,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 20:03:15,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-12-27 20:03:15,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:15,581 INFO L225 Difference]: With dead ends: 1157 [2019-12-27 20:03:15,582 INFO L226 Difference]: Without dead ends: 1157 [2019-12-27 20:03:15,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:03:15,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2019-12-27 20:03:15,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 845. [2019-12-27 20:03:15,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2019-12-27 20:03:15,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1761 transitions. [2019-12-27 20:03:15,604 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1761 transitions. Word has length 51 [2019-12-27 20:03:15,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:15,604 INFO L462 AbstractCegarLoop]: Abstraction has 845 states and 1761 transitions. [2019-12-27 20:03:15,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:03:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1761 transitions. [2019-12-27 20:03:15,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:03:15,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:15,607 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:03:15,607 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:03:15,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:15,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1548839163, now seen corresponding path program 3 times [2019-12-27 20:03:15,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:15,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034126889] [2019-12-27 20:03:15,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:15,682 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:03:15,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034126889] [2019-12-27 20:03:15,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:15,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:03:15,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1074729700] [2019-12-27 20:03:15,683 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:15,698 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:15,751 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 129 transitions. [2019-12-27 20:03:15,751 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:15,753 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:03:15,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:03:15,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:15,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:03:15,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:15,754 INFO L87 Difference]: Start difference. First operand 845 states and 1761 transitions. Second operand 3 states. [2019-12-27 20:03:15,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:15,798 INFO L93 Difference]: Finished difference Result 1118 states and 2337 transitions. [2019-12-27 20:03:15,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:15,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 20:03:15,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:15,802 INFO L225 Difference]: With dead ends: 1118 [2019-12-27 20:03:15,802 INFO L226 Difference]: Without dead ends: 1118 [2019-12-27 20:03:15,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:15,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2019-12-27 20:03:15,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 902. [2019-12-27 20:03:15,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2019-12-27 20:03:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1897 transitions. [2019-12-27 20:03:15,822 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1897 transitions. Word has length 51 [2019-12-27 20:03:15,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:15,823 INFO L462 AbstractCegarLoop]: Abstraction has 902 states and 1897 transitions. [2019-12-27 20:03:15,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:03:15,824 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1897 transitions. [2019-12-27 20:03:15,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:03:15,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:15,826 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:03:15,827 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:03:15,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:15,827 INFO L82 PathProgramCache]: Analyzing trace with hash -2127061277, now seen corresponding path program 1 times [2019-12-27 20:03:15,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:15,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228460560] [2019-12-27 20:03:15,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:16,014 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:03:16,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228460560] [2019-12-27 20:03:16,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:16,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:03:16,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2128138119] [2019-12-27 20:03:16,015 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:16,028 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:16,455 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 113 states and 169 transitions. [2019-12-27 20:03:16,455 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:16,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:03:16,615 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 20:03:16,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:03:16,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:16,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:03:16,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:03:16,617 INFO L87 Difference]: Start difference. First operand 902 states and 1897 transitions. Second operand 11 states. [2019-12-27 20:03:17,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:17,678 INFO L93 Difference]: Finished difference Result 1246 states and 2538 transitions. [2019-12-27 20:03:17,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 20:03:17,679 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-12-27 20:03:17,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:17,683 INFO L225 Difference]: With dead ends: 1246 [2019-12-27 20:03:17,684 INFO L226 Difference]: Without dead ends: 1246 [2019-12-27 20:03:17,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:03:17,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2019-12-27 20:03:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 962. [2019-12-27 20:03:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-12-27 20:03:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 2019 transitions. [2019-12-27 20:03:17,712 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 2019 transitions. Word has length 52 [2019-12-27 20:03:17,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:17,712 INFO L462 AbstractCegarLoop]: Abstraction has 962 states and 2019 transitions. [2019-12-27 20:03:17,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:03:17,713 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 2019 transitions. [2019-12-27 20:03:17,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:03:17,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:17,717 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:03:17,717 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:03:17,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:17,717 INFO L82 PathProgramCache]: Analyzing trace with hash 313439079, now seen corresponding path program 1 times [2019-12-27 20:03:17,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:17,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643368707] [2019-12-27 20:03:17,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:17,783 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:03:17,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643368707] [2019-12-27 20:03:17,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:17,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:03:17,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [990920327] [2019-12-27 20:03:17,784 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:17,799 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:17,866 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 133 transitions. [2019-12-27 20:03:17,866 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:17,871 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:03:17,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:03:17,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:17,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:03:17,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:17,872 INFO L87 Difference]: Start difference. First operand 962 states and 2019 transitions. Second operand 3 states. [2019-12-27 20:03:17,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:17,918 INFO L93 Difference]: Finished difference Result 1371 states and 2765 transitions. [2019-12-27 20:03:17,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:17,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 20:03:17,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:17,921 INFO L225 Difference]: With dead ends: 1371 [2019-12-27 20:03:17,921 INFO L226 Difference]: Without dead ends: 1371 [2019-12-27 20:03:17,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:03:17,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2019-12-27 20:03:17,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1036. [2019-12-27 20:03:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-12-27 20:03:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 2149 transitions. [2019-12-27 20:03:17,946 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 2149 transitions. Word has length 52 [2019-12-27 20:03:17,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:17,946 INFO L462 AbstractCegarLoop]: Abstraction has 1036 states and 2149 transitions. [2019-12-27 20:03:17,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:03:17,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 2149 transitions. [2019-12-27 20:03:17,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:03:17,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:17,949 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:03:17,949 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:03:17,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:17,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1220422803, now seen corresponding path program 2 times [2019-12-27 20:03:17,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:17,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607911057] [2019-12-27 20:03:17,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:18,019 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:03:18,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607911057] [2019-12-27 20:03:18,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:18,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:03:18,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [463702516] [2019-12-27 20:03:18,021 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:18,074 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:18,152 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 133 transitions. [2019-12-27 20:03:18,152 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:18,153 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:18,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:03:18,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:18,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:03:18,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:18,154 INFO L87 Difference]: Start difference. First operand 1036 states and 2149 transitions. Second operand 3 states. [2019-12-27 20:03:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:18,167 INFO L93 Difference]: Finished difference Result 1035 states and 2147 transitions. [2019-12-27 20:03:18,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:18,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 20:03:18,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:18,171 INFO L225 Difference]: With dead ends: 1035 [2019-12-27 20:03:18,171 INFO L226 Difference]: Without dead ends: 1035 [2019-12-27 20:03:18,171 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:03:18,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-12-27 20:03:18,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 823. [2019-12-27 20:03:18,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-27 20:03:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1747 transitions. [2019-12-27 20:03:18,189 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1747 transitions. Word has length 52 [2019-12-27 20:03:18,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:18,190 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1747 transitions. [2019-12-27 20:03:18,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:03:18,190 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1747 transitions. [2019-12-27 20:03:18,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:03:18,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:18,192 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:03:18,192 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:03:18,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:18,193 INFO L82 PathProgramCache]: Analyzing trace with hash -445188541, now seen corresponding path program 1 times [2019-12-27 20:03:18,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:18,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241461047] [2019-12-27 20:03:18,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:03:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:03:18,306 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:03:18,307 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:03:18,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~x~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t315~0.base_22|) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_15 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$mem_tmp~0_7) (= 0 v_~y$r_buff1_thd2~0_56) (= 0 v_~__unbuffered_cnt~0_17) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t315~0.base_22|)) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~weak$$choice2~0_34) (= v_~y~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~y$r_buff1_thd0~0_24) (= 0 v_~y$flush_delayed~0_13) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd1~0_18) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t315~0.base_22| 4) |v_#length_17|) (= v_~y$r_buff0_thd0~0_21 0) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t315~0.base_22| 1)) (= v_~y$w_buff0_used~0_105 0) (= v_~y$r_buff0_thd2~0_81 0) (= 0 v_~y$w_buff0~0_25) (= 0 v_~__unbuffered_p0_EAX~0_16) (= v_~y$w_buff1_used~0_64 0) (= 0 v_~weak$$choice0~0_6) (= 0 |v_ULTIMATE.start_main_~#t315~0.offset_17|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t315~0.base_22| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t315~0.base_22|) |v_ULTIMATE.start_main_~#t315~0.offset_17| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t315~0.offset=|v_ULTIMATE.start_main_~#t315~0.offset_17|, ULTIMATE.start_main_~#t316~0.base=|v_ULTIMATE.start_main_~#t316~0.base_24|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_17|, ~y~0=v_~y~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ULTIMATE.start_main_~#t315~0.base=|v_ULTIMATE.start_main_~#t315~0.base_22|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_~#t316~0.offset=|v_ULTIMATE.start_main_~#t316~0.offset_18|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, #valid=|v_#valid_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_81, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_11, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_64} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t315~0.offset, ULTIMATE.start_main_~#t316~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t315~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t316~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:03:18,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t316~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t316~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t316~0.base_10|)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t316~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t316~0.base_10|) |v_ULTIMATE.start_main_~#t316~0.offset_9| 1)) |v_#memory_int_5|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t316~0.base_10| 4)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t316~0.base_10|) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t316~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t316~0.base=|v_ULTIMATE.start_main_~#t316~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t316~0.offset=|v_ULTIMATE.start_main_~#t316~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t316~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t316~0.offset] because there is no mapped edge [2019-12-27 20:03:18,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~y$r_buff1_thd0~0_Out1061683382 ~y$r_buff0_thd0~0_In1061683382) (= ~y$r_buff1_thd2~0_Out1061683382 ~y$r_buff0_thd2~0_In1061683382) (= ~y$r_buff0_thd1~0_In1061683382 ~y$r_buff1_thd1~0_Out1061683382) (= ~y$r_buff0_thd1~0_Out1061683382 1) (= ~x~0_In1061683382 ~__unbuffered_p0_EAX~0_Out1061683382) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1061683382 0))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1061683382, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1061683382, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1061683382, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1061683382, ~x~0=~x~0_In1061683382} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1061683382, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1061683382, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1061683382, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1061683382, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1061683382, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1061683382, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1061683382, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1061683382, ~x~0=~x~0_In1061683382} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 20:03:18,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-527211846 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-527211846 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-527211846|)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-527211846| ~y$w_buff0_used~0_In-527211846) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-527211846, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-527211846} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-527211846|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-527211846, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-527211846} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 20:03:18,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In452000607 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In452000607 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In452000607 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In452000607 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out452000607| ~y$w_buff1_used~0_In452000607)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out452000607| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In452000607, ~y$w_buff0_used~0=~y$w_buff0_used~0_In452000607, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In452000607, ~y$w_buff1_used~0=~y$w_buff1_used~0_In452000607} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out452000607|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In452000607, ~y$w_buff0_used~0=~y$w_buff0_used~0_In452000607, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In452000607, ~y$w_buff1_used~0=~y$w_buff1_used~0_In452000607} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 20:03:18,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-893287326 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-893287326 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-893287326 ~y$r_buff0_thd1~0_Out-893287326)) (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out-893287326) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-893287326, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-893287326} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-893287326, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-893287326|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-893287326} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:03:18,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In171717442 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In171717442 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In171717442 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In171717442 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out171717442| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out171717442| ~y$r_buff1_thd1~0_In171717442)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In171717442, ~y$w_buff0_used~0=~y$w_buff0_used~0_In171717442, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In171717442, ~y$w_buff1_used~0=~y$w_buff1_used~0_In171717442} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In171717442, ~y$w_buff0_used~0=~y$w_buff0_used~0_In171717442, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out171717442|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In171717442, ~y$w_buff1_used~0=~y$w_buff1_used~0_In171717442} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:03:18,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$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{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:03:18,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1024420990 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out1024420990| ~y$w_buff1~0_In1024420990) (= |P1Thread1of1ForFork1_#t~ite17_In1024420990| |P1Thread1of1ForFork1_#t~ite17_Out1024420990|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1024420990 256)))) (or (= (mod ~y$w_buff0_used~0_In1024420990 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In1024420990 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1024420990 256))))) .cse0 (= |P1Thread1of1ForFork1_#t~ite17_Out1024420990| |P1Thread1of1ForFork1_#t~ite18_Out1024420990|) (= |P1Thread1of1ForFork1_#t~ite17_Out1024420990| ~y$w_buff1~0_In1024420990)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1024420990, ~y$w_buff1~0=~y$w_buff1~0_In1024420990, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1024420990, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1024420990, ~weak$$choice2~0=~weak$$choice2~0_In1024420990, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1024420990|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1024420990} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1024420990, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1024420990|, ~y$w_buff1~0=~y$w_buff1~0_In1024420990, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1024420990, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1024420990, ~weak$$choice2~0=~weak$$choice2~0_In1024420990, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1024420990|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1024420990} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 20:03:18,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1039326269 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite21_Out-1039326269| |P1Thread1of1ForFork1_#t~ite20_Out-1039326269|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1039326269 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In-1039326269 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1039326269 256))) (= 0 (mod ~y$w_buff0_used~0_In-1039326269 256)))) (= |P1Thread1of1ForFork1_#t~ite20_Out-1039326269| ~y$w_buff0_used~0_In-1039326269)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out-1039326269| ~y$w_buff0_used~0_In-1039326269) (= |P1Thread1of1ForFork1_#t~ite20_In-1039326269| |P1Thread1of1ForFork1_#t~ite20_Out-1039326269|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1039326269, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1039326269, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1039326269|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1039326269, ~weak$$choice2~0=~weak$$choice2~0_In-1039326269, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1039326269} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1039326269, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1039326269, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1039326269|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1039326269, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1039326269|, ~weak$$choice2~0=~weak$$choice2~0_In-1039326269, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1039326269} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 20:03:18,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse5 (= |P1Thread1of1ForFork1_#t~ite24_Out320863212| |P1Thread1of1ForFork1_#t~ite23_Out320863212|)) (.cse4 (= 0 (mod ~y$w_buff0_used~0_In320863212 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In320863212 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In320863212 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd2~0_In320863212 256) 0)) (.cse2 (= 0 (mod ~weak$$choice2~0_In320863212 256)))) (or (let ((.cse1 (not .cse6))) (and (= |P1Thread1of1ForFork1_#t~ite22_Out320863212| 0) (or (not .cse0) .cse1) .cse2 (or (not .cse3) .cse1) (not .cse4) .cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out320863212| |P1Thread1of1ForFork1_#t~ite22_Out320863212|))) (and (= |P1Thread1of1ForFork1_#t~ite22_In320863212| |P1Thread1of1ForFork1_#t~ite22_Out320863212|) (or (and .cse2 (= |P1Thread1of1ForFork1_#t~ite23_Out320863212| ~y$w_buff1_used~0_In320863212) .cse5 (or .cse4 (and .cse6 .cse0) (and .cse3 .cse6))) (and (= |P1Thread1of1ForFork1_#t~ite23_Out320863212| |P1Thread1of1ForFork1_#t~ite23_In320863212|) (= |P1Thread1of1ForFork1_#t~ite24_Out320863212| ~y$w_buff1_used~0_In320863212) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In320863212, ~y$w_buff0_used~0=~y$w_buff0_used~0_In320863212, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In320863212, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In320863212|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In320863212|, ~weak$$choice2~0=~weak$$choice2~0_In320863212, ~y$w_buff1_used~0=~y$w_buff1_used~0_In320863212} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In320863212, ~y$w_buff0_used~0=~y$w_buff0_used~0_In320863212, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In320863212, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out320863212|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out320863212|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out320863212|, ~weak$$choice2~0=~weak$$choice2~0_In320863212, ~y$w_buff1_used~0=~y$w_buff1_used~0_In320863212} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 20:03:18,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L769-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~y$r_buff0_thd2~0_49 v_~y$r_buff0_thd2~0_50)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 20:03:18,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In448777829 256) 0))) (or (let ((.cse0 (not (= 0 (mod ~y$r_buff0_thd2~0_In448777829 256))))) (and (not (= 0 (mod ~y$w_buff0_used~0_In448777829 256))) (or .cse0 (not (= 0 (mod ~y$r_buff1_thd2~0_In448777829 256)))) (= |P1Thread1of1ForFork1_#t~ite29_Out448777829| |P1Thread1of1ForFork1_#t~ite28_Out448777829|) .cse1 (= 0 |P1Thread1of1ForFork1_#t~ite28_Out448777829|) (or .cse0 (not (= 0 (mod ~y$w_buff1_used~0_In448777829 256)))) (= |P1Thread1of1ForFork1_#t~ite30_Out448777829| |P1Thread1of1ForFork1_#t~ite29_Out448777829|))) (and (= |P1Thread1of1ForFork1_#t~ite28_In448777829| |P1Thread1of1ForFork1_#t~ite28_Out448777829|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In448777829| |P1Thread1of1ForFork1_#t~ite29_Out448777829|) (= |P1Thread1of1ForFork1_#t~ite30_Out448777829| ~y$r_buff1_thd2~0_In448777829)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In448777829, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In448777829|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In448777829, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In448777829, ~weak$$choice2~0=~weak$$choice2~0_In448777829, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In448777829|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In448777829} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In448777829, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out448777829|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out448777829|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In448777829, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In448777829, ~weak$$choice2~0=~weak$$choice2~0_In448777829, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out448777829|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In448777829} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 20:03:18,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_18 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 20:03:18,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite33_Out-1608271480| |P1Thread1of1ForFork1_#t~ite32_Out-1608271480|)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1608271480 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1608271480 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-1608271480| ~y$w_buff1~0_In-1608271480) .cse1 (not .cse2)) (and .cse1 (or .cse2 .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-1608271480| ~y~0_In-1608271480)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1608271480, ~y$w_buff1~0=~y$w_buff1~0_In-1608271480, ~y~0=~y~0_In-1608271480, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1608271480} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1608271480, ~y$w_buff1~0=~y$w_buff1~0_In-1608271480, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1608271480|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-1608271480|, ~y~0=~y~0_In-1608271480, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1608271480} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 20:03:18,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1036254142 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1036254142 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1036254142|)) (and (= ~y$w_buff0_used~0_In-1036254142 |P1Thread1of1ForFork1_#t~ite34_Out-1036254142|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1036254142, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1036254142} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1036254142, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1036254142, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1036254142|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 20:03:18,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In450088690 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In450088690 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In450088690 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In450088690 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out450088690| ~y$w_buff1_used~0_In450088690) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out450088690| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In450088690, ~y$w_buff0_used~0=~y$w_buff0_used~0_In450088690, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In450088690, ~y$w_buff1_used~0=~y$w_buff1_used~0_In450088690} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In450088690, ~y$w_buff0_used~0=~y$w_buff0_used~0_In450088690, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In450088690, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out450088690|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In450088690} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 20:03:18,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2040877199 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2040877199 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-2040877199| ~y$r_buff0_thd2~0_In-2040877199)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-2040877199|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2040877199, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2040877199} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2040877199, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2040877199, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-2040877199|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 20:03:18,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1807323310 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1807323310 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1807323310 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1807323310 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1807323310|)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite37_Out1807323310| ~y$r_buff1_thd2~0_In1807323310) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1807323310, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1807323310, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1807323310, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1807323310} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1807323310, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1807323310, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1807323310, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1807323310|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1807323310} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:03:18,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_50 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_50, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__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[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:03:18,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: 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:03:18,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1936492867 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1936492867 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1936492867| ~y~0_In-1936492867)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1936492867| ~y$w_buff1~0_In-1936492867) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1936492867, ~y~0=~y~0_In-1936492867, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1936492867, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1936492867} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1936492867|, ~y$w_buff1~0=~y$w_buff1~0_In-1936492867, ~y~0=~y~0_In-1936492867, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1936492867, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1936492867} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 20:03:18,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_17 |v_ULTIMATE.start_main_#t~ite40_8|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y~0=v_~y~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 20:03:18,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1546737895 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1546737895 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-1546737895|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1546737895 |ULTIMATE.start_main_#t~ite42_Out-1546737895|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1546737895, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1546737895} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1546737895, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1546737895, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1546737895|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:03:18,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-991965212 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-991965212 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-991965212 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-991965212 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-991965212| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite43_Out-991965212| ~y$w_buff1_used~0_In-991965212) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-991965212, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-991965212, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-991965212, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-991965212} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-991965212, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-991965212, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-991965212|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-991965212, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-991965212} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 20:03:18,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In520035437 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In520035437 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In520035437 |ULTIMATE.start_main_#t~ite44_Out520035437|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out520035437|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In520035437, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In520035437} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In520035437, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In520035437, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out520035437|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:03:18,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1003160701 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1003160701 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1003160701 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1003160701 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1003160701| ~y$r_buff1_thd0~0_In1003160701) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite45_Out1003160701|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1003160701, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1003160701, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1003160701, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1003160701} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1003160701, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1003160701, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1003160701, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1003160701|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1003160701} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:03:18,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_10 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 0 v_~__unbuffered_p0_EAX~0_10) (= |v_ULTIMATE.start_main_#t~ite45_12| v_~y$r_buff1_thd0~0_18) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__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_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_18, 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_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:03:18,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:03:18 BasicIcfg [2019-12-27 20:03:18,390 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:03:18,392 INFO L168 Benchmark]: Toolchain (without parser) took 15284.40 ms. Allocated memory was 145.8 MB in the beginning and 665.8 MB in the end (delta: 520.1 MB). Free memory was 100.6 MB in the beginning and 427.9 MB in the end (delta: -327.3 MB). Peak memory consumption was 192.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:18,393 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 20:03:18,394 INFO L168 Benchmark]: CACSL2BoogieTranslator took 791.16 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.2 MB in the beginning and 158.6 MB in the end (delta: -58.4 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:18,394 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.68 ms. Allocated memory is still 203.9 MB. Free memory was 158.6 MB in the beginning and 156.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:18,395 INFO L168 Benchmark]: Boogie Preprocessor took 39.55 ms. Allocated memory is still 203.9 MB. Free memory was 156.0 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:18,396 INFO L168 Benchmark]: RCFGBuilder took 837.37 ms. Allocated memory is still 203.9 MB. Free memory was 153.4 MB in the beginning and 108.8 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:18,396 INFO L168 Benchmark]: TraceAbstraction took 13543.49 ms. Allocated memory was 203.9 MB in the beginning and 665.8 MB in the end (delta: 461.9 MB). Free memory was 108.8 MB in the beginning and 427.9 MB in the end (delta: -319.1 MB). Peak memory consumption was 142.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:18,401 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.23 ms. Allocated memory is still 145.8 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 791.16 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.2 MB in the beginning and 158.6 MB in the end (delta: -58.4 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.68 ms. Allocated memory is still 203.9 MB. Free memory was 158.6 MB in the beginning and 156.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.55 ms. Allocated memory is still 203.9 MB. Free memory was 156.0 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 837.37 ms. Allocated memory is still 203.9 MB. Free memory was 153.4 MB in the beginning and 108.8 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13543.49 ms. Allocated memory was 203.9 MB in the beginning and 665.8 MB in the end (delta: 461.9 MB). Free memory was 108.8 MB in the beginning and 427.9 MB in the end (delta: -319.1 MB). Peak memory consumption was 142.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 148 ProgramPointsBefore, 74 ProgramPointsAfterwards, 182 TransitionsBefore, 82 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 29 ChoiceCompositions, 4737 VarBasedMoverChecksPositive, 159 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49139 CheckedPairsTotal, 103 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t315, ((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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t316, ((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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __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 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.2s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1710 SDtfs, 1726 SDslu, 4215 SDs, 0 SdLazy, 2935 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 52 SyntacticMatches, 22 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8357occurred 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: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 2632 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 523 NumberOfCodeBlocks, 523 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 58720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...