/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:18:08,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:18:08,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:18:08,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:18:08,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:18:08,903 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:18:08,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:18:08,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:18:08,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:18:08,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:18:08,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:18:08,925 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:18:08,925 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:18:08,927 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:18:08,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:18:08,930 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:18:08,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:18:08,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:18:08,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:18:08,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:18:08,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:18:08,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:18:08,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:18:08,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:18:08,952 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:18:08,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:18:08,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:18:08,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:18:08,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:18:08,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:18:08,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:18:08,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:18:08,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:18:08,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:18:08,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:18:08,960 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:18:08,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:18:08,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:18:08,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:18:08,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:18:08,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:18:08,963 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:18:08,977 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:18:08,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:18:08,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:18:08,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:18:08,979 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:18:08,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:18:08,979 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:18:08,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:18:08,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:18:08,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:18:08,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:18:08,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:18:08,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:18:08,981 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:18:08,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:18:08,981 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:18:08,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:18:08,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:18:08,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:18:08,982 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:18:08,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:18:08,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:18:08,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:18:08,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:18:08,983 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:18:08,983 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:18:08,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:18:08,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:18:08,984 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:18:08,984 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:18:09,255 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:18:09,265 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:18:09,271 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:18:09,272 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:18:09,278 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:18:09,279 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_power.oepc.i [2019-12-18 13:18:09,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f3d2bc9/c474a27636144c5bbb8c015af464551e/FLAG22b9269be [2019-12-18 13:18:09,901 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:18:09,901 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.oepc.i [2019-12-18 13:18:09,917 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f3d2bc9/c474a27636144c5bbb8c015af464551e/FLAG22b9269be [2019-12-18 13:18:10,190 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f3d2bc9/c474a27636144c5bbb8c015af464551e [2019-12-18 13:18:10,200 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:18:10,202 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:18:10,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:18:10,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:18:10,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:18:10,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:18:10" (1/1) ... [2019-12-18 13:18:10,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@115225be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:10, skipping insertion in model container [2019-12-18 13:18:10,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:18:10" (1/1) ... [2019-12-18 13:18:10,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:18:10,281 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:18:10,830 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:18:10,844 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:18:10,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:18:11,027 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:18:11,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:11 WrapperNode [2019-12-18 13:18:11,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:18:11,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:18:11,029 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:18:11,029 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:18:11,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:11" (1/1) ... [2019-12-18 13:18:11,062 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:11" (1/1) ... [2019-12-18 13:18:11,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:18:11,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:18:11,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:18:11,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:18:11,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:11" (1/1) ... [2019-12-18 13:18:11,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:11" (1/1) ... [2019-12-18 13:18:11,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:11" (1/1) ... [2019-12-18 13:18:11,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:11" (1/1) ... [2019-12-18 13:18:11,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:11" (1/1) ... [2019-12-18 13:18:11,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:11" (1/1) ... [2019-12-18 13:18:11,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:11" (1/1) ... [2019-12-18 13:18:11,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:18:11,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:18:11,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:18:11,132 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:18:11,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:18:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:18:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:18:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:18:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:18:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:18:11,217 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:18:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:18:11,218 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:18:11,218 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:18:11,218 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:18:11,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:18:11,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:18:11,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:18:11,220 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:18:12,001 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:18:12,001 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:18:12,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:18:12 BoogieIcfgContainer [2019-12-18 13:18:12,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:18:12,005 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:18:12,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:18:12,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:18:12,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:18:10" (1/3) ... [2019-12-18 13:18:12,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5160b6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:18:12, skipping insertion in model container [2019-12-18 13:18:12,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:11" (2/3) ... [2019-12-18 13:18:12,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5160b6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:18:12, skipping insertion in model container [2019-12-18 13:18:12,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:18:12" (3/3) ... [2019-12-18 13:18:12,014 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_power.oepc.i [2019-12-18 13:18:12,023 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:18:12,024 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:18:12,031 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:18:12,032 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:18:12,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,075 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,075 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,076 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,110 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,111 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,128 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,128 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,177 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,179 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,193 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,193 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,194 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,196 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,197 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:12,222 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:18:12,245 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:18:12,245 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:18:12,245 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:18:12,245 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:18:12,246 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:18:12,246 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:18:12,246 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:18:12,246 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:18:12,266 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-18 13:18:12,268 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 13:18:12,356 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 13:18:12,356 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:18:12,378 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:18:12,407 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 13:18:12,460 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 13:18:12,460 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:18:12,470 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:18:12,492 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:18:12,493 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:18:18,202 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 13:18:18,349 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 13:18:18,509 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83880 [2019-12-18 13:18:18,509 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 13:18:18,513 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-18 13:18:37,337 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118052 states. [2019-12-18 13:18:37,339 INFO L276 IsEmpty]: Start isEmpty. Operand 118052 states. [2019-12-18 13:18:37,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:18:37,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:18:37,346 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:18:37,346 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:18:37,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:18:37,351 INFO L82 PathProgramCache]: Analyzing trace with hash 918883, now seen corresponding path program 1 times [2019-12-18 13:18:37,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:18:37,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545496204] [2019-12-18 13:18:37,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:18:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:18:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:18:37,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545496204] [2019-12-18 13:18:37,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:18:37,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:18:37,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114167519] [2019-12-18 13:18:37,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:18:37,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:18:37,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:18:37,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:18:37,648 INFO L87 Difference]: Start difference. First operand 118052 states. Second operand 3 states. [2019-12-18 13:18:41,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:18:41,084 INFO L93 Difference]: Finished difference Result 117122 states and 502402 transitions. [2019-12-18 13:18:41,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:18:41,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:18:41,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:18:41,790 INFO L225 Difference]: With dead ends: 117122 [2019-12-18 13:18:41,790 INFO L226 Difference]: Without dead ends: 109842 [2019-12-18 13:18:41,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:18:46,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109842 states. [2019-12-18 13:18:49,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109842 to 109842. [2019-12-18 13:18:49,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109842 states. [2019-12-18 13:18:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109842 states to 109842 states and 470538 transitions. [2019-12-18 13:18:54,815 INFO L78 Accepts]: Start accepts. Automaton has 109842 states and 470538 transitions. Word has length 3 [2019-12-18 13:18:54,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:18:54,816 INFO L462 AbstractCegarLoop]: Abstraction has 109842 states and 470538 transitions. [2019-12-18 13:18:54,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:18:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand 109842 states and 470538 transitions. [2019-12-18 13:18:54,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:18:54,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:18:54,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:18:54,821 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:18:54,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:18:54,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1326055600, now seen corresponding path program 1 times [2019-12-18 13:18:54,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:18:54,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483495135] [2019-12-18 13:18:54,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:18:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:18:55,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:18:55,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483495135] [2019-12-18 13:18:55,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:18:55,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:18:55,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242429910] [2019-12-18 13:18:55,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:18:55,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:18:55,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:18:55,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:18:55,006 INFO L87 Difference]: Start difference. First operand 109842 states and 470538 transitions. Second operand 4 states. [2019-12-18 13:18:56,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:18:56,382 INFO L93 Difference]: Finished difference Result 170700 states and 702967 transitions. [2019-12-18 13:18:56,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:18:56,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:18:56,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:02,234 INFO L225 Difference]: With dead ends: 170700 [2019-12-18 13:19:02,235 INFO L226 Difference]: Without dead ends: 170651 [2019-12-18 13:19:02,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:07,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170651 states. [2019-12-18 13:19:10,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170651 to 155174. [2019-12-18 13:19:10,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155174 states. [2019-12-18 13:19:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155174 states to 155174 states and 647977 transitions. [2019-12-18 13:19:12,470 INFO L78 Accepts]: Start accepts. Automaton has 155174 states and 647977 transitions. Word has length 11 [2019-12-18 13:19:12,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:12,471 INFO L462 AbstractCegarLoop]: Abstraction has 155174 states and 647977 transitions. [2019-12-18 13:19:12,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:19:12,471 INFO L276 IsEmpty]: Start isEmpty. Operand 155174 states and 647977 transitions. [2019-12-18 13:19:12,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:19:12,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:12,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:12,479 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:12,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:12,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1447855061, now seen corresponding path program 1 times [2019-12-18 13:19:12,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:12,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228971740] [2019-12-18 13:19:12,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:12,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:12,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228971740] [2019-12-18 13:19:12,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:12,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:19:12,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535853417] [2019-12-18 13:19:12,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:19:12,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:12,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:19:12,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:12,544 INFO L87 Difference]: Start difference. First operand 155174 states and 647977 transitions. Second operand 3 states. [2019-12-18 13:19:12,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:12,705 INFO L93 Difference]: Finished difference Result 33806 states and 110729 transitions. [2019-12-18 13:19:12,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:19:12,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:19:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:12,773 INFO L225 Difference]: With dead ends: 33806 [2019-12-18 13:19:12,774 INFO L226 Difference]: Without dead ends: 33806 [2019-12-18 13:19:12,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:13,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33806 states. [2019-12-18 13:19:13,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33806 to 33806. [2019-12-18 13:19:13,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33806 states. [2019-12-18 13:19:13,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33806 states to 33806 states and 110729 transitions. [2019-12-18 13:19:13,487 INFO L78 Accepts]: Start accepts. Automaton has 33806 states and 110729 transitions. Word has length 13 [2019-12-18 13:19:13,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:13,487 INFO L462 AbstractCegarLoop]: Abstraction has 33806 states and 110729 transitions. [2019-12-18 13:19:13,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:19:13,488 INFO L276 IsEmpty]: Start isEmpty. Operand 33806 states and 110729 transitions. [2019-12-18 13:19:13,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:19:13,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:13,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:13,493 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:13,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:13,493 INFO L82 PathProgramCache]: Analyzing trace with hash 627665056, now seen corresponding path program 1 times [2019-12-18 13:19:13,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:13,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554582216] [2019-12-18 13:19:13,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:13,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:13,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554582216] [2019-12-18 13:19:13,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:13,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:19:13,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28709613] [2019-12-18 13:19:13,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:19:13,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:13,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:19:13,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:13,580 INFO L87 Difference]: Start difference. First operand 33806 states and 110729 transitions. Second operand 3 states. [2019-12-18 13:19:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:13,784 INFO L93 Difference]: Finished difference Result 52205 states and 169891 transitions. [2019-12-18 13:19:13,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:19:13,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 13:19:13,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:13,876 INFO L225 Difference]: With dead ends: 52205 [2019-12-18 13:19:13,876 INFO L226 Difference]: Without dead ends: 52205 [2019-12-18 13:19:13,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:14,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52205 states. [2019-12-18 13:19:15,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52205 to 38718. [2019-12-18 13:19:15,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38718 states. [2019-12-18 13:19:15,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38718 states to 38718 states and 127749 transitions. [2019-12-18 13:19:15,192 INFO L78 Accepts]: Start accepts. Automaton has 38718 states and 127749 transitions. Word has length 16 [2019-12-18 13:19:15,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:15,193 INFO L462 AbstractCegarLoop]: Abstraction has 38718 states and 127749 transitions. [2019-12-18 13:19:15,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:19:15,194 INFO L276 IsEmpty]: Start isEmpty. Operand 38718 states and 127749 transitions. [2019-12-18 13:19:15,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:19:15,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:15,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:15,197 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:15,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:15,198 INFO L82 PathProgramCache]: Analyzing trace with hash 712450242, now seen corresponding path program 1 times [2019-12-18 13:19:15,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:15,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079391712] [2019-12-18 13:19:15,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:15,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:15,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079391712] [2019-12-18 13:19:15,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:15,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:19:15,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032949194] [2019-12-18 13:19:15,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:19:15,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:15,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:19:15,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:19:15,291 INFO L87 Difference]: Start difference. First operand 38718 states and 127749 transitions. Second operand 4 states. [2019-12-18 13:19:15,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:15,689 INFO L93 Difference]: Finished difference Result 46485 states and 150983 transitions. [2019-12-18 13:19:15,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:19:15,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:19:15,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:15,776 INFO L225 Difference]: With dead ends: 46485 [2019-12-18 13:19:15,776 INFO L226 Difference]: Without dead ends: 46485 [2019-12-18 13:19:15,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:16,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46485 states. [2019-12-18 13:19:17,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46485 to 42622. [2019-12-18 13:19:17,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42622 states. [2019-12-18 13:19:17,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42622 states to 42622 states and 139503 transitions. [2019-12-18 13:19:17,105 INFO L78 Accepts]: Start accepts. Automaton has 42622 states and 139503 transitions. Word has length 16 [2019-12-18 13:19:17,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:17,106 INFO L462 AbstractCegarLoop]: Abstraction has 42622 states and 139503 transitions. [2019-12-18 13:19:17,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:19:17,106 INFO L276 IsEmpty]: Start isEmpty. Operand 42622 states and 139503 transitions. [2019-12-18 13:19:17,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:19:17,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:17,110 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:17,110 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:17,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:17,111 INFO L82 PathProgramCache]: Analyzing trace with hash 646000998, now seen corresponding path program 1 times [2019-12-18 13:19:17,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:17,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126445749] [2019-12-18 13:19:17,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:17,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:17,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126445749] [2019-12-18 13:19:17,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:17,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:19:17,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976450881] [2019-12-18 13:19:17,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:19:17,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:17,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:19:17,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:19:17,183 INFO L87 Difference]: Start difference. First operand 42622 states and 139503 transitions. Second operand 4 states. [2019-12-18 13:19:17,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:17,561 INFO L93 Difference]: Finished difference Result 51005 states and 165609 transitions. [2019-12-18 13:19:17,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:19:17,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:19:17,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:17,647 INFO L225 Difference]: With dead ends: 51005 [2019-12-18 13:19:17,648 INFO L226 Difference]: Without dead ends: 51005 [2019-12-18 13:19:17,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:17,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51005 states. [2019-12-18 13:19:18,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51005 to 44274. [2019-12-18 13:19:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44274 states. [2019-12-18 13:19:18,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44274 states to 44274 states and 144974 transitions. [2019-12-18 13:19:18,495 INFO L78 Accepts]: Start accepts. Automaton has 44274 states and 144974 transitions. Word has length 16 [2019-12-18 13:19:18,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:18,495 INFO L462 AbstractCegarLoop]: Abstraction has 44274 states and 144974 transitions. [2019-12-18 13:19:18,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:19:18,495 INFO L276 IsEmpty]: Start isEmpty. Operand 44274 states and 144974 transitions. [2019-12-18 13:19:18,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:19:18,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:18,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:18,510 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:18,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:18,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2051800974, now seen corresponding path program 1 times [2019-12-18 13:19:18,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:18,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673576048] [2019-12-18 13:19:18,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:18,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673576048] [2019-12-18 13:19:18,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:18,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:19:18,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974040998] [2019-12-18 13:19:18,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:19:18,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:18,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:19:18,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:18,696 INFO L87 Difference]: Start difference. First operand 44274 states and 144974 transitions. Second operand 5 states. [2019-12-18 13:19:19,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:19,818 INFO L93 Difference]: Finished difference Result 60565 states and 193473 transitions. [2019-12-18 13:19:19,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:19:19,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 13:19:19,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:19,914 INFO L225 Difference]: With dead ends: 60565 [2019-12-18 13:19:19,914 INFO L226 Difference]: Without dead ends: 60558 [2019-12-18 13:19:19,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:19:20,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60558 states. [2019-12-18 13:19:20,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60558 to 45614. [2019-12-18 13:19:20,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45614 states. [2019-12-18 13:19:20,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45614 states to 45614 states and 149067 transitions. [2019-12-18 13:19:20,790 INFO L78 Accepts]: Start accepts. Automaton has 45614 states and 149067 transitions. Word has length 22 [2019-12-18 13:19:20,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:20,791 INFO L462 AbstractCegarLoop]: Abstraction has 45614 states and 149067 transitions. [2019-12-18 13:19:20,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:19:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 45614 states and 149067 transitions. [2019-12-18 13:19:20,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:19:20,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:20,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:20,801 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:20,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:20,801 INFO L82 PathProgramCache]: Analyzing trace with hash -2118250218, now seen corresponding path program 1 times [2019-12-18 13:19:20,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:20,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007757609] [2019-12-18 13:19:20,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:20,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007757609] [2019-12-18 13:19:20,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:20,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:19:20,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534392714] [2019-12-18 13:19:20,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:19:20,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:20,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:19:20,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:20,899 INFO L87 Difference]: Start difference. First operand 45614 states and 149067 transitions. Second operand 5 states. [2019-12-18 13:19:21,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:21,563 INFO L93 Difference]: Finished difference Result 63360 states and 201880 transitions. [2019-12-18 13:19:21,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:19:21,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 13:19:21,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:21,666 INFO L225 Difference]: With dead ends: 63360 [2019-12-18 13:19:21,667 INFO L226 Difference]: Without dead ends: 63353 [2019-12-18 13:19:21,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:19:21,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63353 states. [2019-12-18 13:19:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63353 to 43925. [2019-12-18 13:19:22,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43925 states. [2019-12-18 13:19:23,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43925 states to 43925 states and 143672 transitions. [2019-12-18 13:19:23,050 INFO L78 Accepts]: Start accepts. Automaton has 43925 states and 143672 transitions. Word has length 22 [2019-12-18 13:19:23,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:23,051 INFO L462 AbstractCegarLoop]: Abstraction has 43925 states and 143672 transitions. [2019-12-18 13:19:23,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:19:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand 43925 states and 143672 transitions. [2019-12-18 13:19:23,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:19:23,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:23,066 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:23,066 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:23,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:23,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1701171988, now seen corresponding path program 1 times [2019-12-18 13:19:23,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:23,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483690695] [2019-12-18 13:19:23,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:23,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483690695] [2019-12-18 13:19:23,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:23,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:19:23,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166925058] [2019-12-18 13:19:23,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:19:23,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:23,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:19:23,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:19:23,120 INFO L87 Difference]: Start difference. First operand 43925 states and 143672 transitions. Second operand 4 states. [2019-12-18 13:19:23,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:23,221 INFO L93 Difference]: Finished difference Result 18121 states and 56197 transitions. [2019-12-18 13:19:23,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:19:23,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:19:23,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:23,267 INFO L225 Difference]: With dead ends: 18121 [2019-12-18 13:19:23,267 INFO L226 Difference]: Without dead ends: 18121 [2019-12-18 13:19:23,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:19:23,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18121 states. [2019-12-18 13:19:23,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18121 to 17758. [2019-12-18 13:19:23,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-18 13:19:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 55161 transitions. [2019-12-18 13:19:23,706 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 55161 transitions. Word has length 25 [2019-12-18 13:19:23,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:23,708 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 55161 transitions. [2019-12-18 13:19:23,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:19:23,708 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 55161 transitions. [2019-12-18 13:19:23,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:19:23,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:23,726 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-18 13:19:23,726 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:23,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:23,727 INFO L82 PathProgramCache]: Analyzing trace with hash -735951720, now seen corresponding path program 1 times [2019-12-18 13:19:23,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:23,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643140644] [2019-12-18 13:19:23,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:23,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643140644] [2019-12-18 13:19:23,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:23,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:19:23,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292281592] [2019-12-18 13:19:23,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:19:23,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:23,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:19:23,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:23,775 INFO L87 Difference]: Start difference. First operand 17758 states and 55161 transitions. Second operand 3 states. [2019-12-18 13:19:23,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:23,874 INFO L93 Difference]: Finished difference Result 23499 states and 69479 transitions. [2019-12-18 13:19:23,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:19:23,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 13:19:23,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:23,904 INFO L225 Difference]: With dead ends: 23499 [2019-12-18 13:19:23,904 INFO L226 Difference]: Without dead ends: 23499 [2019-12-18 13:19:23,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23499 states. [2019-12-18 13:19:24,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23499 to 17758. [2019-12-18 13:19:24,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-18 13:19:24,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 52847 transitions. [2019-12-18 13:19:24,216 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 52847 transitions. Word has length 27 [2019-12-18 13:19:24,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:24,216 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 52847 transitions. [2019-12-18 13:19:24,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:19:24,216 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 52847 transitions. [2019-12-18 13:19:24,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:19:24,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:24,229 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-18 13:19:24,229 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:24,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:24,230 INFO L82 PathProgramCache]: Analyzing trace with hash -963527987, now seen corresponding path program 1 times [2019-12-18 13:19:24,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:24,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263223952] [2019-12-18 13:19:24,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:24,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:24,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263223952] [2019-12-18 13:19:24,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:24,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:19:24,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908034773] [2019-12-18 13:19:24,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:19:24,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:24,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:19:24,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:24,307 INFO L87 Difference]: Start difference. First operand 17758 states and 52847 transitions. Second operand 5 states. [2019-12-18 13:19:24,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:24,670 INFO L93 Difference]: Finished difference Result 21964 states and 64554 transitions. [2019-12-18 13:19:24,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:19:24,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 13:19:24,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:24,699 INFO L225 Difference]: With dead ends: 21964 [2019-12-18 13:19:24,700 INFO L226 Difference]: Without dead ends: 21964 [2019-12-18 13:19:24,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:19:25,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21964 states. [2019-12-18 13:19:25,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21964 to 20594. [2019-12-18 13:19:25,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20594 states. [2019-12-18 13:19:25,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20594 states to 20594 states and 61091 transitions. [2019-12-18 13:19:25,246 INFO L78 Accepts]: Start accepts. Automaton has 20594 states and 61091 transitions. Word has length 27 [2019-12-18 13:19:25,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:25,246 INFO L462 AbstractCegarLoop]: Abstraction has 20594 states and 61091 transitions. [2019-12-18 13:19:25,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:19:25,246 INFO L276 IsEmpty]: Start isEmpty. Operand 20594 states and 61091 transitions. [2019-12-18 13:19:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:19:25,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:25,261 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:25,261 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:25,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:25,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1072867226, now seen corresponding path program 1 times [2019-12-18 13:19:25,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:25,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244291836] [2019-12-18 13:19:25,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:25,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244291836] [2019-12-18 13:19:25,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:25,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:19:25,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786710028] [2019-12-18 13:19:25,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:19:25,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:25,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:19:25,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:25,359 INFO L87 Difference]: Start difference. First operand 20594 states and 61091 transitions. Second operand 5 states. [2019-12-18 13:19:25,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:25,457 INFO L93 Difference]: Finished difference Result 20911 states and 61888 transitions. [2019-12-18 13:19:25,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:19:25,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 13:19:25,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:25,484 INFO L225 Difference]: With dead ends: 20911 [2019-12-18 13:19:25,484 INFO L226 Difference]: Without dead ends: 20911 [2019-12-18 13:19:25,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:25,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20911 states. [2019-12-18 13:19:25,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20911 to 20911. [2019-12-18 13:19:25,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20911 states. [2019-12-18 13:19:25,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20911 states to 20911 states and 61888 transitions. [2019-12-18 13:19:25,792 INFO L78 Accepts]: Start accepts. Automaton has 20911 states and 61888 transitions. Word has length 28 [2019-12-18 13:19:25,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:25,792 INFO L462 AbstractCegarLoop]: Abstraction has 20911 states and 61888 transitions. [2019-12-18 13:19:25,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:19:25,793 INFO L276 IsEmpty]: Start isEmpty. Operand 20911 states and 61888 transitions. [2019-12-18 13:19:25,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 13:19:25,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:25,809 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] [2019-12-18 13:19:25,809 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:25,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:25,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1714199023, now seen corresponding path program 1 times [2019-12-18 13:19:25,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:25,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817448040] [2019-12-18 13:19:25,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:25,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817448040] [2019-12-18 13:19:25,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:25,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:19:25,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228668848] [2019-12-18 13:19:25,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:19:25,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:25,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:19:25,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:25,898 INFO L87 Difference]: Start difference. First operand 20911 states and 61888 transitions. Second operand 5 states. [2019-12-18 13:19:26,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:26,269 INFO L93 Difference]: Finished difference Result 24383 states and 71254 transitions. [2019-12-18 13:19:26,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:19:26,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 13:19:26,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:26,302 INFO L225 Difference]: With dead ends: 24383 [2019-12-18 13:19:26,303 INFO L226 Difference]: Without dead ends: 24383 [2019-12-18 13:19:26,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:19:26,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24383 states. [2019-12-18 13:19:26,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24383 to 21026. [2019-12-18 13:19:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21026 states. [2019-12-18 13:19:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21026 states to 21026 states and 62164 transitions. [2019-12-18 13:19:26,643 INFO L78 Accepts]: Start accepts. Automaton has 21026 states and 62164 transitions. Word has length 29 [2019-12-18 13:19:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:26,644 INFO L462 AbstractCegarLoop]: Abstraction has 21026 states and 62164 transitions. [2019-12-18 13:19:26,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:19:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 21026 states and 62164 transitions. [2019-12-18 13:19:26,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:19:26,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:26,664 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:26,665 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:26,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:26,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1459957021, now seen corresponding path program 1 times [2019-12-18 13:19:26,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:26,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877547024] [2019-12-18 13:19:26,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:26,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:26,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877547024] [2019-12-18 13:19:26,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:26,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:19:26,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413086085] [2019-12-18 13:19:26,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:19:26,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:26,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:19:26,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:19:26,766 INFO L87 Difference]: Start difference. First operand 21026 states and 62164 transitions. Second operand 6 states. [2019-12-18 13:19:27,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:27,509 INFO L93 Difference]: Finished difference Result 27860 states and 80966 transitions. [2019-12-18 13:19:27,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:19:27,510 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 13:19:27,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:27,553 INFO L225 Difference]: With dead ends: 27860 [2019-12-18 13:19:27,553 INFO L226 Difference]: Without dead ends: 27860 [2019-12-18 13:19:27,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:19:27,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27860 states. [2019-12-18 13:19:28,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27860 to 22078. [2019-12-18 13:19:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22078 states. [2019-12-18 13:19:28,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22078 states to 22078 states and 65194 transitions. [2019-12-18 13:19:28,225 INFO L78 Accepts]: Start accepts. Automaton has 22078 states and 65194 transitions. Word has length 33 [2019-12-18 13:19:28,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:28,226 INFO L462 AbstractCegarLoop]: Abstraction has 22078 states and 65194 transitions. [2019-12-18 13:19:28,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:19:28,226 INFO L276 IsEmpty]: Start isEmpty. Operand 22078 states and 65194 transitions. [2019-12-18 13:19:28,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 13:19:28,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:28,245 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] [2019-12-18 13:19:28,245 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:28,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:28,245 INFO L82 PathProgramCache]: Analyzing trace with hash -617380767, now seen corresponding path program 1 times [2019-12-18 13:19:28,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:28,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650981175] [2019-12-18 13:19:28,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:28,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:28,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650981175] [2019-12-18 13:19:28,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:28,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:19:28,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964655198] [2019-12-18 13:19:28,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:19:28,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:28,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:19:28,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:19:28,361 INFO L87 Difference]: Start difference. First operand 22078 states and 65194 transitions. Second operand 6 states. [2019-12-18 13:19:29,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:29,032 INFO L93 Difference]: Finished difference Result 27029 states and 78779 transitions. [2019-12-18 13:19:29,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:19:29,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-18 13:19:29,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:29,080 INFO L225 Difference]: With dead ends: 27029 [2019-12-18 13:19:29,080 INFO L226 Difference]: Without dead ends: 27029 [2019-12-18 13:19:29,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:19:29,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27029 states. [2019-12-18 13:19:29,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27029 to 19090. [2019-12-18 13:19:29,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19090 states. [2019-12-18 13:19:29,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19090 states to 19090 states and 56687 transitions. [2019-12-18 13:19:29,420 INFO L78 Accepts]: Start accepts. Automaton has 19090 states and 56687 transitions. Word has length 35 [2019-12-18 13:19:29,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:29,420 INFO L462 AbstractCegarLoop]: Abstraction has 19090 states and 56687 transitions. [2019-12-18 13:19:29,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:19:29,420 INFO L276 IsEmpty]: Start isEmpty. Operand 19090 states and 56687 transitions. [2019-12-18 13:19:29,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:19:29,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:29,438 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:29,438 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:29,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:29,438 INFO L82 PathProgramCache]: Analyzing trace with hash -282480739, now seen corresponding path program 1 times [2019-12-18 13:19:29,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:29,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965526406] [2019-12-18 13:19:29,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:29,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965526406] [2019-12-18 13:19:29,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:29,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:19:29,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786230886] [2019-12-18 13:19:29,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:19:29,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:29,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:19:29,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:29,493 INFO L87 Difference]: Start difference. First operand 19090 states and 56687 transitions. Second operand 3 states. [2019-12-18 13:19:29,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:29,570 INFO L93 Difference]: Finished difference Result 19089 states and 56685 transitions. [2019-12-18 13:19:29,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:19:29,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 13:19:29,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:29,605 INFO L225 Difference]: With dead ends: 19089 [2019-12-18 13:19:29,605 INFO L226 Difference]: Without dead ends: 19089 [2019-12-18 13:19:29,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:29,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19089 states. [2019-12-18 13:19:29,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19089 to 19089. [2019-12-18 13:19:29,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19089 states. [2019-12-18 13:19:29,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19089 states to 19089 states and 56685 transitions. [2019-12-18 13:19:29,920 INFO L78 Accepts]: Start accepts. Automaton has 19089 states and 56685 transitions. Word has length 39 [2019-12-18 13:19:29,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:29,920 INFO L462 AbstractCegarLoop]: Abstraction has 19089 states and 56685 transitions. [2019-12-18 13:19:29,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:19:29,920 INFO L276 IsEmpty]: Start isEmpty. Operand 19089 states and 56685 transitions. [2019-12-18 13:19:29,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:19:29,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:29,943 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] [2019-12-18 13:19:29,943 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:29,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:29,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1129418560, now seen corresponding path program 1 times [2019-12-18 13:19:29,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:29,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630970665] [2019-12-18 13:19:29,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:30,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630970665] [2019-12-18 13:19:30,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:30,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:19:30,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161085699] [2019-12-18 13:19:30,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:19:30,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:30,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:19:30,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:30,014 INFO L87 Difference]: Start difference. First operand 19089 states and 56685 transitions. Second operand 5 states. [2019-12-18 13:19:30,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:30,602 INFO L93 Difference]: Finished difference Result 27483 states and 80802 transitions. [2019-12-18 13:19:30,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:19:30,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 13:19:30,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:30,639 INFO L225 Difference]: With dead ends: 27483 [2019-12-18 13:19:30,639 INFO L226 Difference]: Without dead ends: 27483 [2019-12-18 13:19:30,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:19:30,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27483 states. [2019-12-18 13:19:30,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27483 to 25378. [2019-12-18 13:19:30,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25378 states. [2019-12-18 13:19:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25378 states to 25378 states and 75084 transitions. [2019-12-18 13:19:31,385 INFO L78 Accepts]: Start accepts. Automaton has 25378 states and 75084 transitions. Word has length 40 [2019-12-18 13:19:31,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:31,386 INFO L462 AbstractCegarLoop]: Abstraction has 25378 states and 75084 transitions. [2019-12-18 13:19:31,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:19:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 25378 states and 75084 transitions. [2019-12-18 13:19:31,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:19:31,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:31,408 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] [2019-12-18 13:19:31,408 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:31,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:31,408 INFO L82 PathProgramCache]: Analyzing trace with hash -554035702, now seen corresponding path program 2 times [2019-12-18 13:19:31,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:31,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087955932] [2019-12-18 13:19:31,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:31,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:31,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087955932] [2019-12-18 13:19:31,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:31,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:19:31,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689100884] [2019-12-18 13:19:31,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:19:31,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:31,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:19:31,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:31,493 INFO L87 Difference]: Start difference. First operand 25378 states and 75084 transitions. Second operand 3 states. [2019-12-18 13:19:31,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:31,592 INFO L93 Difference]: Finished difference Result 25378 states and 75005 transitions. [2019-12-18 13:19:31,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:19:31,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 13:19:31,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:31,639 INFO L225 Difference]: With dead ends: 25378 [2019-12-18 13:19:31,639 INFO L226 Difference]: Without dead ends: 25378 [2019-12-18 13:19:31,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:31,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25378 states. [2019-12-18 13:19:31,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25378 to 21127. [2019-12-18 13:19:31,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21127 states. [2019-12-18 13:19:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21127 states to 21127 states and 63266 transitions. [2019-12-18 13:19:32,021 INFO L78 Accepts]: Start accepts. Automaton has 21127 states and 63266 transitions. Word has length 40 [2019-12-18 13:19:32,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:32,022 INFO L462 AbstractCegarLoop]: Abstraction has 21127 states and 63266 transitions. [2019-12-18 13:19:32,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:19:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand 21127 states and 63266 transitions. [2019-12-18 13:19:32,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 13:19:32,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:32,041 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] [2019-12-18 13:19:32,041 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:32,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:32,041 INFO L82 PathProgramCache]: Analyzing trace with hash -559165763, now seen corresponding path program 1 times [2019-12-18 13:19:32,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:32,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776619236] [2019-12-18 13:19:32,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:32,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:32,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776619236] [2019-12-18 13:19:32,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:32,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:19:32,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760441963] [2019-12-18 13:19:32,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:19:32,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:32,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:19:32,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:32,090 INFO L87 Difference]: Start difference. First operand 21127 states and 63266 transitions. Second operand 5 states. [2019-12-18 13:19:32,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:32,188 INFO L93 Difference]: Finished difference Result 19886 states and 60599 transitions. [2019-12-18 13:19:32,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:19:32,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 13:19:32,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:32,221 INFO L225 Difference]: With dead ends: 19886 [2019-12-18 13:19:32,221 INFO L226 Difference]: Without dead ends: 19886 [2019-12-18 13:19:32,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:32,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19886 states. [2019-12-18 13:19:32,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19886 to 19886. [2019-12-18 13:19:32,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19886 states. [2019-12-18 13:19:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19886 states to 19886 states and 60599 transitions. [2019-12-18 13:19:32,531 INFO L78 Accepts]: Start accepts. Automaton has 19886 states and 60599 transitions. Word has length 41 [2019-12-18 13:19:32,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:32,532 INFO L462 AbstractCegarLoop]: Abstraction has 19886 states and 60599 transitions. [2019-12-18 13:19:32,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:19:32,532 INFO L276 IsEmpty]: Start isEmpty. Operand 19886 states and 60599 transitions. [2019-12-18 13:19:32,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:19:32,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:32,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:32,553 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:32,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:32,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1104102808, now seen corresponding path program 1 times [2019-12-18 13:19:32,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:32,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756040288] [2019-12-18 13:19:32,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:32,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756040288] [2019-12-18 13:19:32,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:32,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:19:32,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990180982] [2019-12-18 13:19:32,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:19:32,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:32,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:19:32,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:19:32,647 INFO L87 Difference]: Start difference. First operand 19886 states and 60599 transitions. Second operand 7 states. [2019-12-18 13:19:33,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:33,196 INFO L93 Difference]: Finished difference Result 56173 states and 169762 transitions. [2019-12-18 13:19:33,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 13:19:33,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 13:19:33,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:33,261 INFO L225 Difference]: With dead ends: 56173 [2019-12-18 13:19:33,262 INFO L226 Difference]: Without dead ends: 43296 [2019-12-18 13:19:33,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 13:19:33,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43296 states. [2019-12-18 13:19:33,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43296 to 23308. [2019-12-18 13:19:33,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23308 states. [2019-12-18 13:19:33,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23308 states to 23308 states and 71016 transitions. [2019-12-18 13:19:33,802 INFO L78 Accepts]: Start accepts. Automaton has 23308 states and 71016 transitions. Word has length 65 [2019-12-18 13:19:33,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:33,803 INFO L462 AbstractCegarLoop]: Abstraction has 23308 states and 71016 transitions. [2019-12-18 13:19:33,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:19:33,803 INFO L276 IsEmpty]: Start isEmpty. Operand 23308 states and 71016 transitions. [2019-12-18 13:19:33,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:19:33,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:33,829 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:33,829 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:33,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:33,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1989977016, now seen corresponding path program 2 times [2019-12-18 13:19:33,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:33,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833509709] [2019-12-18 13:19:33,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:33,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833509709] [2019-12-18 13:19:33,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:33,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:19:33,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849834124] [2019-12-18 13:19:33,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:19:33,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:33,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:19:33,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:19:33,904 INFO L87 Difference]: Start difference. First operand 23308 states and 71016 transitions. Second operand 7 states. [2019-12-18 13:19:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:34,873 INFO L93 Difference]: Finished difference Result 62282 states and 186068 transitions. [2019-12-18 13:19:34,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:19:34,874 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 13:19:34,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:34,953 INFO L225 Difference]: With dead ends: 62282 [2019-12-18 13:19:34,953 INFO L226 Difference]: Without dead ends: 44545 [2019-12-18 13:19:34,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:19:35,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44545 states. [2019-12-18 13:19:35,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44545 to 27350. [2019-12-18 13:19:35,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27350 states. [2019-12-18 13:19:35,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27350 states to 27350 states and 82398 transitions. [2019-12-18 13:19:35,520 INFO L78 Accepts]: Start accepts. Automaton has 27350 states and 82398 transitions. Word has length 65 [2019-12-18 13:19:35,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:35,520 INFO L462 AbstractCegarLoop]: Abstraction has 27350 states and 82398 transitions. [2019-12-18 13:19:35,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:19:35,521 INFO L276 IsEmpty]: Start isEmpty. Operand 27350 states and 82398 transitions. [2019-12-18 13:19:35,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:19:35,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:35,547 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:35,548 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:35,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:35,548 INFO L82 PathProgramCache]: Analyzing trace with hash 982875086, now seen corresponding path program 3 times [2019-12-18 13:19:35,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:35,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047665396] [2019-12-18 13:19:35,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:35,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047665396] [2019-12-18 13:19:35,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:35,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:19:35,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468693809] [2019-12-18 13:19:35,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:19:35,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:35,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:19:35,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:19:35,620 INFO L87 Difference]: Start difference. First operand 27350 states and 82398 transitions. Second operand 7 states. [2019-12-18 13:19:36,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:36,116 INFO L93 Difference]: Finished difference Result 54026 states and 160947 transitions. [2019-12-18 13:19:36,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:19:36,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 13:19:36,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:36,209 INFO L225 Difference]: With dead ends: 54026 [2019-12-18 13:19:36,209 INFO L226 Difference]: Without dead ends: 47313 [2019-12-18 13:19:36,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:19:36,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47313 states. [2019-12-18 13:19:36,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47313 to 27658. [2019-12-18 13:19:36,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27658 states. [2019-12-18 13:19:36,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27658 states to 27658 states and 83349 transitions. [2019-12-18 13:19:36,816 INFO L78 Accepts]: Start accepts. Automaton has 27658 states and 83349 transitions. Word has length 65 [2019-12-18 13:19:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:36,816 INFO L462 AbstractCegarLoop]: Abstraction has 27658 states and 83349 transitions. [2019-12-18 13:19:36,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:19:36,816 INFO L276 IsEmpty]: Start isEmpty. Operand 27658 states and 83349 transitions. [2019-12-18 13:19:36,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:19:36,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:36,845 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:36,845 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:36,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:36,845 INFO L82 PathProgramCache]: Analyzing trace with hash -156874998, now seen corresponding path program 4 times [2019-12-18 13:19:36,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:36,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568160398] [2019-12-18 13:19:36,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:36,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:36,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568160398] [2019-12-18 13:19:36,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:36,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:19:36,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519296305] [2019-12-18 13:19:36,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:19:36,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:36,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:19:36,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:36,899 INFO L87 Difference]: Start difference. First operand 27658 states and 83349 transitions. Second operand 3 states. [2019-12-18 13:19:37,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:37,087 INFO L93 Difference]: Finished difference Result 30812 states and 92747 transitions. [2019-12-18 13:19:37,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:19:37,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:19:37,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:37,155 INFO L225 Difference]: With dead ends: 30812 [2019-12-18 13:19:37,155 INFO L226 Difference]: Without dead ends: 30812 [2019-12-18 13:19:37,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:37,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30812 states. [2019-12-18 13:19:38,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30812 to 25037. [2019-12-18 13:19:38,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25037 states. [2019-12-18 13:19:38,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25037 states to 25037 states and 76106 transitions. [2019-12-18 13:19:38,300 INFO L78 Accepts]: Start accepts. Automaton has 25037 states and 76106 transitions. Word has length 65 [2019-12-18 13:19:38,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:38,301 INFO L462 AbstractCegarLoop]: Abstraction has 25037 states and 76106 transitions. [2019-12-18 13:19:38,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:19:38,301 INFO L276 IsEmpty]: Start isEmpty. Operand 25037 states and 76106 transitions. [2019-12-18 13:19:38,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:19:38,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:38,338 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:38,338 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:38,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:38,338 INFO L82 PathProgramCache]: Analyzing trace with hash 771503262, now seen corresponding path program 1 times [2019-12-18 13:19:38,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:38,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963919456] [2019-12-18 13:19:38,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:38,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:38,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963919456] [2019-12-18 13:19:38,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:38,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:19:38,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737964110] [2019-12-18 13:19:38,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:19:38,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:38,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:19:38,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:38,414 INFO L87 Difference]: Start difference. First operand 25037 states and 76106 transitions. Second operand 3 states. [2019-12-18 13:19:38,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:38,507 INFO L93 Difference]: Finished difference Result 20969 states and 62663 transitions. [2019-12-18 13:19:38,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:19:38,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:19:38,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:38,536 INFO L225 Difference]: With dead ends: 20969 [2019-12-18 13:19:38,536 INFO L226 Difference]: Without dead ends: 20969 [2019-12-18 13:19:38,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:38,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20969 states. [2019-12-18 13:19:38,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20969 to 19009. [2019-12-18 13:19:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19009 states. [2019-12-18 13:19:38,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19009 states to 19009 states and 56843 transitions. [2019-12-18 13:19:38,824 INFO L78 Accepts]: Start accepts. Automaton has 19009 states and 56843 transitions. Word has length 66 [2019-12-18 13:19:38,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:38,824 INFO L462 AbstractCegarLoop]: Abstraction has 19009 states and 56843 transitions. [2019-12-18 13:19:38,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:19:38,824 INFO L276 IsEmpty]: Start isEmpty. Operand 19009 states and 56843 transitions. [2019-12-18 13:19:38,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:19:38,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:38,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:38,842 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:38,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:38,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1509100091, now seen corresponding path program 1 times [2019-12-18 13:19:38,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:38,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334714886] [2019-12-18 13:19:38,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:39,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:39,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334714886] [2019-12-18 13:19:39,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:39,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:19:39,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396826665] [2019-12-18 13:19:39,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:19:39,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:39,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:19:39,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:19:39,012 INFO L87 Difference]: Start difference. First operand 19009 states and 56843 transitions. Second operand 11 states. [2019-12-18 13:19:40,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:40,169 INFO L93 Difference]: Finished difference Result 43638 states and 129396 transitions. [2019-12-18 13:19:40,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 13:19:40,169 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 13:19:40,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:40,213 INFO L225 Difference]: With dead ends: 43638 [2019-12-18 13:19:40,213 INFO L226 Difference]: Without dead ends: 32919 [2019-12-18 13:19:40,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=912, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 13:19:40,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32919 states. [2019-12-18 13:19:40,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32919 to 18279. [2019-12-18 13:19:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18279 states. [2019-12-18 13:19:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18279 states to 18279 states and 54342 transitions. [2019-12-18 13:19:40,590 INFO L78 Accepts]: Start accepts. Automaton has 18279 states and 54342 transitions. Word has length 67 [2019-12-18 13:19:40,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:40,590 INFO L462 AbstractCegarLoop]: Abstraction has 18279 states and 54342 transitions. [2019-12-18 13:19:40,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:19:40,590 INFO L276 IsEmpty]: Start isEmpty. Operand 18279 states and 54342 transitions. [2019-12-18 13:19:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:19:40,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:40,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:40,608 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:40,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:40,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1209104993, now seen corresponding path program 2 times [2019-12-18 13:19:40,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:40,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249476166] [2019-12-18 13:19:40,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:19:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:19:40,729 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:19:40,729 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:19:40,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= v_~a$w_buff0~0_303 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~__unbuffered_p2_EBX~0_46 0) (= v_~z~0_13 0) (= |v_#NULL.offset_7| 0) (= v_~a~0_199 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd2~0_205) (= v_~a$r_buff0_thd3~0_412 0) (= v_~weak$$choice2~0_126 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t913~0.base_30|)) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= v_~y~0_30 0) (= v_~a$r_buff1_thd3~0_326 0) (= v_~main$tmp_guard0~0_25 0) (= 0 v_~__unbuffered_cnt~0_83) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~a$w_buff1_used~0_450) (= (store .cse0 |v_ULTIMATE.start_main_~#t913~0.base_30| 1) |v_#valid_67|) (= 0 |v_ULTIMATE.start_main_~#t913~0.offset_22|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t913~0.base_30|) (= 0 v_~__unbuffered_p0_EAX~0_159) (= v_~a$flush_delayed~0_27 0) (= 0 v_~a$r_buff1_thd2~0_197) (= v_~a$mem_tmp~0_16 0) (= v_~main$tmp_guard1~0_32 0) (= 0 |v_#NULL.base_7|) (= 0 v_~a$r_buff1_thd1~0_190) (= v_~a$r_buff1_thd0~0_208 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t913~0.base_30| 4)) (= 0 v_~x~0_153) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t913~0.base_30| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t913~0.base_30|) |v_ULTIMATE.start_main_~#t913~0.offset_22| 0)) |v_#memory_int_19|) (= 0 v_~a$w_buff1~0_206) (= 0 v_~a$r_buff0_thd1~0_334) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~a$r_buff0_thd0~0_214 0) (= 0 v_~weak$$choice0~0_13) (= 0 v_~a$w_buff0_used~0_788))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_197, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_53|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_53|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_214, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_33|, ~a~0=v_~a~0_199, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_46, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_326, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_788, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_334, ULTIMATE.start_main_~#t914~0.base=|v_ULTIMATE.start_main_~#t914~0.base_23|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_303, ULTIMATE.start_main_~#t913~0.base=|v_ULTIMATE.start_main_~#t913~0.base_30|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_208, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~x~0=v_~x~0_153, ~a$read_delayed~0=v_~a$read_delayed~0_7, ULTIMATE.start_main_~#t915~0.base=|v_ULTIMATE.start_main_~#t915~0.base_15|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_79|, ULTIMATE.start_main_~#t915~0.offset=|v_ULTIMATE.start_main_~#t915~0.offset_13|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_206, ~y~0=v_~y~0_30, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_190, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_412, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ULTIMATE.start_main_~#t913~0.offset=|v_ULTIMATE.start_main_~#t913~0.offset_22|, #NULL.base=|v_#NULL.base_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t914~0.offset=|v_ULTIMATE.start_main_~#t914~0.offset_17|, ~z~0=v_~z~0_13, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_450, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t914~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ULTIMATE.start_main_~#t913~0.base, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ULTIMATE.start_main_~#t915~0.base, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t915~0.offset, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t913~0.offset, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t914~0.offset, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 13:19:40,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L750: Formula: (and (= ~a$r_buff0_thd0~0_In-1762226729 ~a$r_buff1_thd0~0_Out-1762226729) (= ~a$r_buff1_thd2~0_Out-1762226729 ~a$r_buff0_thd2~0_In-1762226729) (= ~a$r_buff0_thd3~0_In-1762226729 ~a$r_buff1_thd3~0_Out-1762226729) (= ~a$r_buff0_thd1~0_In-1762226729 ~a$r_buff1_thd1~0_Out-1762226729) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1762226729)) (= ~x~0_In-1762226729 ~__unbuffered_p0_EAX~0_Out-1762226729) (= 1 ~a$r_buff0_thd1~0_Out-1762226729)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1762226729, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1762226729, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1762226729, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1762226729, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1762226729, ~x~0=~x~0_In-1762226729} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1762226729, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-1762226729, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-1762226729, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-1762226729, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1762226729, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-1762226729, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1762226729, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1762226729, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1762226729, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1762226729, ~x~0=~x~0_In-1762226729} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:19:40,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L832-1-->L834: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t914~0.offset_10|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t914~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t914~0.base_11|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t914~0.base_11| 1)) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t914~0.base_11|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t914~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t914~0.base_11|) |v_ULTIMATE.start_main_~#t914~0.offset_10| 1)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t914~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t914~0.offset=|v_ULTIMATE.start_main_~#t914~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t914~0.base=|v_ULTIMATE.start_main_~#t914~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t914~0.offset, #length, ULTIMATE.start_main_~#t914~0.base] because there is no mapped edge [2019-12-18 13:19:40,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L834-1-->L836: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t915~0.offset_10|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t915~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t915~0.base_11|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t915~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t915~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t915~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t915~0.base_11|) |v_ULTIMATE.start_main_~#t915~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t915~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t915~0.base=|v_ULTIMATE.start_main_~#t915~0.base_11|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t915~0.offset=|v_ULTIMATE.start_main_~#t915~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t915~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t915~0.offset] because there is no mapped edge [2019-12-18 13:19:40,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L770-2-->L770-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In-349001858 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-349001858 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-349001858| ~a$w_buff1~0_In-349001858)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-349001858| ~a~0_In-349001858)))) InVars {~a~0=~a~0_In-349001858, ~a$w_buff1~0=~a$w_buff1~0_In-349001858, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-349001858, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-349001858} OutVars{~a~0=~a~0_In-349001858, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-349001858|, ~a$w_buff1~0=~a$w_buff1~0_In-349001858, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-349001858, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-349001858} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 13:19:40,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L770-4-->L771: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_30| v_~a~0_66) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_30|} OutVars{~a~0=v_~a~0_66, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_29|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_43|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 13:19:40,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In1987763592 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1987763592 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1987763592|) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out1987763592| ~a$w_buff0_used~0_In1987763592) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1987763592, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1987763592} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1987763592, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1987763592, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1987763592|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 13:19:40,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-2007479647 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-2007479647 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-2007479647 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd2~0_In-2007479647 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-2007479647|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-2007479647| ~a$w_buff1_used~0_In-2007479647) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2007479647, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2007479647, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2007479647, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2007479647} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2007479647, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2007479647, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2007479647, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-2007479647|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2007479647} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 13:19:40,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-806844697 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-806844697 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out-806844697| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd2~0_In-806844697 |P1Thread1of1ForFork2_#t~ite13_Out-806844697|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-806844697, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-806844697} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-806844697, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-806844697, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-806844697|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 13:19:40,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L774-->L774-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd2~0_In361759650 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In361759650 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In361759650 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In361759650 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out361759650|)) (and (or .cse3 .cse2) (= ~a$r_buff1_thd2~0_In361759650 |P1Thread1of1ForFork2_#t~ite14_Out361759650|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In361759650, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In361759650, ~a$w_buff0_used~0=~a$w_buff0_used~0_In361759650, ~a$w_buff1_used~0=~a$w_buff1_used~0_In361759650} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In361759650, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In361759650, ~a$w_buff0_used~0=~a$w_buff0_used~0_In361759650, ~a$w_buff1_used~0=~a$w_buff1_used~0_In361759650, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out361759650|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 13:19:40,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L774-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_24| v_~a$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_24|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_23|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 13:19:40,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In168625103 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In168625103 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out168625103| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out168625103| ~a$w_buff0_used~0_In168625103)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In168625103, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In168625103} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out168625103|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In168625103, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In168625103} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 13:19:40,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-2054601087 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-2054601087 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-2054601087 256))) (.cse3 (= (mod ~a$r_buff1_thd1~0_In-2054601087 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-2054601087|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-2054601087 |P0Thread1of1ForFork1_#t~ite6_Out-2054601087|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2054601087, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2054601087, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2054601087, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2054601087} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-2054601087|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2054601087, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2054601087, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2054601087, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2054601087} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 13:19:40,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L753-->L754: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In948520259 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In948520259 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out948520259)) (and (= ~a$r_buff0_thd1~0_In948520259 ~a$r_buff0_thd1~0_Out948520259) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In948520259, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In948520259} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out948520259|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In948520259, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out948520259} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:19:40,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L754-->L754-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-556614538 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-556614538 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In-556614538 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-556614538 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-556614538| ~a$r_buff1_thd1~0_In-556614538) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork1_#t~ite8_Out-556614538| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-556614538, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-556614538, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-556614538, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-556614538} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-556614538|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-556614538, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-556614538, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-556614538, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-556614538} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 13:19:40,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L754-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~a$r_buff1_thd1~0_87 |v_P0Thread1of1ForFork1_#t~ite8_38|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_37|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_87, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:19:40,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1389962266 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out1389962266| |P2Thread1of1ForFork0_#t~ite30_Out1389962266|) (= |P2Thread1of1ForFork0_#t~ite29_Out1389962266| ~a$w_buff1_used~0_In1389962266) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1389962266 256) 0))) (or (and (= (mod ~a$r_buff1_thd3~0_In1389962266 256) 0) .cse1) (and (= (mod ~a$w_buff1_used~0_In1389962266 256) 0) .cse1) (= (mod ~a$w_buff0_used~0_In1389962266 256) 0)))) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite29_In1389962266| |P2Thread1of1ForFork0_#t~ite29_Out1389962266|) (= ~a$w_buff1_used~0_In1389962266 |P2Thread1of1ForFork0_#t~ite30_Out1389962266|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1389962266, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1389962266, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1389962266, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1389962266, ~weak$$choice2~0=~weak$$choice2~0_In1389962266, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1389962266|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1389962266, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1389962266, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1389962266, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1389962266, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1389962266|, ~weak$$choice2~0=~weak$$choice2~0_In1389962266, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1389962266|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 13:19:40,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~a$r_buff0_thd3~0_66 v_~a$r_buff0_thd3~0_65)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 13:19:40,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-->L809: Formula: (and (= v_~a$flush_delayed~0_11 0) (= v_~a~0_48 v_~a$mem_tmp~0_5) (not (= (mod v_~a$flush_delayed~0_12 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_11} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 13:19:40,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L809-2-->L809-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In1859837284 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd3~0_In1859837284 256) 0))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In1859837284 |P2Thread1of1ForFork0_#t~ite38_Out1859837284|)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out1859837284| ~a~0_In1859837284) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In1859837284, ~a$w_buff1~0=~a$w_buff1~0_In1859837284, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1859837284, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1859837284} OutVars{~a~0=~a~0_In1859837284, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1859837284|, ~a$w_buff1~0=~a$w_buff1~0_In1859837284, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1859837284, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1859837284} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 13:19:40,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-4-->L810: Formula: (= v_~a~0_37 |v_P2Thread1of1ForFork0_#t~ite38_14|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_14|} OutVars{~a~0=v_~a~0_37, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_13|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 13:19:40,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1930864309 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In1930864309 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out1930864309| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1930864309 |P2Thread1of1ForFork0_#t~ite40_Out1930864309|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1930864309, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1930864309} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1930864309|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1930864309, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1930864309} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 13:19:40,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1703782645 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-1703782645 256))) (.cse2 (= (mod ~a$r_buff0_thd3~0_In-1703782645 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-1703782645 256) 0))) (or (and (= ~a$w_buff1_used~0_In-1703782645 |P2Thread1of1ForFork0_#t~ite41_Out-1703782645|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1703782645|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1703782645, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1703782645, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1703782645, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1703782645} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1703782645, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1703782645, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1703782645, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1703782645, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1703782645|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 13:19:40,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-995626245 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-995626245 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-995626245| ~a$r_buff0_thd3~0_In-995626245)) (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-995626245|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-995626245, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-995626245} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-995626245, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-995626245, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-995626245|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 13:19:40,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L813-->L813-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In-983761852 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd3~0_In-983761852 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-983761852 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-983761852 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-983761852| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In-983761852 |P2Thread1of1ForFork0_#t~ite43_Out-983761852|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-983761852, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-983761852, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-983761852, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-983761852} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-983761852|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-983761852, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-983761852, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-983761852, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-983761852} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 13:19:40,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 13:19:40,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:19:40,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L842-2-->L842-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-1358450232| |ULTIMATE.start_main_#t~ite47_Out-1358450232|)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-1358450232 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1358450232 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~a~0_In-1358450232 |ULTIMATE.start_main_#t~ite47_Out-1358450232|)) (and .cse0 (not .cse2) (= ~a$w_buff1~0_In-1358450232 |ULTIMATE.start_main_#t~ite47_Out-1358450232|) (not .cse1)))) InVars {~a~0=~a~0_In-1358450232, ~a$w_buff1~0=~a$w_buff1~0_In-1358450232, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1358450232, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1358450232} OutVars{~a~0=~a~0_In-1358450232, ~a$w_buff1~0=~a$w_buff1~0_In-1358450232, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1358450232|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1358450232, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1358450232|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1358450232} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:19:40,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In348364279 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In348364279 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out348364279| ~a$w_buff0_used~0_In348364279)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out348364279|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In348364279, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In348364279} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In348364279, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out348364279|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In348364279} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 13:19:40,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L844-->L844-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In1699983052 256))) (.cse2 (= (mod ~a$r_buff0_thd0~0_In1699983052 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1699983052 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In1699983052 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out1699983052| ~a$w_buff1_used~0_In1699983052) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out1699983052| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1699983052, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1699983052, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1699983052, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1699983052} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1699983052|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1699983052, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1699983052, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1699983052, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1699983052} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 13:19:40,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L845-->L845-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1569133201 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1569133201 256)))) (or (and (= ~a$r_buff0_thd0~0_In1569133201 |ULTIMATE.start_main_#t~ite51_Out1569133201|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1569133201|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1569133201, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1569133201} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1569133201|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1569133201, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1569133201} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:19:40,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L846-->L846-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In-2123720061 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-2123720061 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-2123720061 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-2123720061 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-2123720061| ~a$r_buff1_thd0~0_In-2123720061) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite52_Out-2123720061| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2123720061, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2123720061, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2123720061, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2123720061} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-2123720061|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2123720061, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2123720061, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2123720061, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2123720061} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 13:19:40,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= v_~main$tmp_guard1~0_17 0) (= v_~__unbuffered_p2_EBX~0_32 0) (= 1 v_~__unbuffered_p2_EAX~0_21) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~a$r_buff1_thd0~0_170 |v_ULTIMATE.start_main_#t~ite52_39|) (= 0 v_~__unbuffered_p0_EAX~0_128)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:19:40,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:19:40 BasicIcfg [2019-12-18 13:19:40,858 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:19:40,859 INFO L168 Benchmark]: Toolchain (without parser) took 90658.00 ms. Allocated memory was 146.3 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 102.6 MB in the beginning and 843.2 MB in the end (delta: -740.5 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-18 13:19:40,860 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 13:19:40,861 INFO L168 Benchmark]: CACSL2BoogieTranslator took 825.51 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.2 MB in the beginning and 157.5 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:19:40,861 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.84 ms. Allocated memory is still 204.5 MB. Free memory was 157.5 MB in the beginning and 154.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:19:40,861 INFO L168 Benchmark]: Boogie Preprocessor took 39.58 ms. Allocated memory is still 204.5 MB. Free memory was 154.9 MB in the beginning and 152.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:19:40,862 INFO L168 Benchmark]: RCFGBuilder took 872.80 ms. Allocated memory is still 204.5 MB. Free memory was 152.3 MB in the beginning and 101.8 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:19:40,862 INFO L168 Benchmark]: TraceAbstraction took 88852.55 ms. Allocated memory was 204.5 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.8 MB in the beginning and 843.2 MB in the end (delta: -741.4 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-18 13:19:40,865 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.24 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 825.51 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.2 MB in the beginning and 157.5 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.84 ms. Allocated memory is still 204.5 MB. Free memory was 157.5 MB in the beginning and 154.9 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.58 ms. Allocated memory is still 204.5 MB. Free memory was 154.9 MB in the beginning and 152.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 872.80 ms. Allocated memory is still 204.5 MB. Free memory was 152.3 MB in the beginning and 101.8 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88852.55 ms. Allocated memory was 204.5 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.8 MB in the beginning and 843.2 MB in the end (delta: -741.4 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 178 ProgramPointsBefore, 94 ProgramPointsAfterwards, 215 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 31 ChoiceCompositions, 7408 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 42 SemBasedMoverChecksPositive, 283 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 83880 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t913, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t914, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L772] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L773] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L836] FCALL, FORK 0 pthread_create(&t915, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 3 y = 1 [L787] 3 z = 1 [L790] 3 __unbuffered_p2_EAX = z [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 a$flush_delayed = weak$$choice2 [L796] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L798] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L798] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L799] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L800] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L800] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L801] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L803] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L809] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L810] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L811] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L812] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L842] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L842] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L843] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L844] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L845] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 88.4s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 22.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5301 SDtfs, 5052 SDslu, 13485 SDs, 0 SdLazy, 4937 SolverSat, 150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 34 SyntacticMatches, 15 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155174occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 37.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 184051 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 943 NumberOfCodeBlocks, 943 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 851 ConstructedInterpolants, 0 QuantifiedInterpolants, 139353 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...