/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:32:15,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:32:15,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:32:15,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:32:15,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:32:15,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:32:15,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:32:15,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:32:15,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:32:15,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:32:15,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:32:15,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:32:15,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:32:15,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:32:15,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:32:15,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:32:15,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:32:15,931 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:32:15,933 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:32:15,938 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:32:15,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:32:15,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:32:15,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:32:15,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:32:15,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:32:15,950 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:32:15,950 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:32:15,951 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:32:15,953 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:32:15,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:32:15,954 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:32:15,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:32:15,955 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:32:15,956 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:32:15,957 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:32:15,957 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:32:15,958 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:32:15,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:32:15,958 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:32:15,959 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:32:15,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:32:15,961 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:32:15,990 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:32:15,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:32:15,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:32:15,991 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:32:15,992 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:32:15,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:32:15,992 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:32:15,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:32:15,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:32:15,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:32:15,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:32:15,993 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:32:15,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:32:15,993 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:32:15,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:32:15,994 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:32:15,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:32:15,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:32:15,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:32:15,995 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:32:15,995 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:32:15,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:32:15,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:32:15,996 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:32:15,996 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:32:15,996 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:32:15,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:32:15,996 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:32:15,996 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:32:15,997 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:32:16,278 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:32:16,297 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:32:16,301 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:32:16,302 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:32:16,303 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:32:16,304 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_pso.opt.i [2019-12-27 06:32:16,372 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bcfb66d8/739701f548574c29bead7403f97326e6/FLAG30d652a6d [2019-12-27 06:32:16,980 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:32:16,983 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_pso.opt.i [2019-12-27 06:32:17,006 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bcfb66d8/739701f548574c29bead7403f97326e6/FLAG30d652a6d [2019-12-27 06:32:17,227 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bcfb66d8/739701f548574c29bead7403f97326e6 [2019-12-27 06:32:17,237 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:32:17,239 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:32:17,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:32:17,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:32:17,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:32:17,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:32:17" (1/1) ... [2019-12-27 06:32:17,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17094c3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:32:17, skipping insertion in model container [2019-12-27 06:32:17,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:32:17" (1/1) ... [2019-12-27 06:32:17,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:32:17,303 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:32:17,852 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:32:17,870 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:32:17,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:32:18,015 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:32:18,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:32:18 WrapperNode [2019-12-27 06:32:18,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:32:18,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:32:18,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:32:18,016 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:32:18,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:32:18" (1/1) ... [2019-12-27 06:32:18,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:32:18" (1/1) ... [2019-12-27 06:32:18,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:32:18,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:32:18,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:32:18,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:32:18,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:32:18" (1/1) ... [2019-12-27 06:32:18,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:32:18" (1/1) ... [2019-12-27 06:32:18,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:32:18" (1/1) ... [2019-12-27 06:32:18,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:32:18" (1/1) ... [2019-12-27 06:32:18,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:32:18" (1/1) ... [2019-12-27 06:32:18,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:32:18" (1/1) ... [2019-12-27 06:32:18,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:32:18" (1/1) ... [2019-12-27 06:32:18,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:32:18,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:32:18,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:32:18,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:32:18,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:32:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:32:18,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:32:18,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:32:18,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:32:18,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:32:18,206 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:32:18,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:32:18,206 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:32:18,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:32:18,208 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:32:18,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:32:18,209 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 06:32:18,210 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 06:32:18,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:32:18,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:32:18,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:32:18,214 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:32:18,970 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:32:18,971 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:32:18,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:32:18 BoogieIcfgContainer [2019-12-27 06:32:18,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:32:18,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:32:18,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:32:18,977 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:32:18,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:32:17" (1/3) ... [2019-12-27 06:32:18,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2987fedb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:32:18, skipping insertion in model container [2019-12-27 06:32:18,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:32:18" (2/3) ... [2019-12-27 06:32:18,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2987fedb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:32:18, skipping insertion in model container [2019-12-27 06:32:18,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:32:18" (3/3) ... [2019-12-27 06:32:18,981 INFO L109 eAbstractionObserver]: Analyzing ICFG mix044_pso.opt.i [2019-12-27 06:32:18,992 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:32:18,992 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:32:19,000 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:32:19,001 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:32:19,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,040 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,040 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,042 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,042 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,043 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,044 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,051 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,051 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,051 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,052 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,052 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,052 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,052 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,053 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,053 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,053 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,054 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,054 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,054 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,054 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,055 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,055 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,055 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,055 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,056 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,056 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,056 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,056 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,057 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,057 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,057 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,057 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,058 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,058 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,058 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,079 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,079 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,080 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,080 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,085 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,085 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,088 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,089 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,094 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,094 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,097 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,097 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,098 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,098 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,098 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,099 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:32:19,116 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 06:32:19,137 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:32:19,137 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:32:19,138 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:32:19,138 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:32:19,138 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:32:19,138 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:32:19,138 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:32:19,138 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:32:19,162 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-27 06:32:19,165 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 06:32:19,280 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 06:32:19,280 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:32:19,294 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 06:32:19,314 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 06:32:19,366 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 06:32:19,367 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:32:19,373 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 06:32:19,388 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 06:32:19,389 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:32:22,952 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 06:32:23,097 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 06:32:23,118 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54567 [2019-12-27 06:32:23,119 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 06:32:23,122 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 100 transitions [2019-12-27 06:32:26,462 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 39550 states. [2019-12-27 06:32:26,464 INFO L276 IsEmpty]: Start isEmpty. Operand 39550 states. [2019-12-27 06:32:26,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 06:32:26,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:32:26,472 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:32:26,472 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:32:26,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:32:26,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1832018812, now seen corresponding path program 1 times [2019-12-27 06:32:26,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:32:26,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543727326] [2019-12-27 06:32:26,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:32:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:32:26,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:32:26,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543727326] [2019-12-27 06:32:26,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:32:26,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:32:26,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875749207] [2019-12-27 06:32:26,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:32:26,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:32:26,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:32:26,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:32:26,767 INFO L87 Difference]: Start difference. First operand 39550 states. Second operand 3 states. [2019-12-27 06:32:27,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:32:27,481 INFO L93 Difference]: Finished difference Result 36830 states and 156304 transitions. [2019-12-27 06:32:27,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:32:27,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 06:32:27,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:32:27,784 INFO L225 Difference]: With dead ends: 36830 [2019-12-27 06:32:27,785 INFO L226 Difference]: Without dead ends: 36102 [2019-12-27 06:32:27,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:32:29,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-27 06:32:30,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-27 06:32:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-27 06:32:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 153336 transitions. [2019-12-27 06:32:30,814 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 153336 transitions. Word has length 9 [2019-12-27 06:32:30,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:32:30,816 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 153336 transitions. [2019-12-27 06:32:30,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:32:30,816 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 153336 transitions. [2019-12-27 06:32:30,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:32:30,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:32:30,823 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:32:30,823 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:32:30,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:32:30,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1657144856, now seen corresponding path program 1 times [2019-12-27 06:32:30,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:32:30,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345598256] [2019-12-27 06:32:30,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:32:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:32:30,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:32:30,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345598256] [2019-12-27 06:32:30,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:32:30,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:32:30,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288459487] [2019-12-27 06:32:30,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:32:30,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:32:30,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:32:30,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:32:30,971 INFO L87 Difference]: Start difference. First operand 36102 states and 153336 transitions. Second operand 4 states. [2019-12-27 06:32:33,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:32:33,293 INFO L93 Difference]: Finished difference Result 56134 states and 230968 transitions. [2019-12-27 06:32:33,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:32:33,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 06:32:33,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:32:33,552 INFO L225 Difference]: With dead ends: 56134 [2019-12-27 06:32:33,552 INFO L226 Difference]: Without dead ends: 56106 [2019-12-27 06:32:33,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:32:33,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-27 06:32:35,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 50070. [2019-12-27 06:32:35,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50070 states. [2019-12-27 06:32:35,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50070 states to 50070 states and 208456 transitions. [2019-12-27 06:32:35,799 INFO L78 Accepts]: Start accepts. Automaton has 50070 states and 208456 transitions. Word has length 15 [2019-12-27 06:32:35,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:32:35,800 INFO L462 AbstractCegarLoop]: Abstraction has 50070 states and 208456 transitions. [2019-12-27 06:32:35,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:32:35,800 INFO L276 IsEmpty]: Start isEmpty. Operand 50070 states and 208456 transitions. [2019-12-27 06:32:35,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:32:35,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:32:35,803 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:32:35,804 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:32:35,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:32:35,804 INFO L82 PathProgramCache]: Analyzing trace with hash -311678002, now seen corresponding path program 1 times [2019-12-27 06:32:35,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:32:35,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898593178] [2019-12-27 06:32:35,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:32:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:32:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:32:35,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898593178] [2019-12-27 06:32:35,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:32:35,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:32:35,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294448616] [2019-12-27 06:32:35,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:32:35,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:32:35,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:32:35,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:32:35,863 INFO L87 Difference]: Start difference. First operand 50070 states and 208456 transitions. Second operand 3 states. [2019-12-27 06:32:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:32:36,033 INFO L93 Difference]: Finished difference Result 39280 states and 151115 transitions. [2019-12-27 06:32:36,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:32:36,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 06:32:36,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:32:36,150 INFO L225 Difference]: With dead ends: 39280 [2019-12-27 06:32:36,150 INFO L226 Difference]: Without dead ends: 39280 [2019-12-27 06:32:36,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:32:38,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39280 states. [2019-12-27 06:32:39,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39280 to 39280. [2019-12-27 06:32:39,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39280 states. [2019-12-27 06:32:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39280 states to 39280 states and 151115 transitions. [2019-12-27 06:32:39,701 INFO L78 Accepts]: Start accepts. Automaton has 39280 states and 151115 transitions. Word has length 15 [2019-12-27 06:32:39,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:32:39,701 INFO L462 AbstractCegarLoop]: Abstraction has 39280 states and 151115 transitions. [2019-12-27 06:32:39,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:32:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 39280 states and 151115 transitions. [2019-12-27 06:32:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:32:39,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:32:39,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:32:39,705 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:32:39,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:32:39,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1094107821, now seen corresponding path program 1 times [2019-12-27 06:32:39,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:32:39,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568035649] [2019-12-27 06:32:39,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:32:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:32:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:32:39,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568035649] [2019-12-27 06:32:39,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:32:39,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:32:39,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945034748] [2019-12-27 06:32:39,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:32:39,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:32:39,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:32:39,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:32:39,763 INFO L87 Difference]: Start difference. First operand 39280 states and 151115 transitions. Second operand 4 states. [2019-12-27 06:32:39,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:32:39,844 INFO L93 Difference]: Finished difference Result 16344 states and 52151 transitions. [2019-12-27 06:32:39,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:32:39,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:32:39,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:32:39,868 INFO L225 Difference]: With dead ends: 16344 [2019-12-27 06:32:39,869 INFO L226 Difference]: Without dead ends: 16344 [2019-12-27 06:32:39,869 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-27 06:32:39,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16344 states. [2019-12-27 06:32:40,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16344 to 16344. [2019-12-27 06:32:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16344 states. [2019-12-27 06:32:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16344 states to 16344 states and 52151 transitions. [2019-12-27 06:32:40,174 INFO L78 Accepts]: Start accepts. Automaton has 16344 states and 52151 transitions. Word has length 16 [2019-12-27 06:32:40,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:32:40,174 INFO L462 AbstractCegarLoop]: Abstraction has 16344 states and 52151 transitions. [2019-12-27 06:32:40,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:32:40,174 INFO L276 IsEmpty]: Start isEmpty. Operand 16344 states and 52151 transitions. [2019-12-27 06:32:40,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 06:32:40,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:32:40,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:32:40,177 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:32:40,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:32:40,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1111128464, now seen corresponding path program 1 times [2019-12-27 06:32:40,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:32:40,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146921657] [2019-12-27 06:32:40,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:32:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:32:40,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:32:40,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146921657] [2019-12-27 06:32:40,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:32:40,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:32:40,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478519304] [2019-12-27 06:32:40,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:32:40,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:32:40,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:32:40,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:32:40,235 INFO L87 Difference]: Start difference. First operand 16344 states and 52151 transitions. Second operand 5 states. [2019-12-27 06:32:40,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:32:40,280 INFO L93 Difference]: Finished difference Result 2799 states and 7236 transitions. [2019-12-27 06:32:40,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:32:40,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 06:32:40,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:32:40,284 INFO L225 Difference]: With dead ends: 2799 [2019-12-27 06:32:40,284 INFO L226 Difference]: Without dead ends: 2799 [2019-12-27 06:32:40,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:32:40,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2019-12-27 06:32:40,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2799. [2019-12-27 06:32:40,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2799 states. [2019-12-27 06:32:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2799 states and 7236 transitions. [2019-12-27 06:32:40,322 INFO L78 Accepts]: Start accepts. Automaton has 2799 states and 7236 transitions. Word has length 17 [2019-12-27 06:32:40,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:32:40,322 INFO L462 AbstractCegarLoop]: Abstraction has 2799 states and 7236 transitions. [2019-12-27 06:32:40,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:32:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2799 states and 7236 transitions. [2019-12-27 06:32:40,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 06:32:40,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:32:40,327 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-27 06:32:40,328 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:32:40,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:32:40,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1318629020, now seen corresponding path program 1 times [2019-12-27 06:32:40,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:32:40,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224945708] [2019-12-27 06:32:40,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:32:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:32:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:32:40,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224945708] [2019-12-27 06:32:40,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:32:40,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:32:40,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293254356] [2019-12-27 06:32:40,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:32:40,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:32:40,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:32:40,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:32:40,414 INFO L87 Difference]: Start difference. First operand 2799 states and 7236 transitions. Second operand 6 states. [2019-12-27 06:32:40,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:32:40,482 INFO L93 Difference]: Finished difference Result 1357 states and 3888 transitions. [2019-12-27 06:32:40,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:32:40,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 06:32:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:32:40,485 INFO L225 Difference]: With dead ends: 1357 [2019-12-27 06:32:40,486 INFO L226 Difference]: Without dead ends: 1357 [2019-12-27 06:32:40,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:32:40,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-27 06:32:40,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-27 06:32:40,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-27 06:32:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3488 transitions. [2019-12-27 06:32:40,507 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3488 transitions. Word has length 29 [2019-12-27 06:32:40,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:32:40,507 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3488 transitions. [2019-12-27 06:32:40,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:32:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3488 transitions. [2019-12-27 06:32:40,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:32:40,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:32:40,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:32:40,518 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:32:40,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:32:40,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1789262397, now seen corresponding path program 1 times [2019-12-27 06:32:40,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:32:40,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739711048] [2019-12-27 06:32:40,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:32:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:32:40,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:32:40,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739711048] [2019-12-27 06:32:40,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:32:40,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:32:40,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668065572] [2019-12-27 06:32:40,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:32:40,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:32:40,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:32:40,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:32:40,684 INFO L87 Difference]: Start difference. First operand 1217 states and 3488 transitions. Second operand 3 states. [2019-12-27 06:32:40,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:32:40,733 INFO L93 Difference]: Finished difference Result 1228 states and 3503 transitions. [2019-12-27 06:32:40,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:32:40,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 06:32:40,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:32:40,736 INFO L225 Difference]: With dead ends: 1228 [2019-12-27 06:32:40,736 INFO L226 Difference]: Without dead ends: 1228 [2019-12-27 06:32:40,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:32:40,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-27 06:32:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-27 06:32:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-27 06:32:40,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3497 transitions. [2019-12-27 06:32:40,756 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3497 transitions. Word has length 58 [2019-12-27 06:32:40,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:32:40,757 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3497 transitions. [2019-12-27 06:32:40,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:32:40,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3497 transitions. [2019-12-27 06:32:40,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:32:40,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:32:40,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:32:40,762 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:32:40,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:32:40,762 INFO L82 PathProgramCache]: Analyzing trace with hash -2131195958, now seen corresponding path program 1 times [2019-12-27 06:32:40,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:32:40,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156259303] [2019-12-27 06:32:40,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:32:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:32:40,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:32:40,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156259303] [2019-12-27 06:32:40,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:32:40,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:32:40,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516508017] [2019-12-27 06:32:40,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:32:40,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:32:40,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:32:40,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:32:40,891 INFO L87 Difference]: Start difference. First operand 1222 states and 3497 transitions. Second operand 5 states. [2019-12-27 06:32:41,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:32:41,371 INFO L93 Difference]: Finished difference Result 1763 states and 5019 transitions. [2019-12-27 06:32:41,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:32:41,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 06:32:41,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:32:41,374 INFO L225 Difference]: With dead ends: 1763 [2019-12-27 06:32:41,375 INFO L226 Difference]: Without dead ends: 1763 [2019-12-27 06:32:41,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-27 06:32:41,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2019-12-27 06:32:41,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1418. [2019-12-27 06:32:41,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-12-27 06:32:41,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 4073 transitions. [2019-12-27 06:32:41,398 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 4073 transitions. Word has length 58 [2019-12-27 06:32:41,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:32:41,399 INFO L462 AbstractCegarLoop]: Abstraction has 1418 states and 4073 transitions. [2019-12-27 06:32:41,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:32:41,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 4073 transitions. [2019-12-27 06:32:41,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:32:41,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:32:41,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:32:41,403 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:32:41,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:32:41,403 INFO L82 PathProgramCache]: Analyzing trace with hash 831744802, now seen corresponding path program 2 times [2019-12-27 06:32:41,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:32:41,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616991849] [2019-12-27 06:32:41,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:32:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:32:41,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:32:41,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616991849] [2019-12-27 06:32:41,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:32:41,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:32:41,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880546629] [2019-12-27 06:32:41,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:32:41,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:32:41,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:32:41,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:32:41,516 INFO L87 Difference]: Start difference. First operand 1418 states and 4073 transitions. Second operand 6 states. [2019-12-27 06:32:41,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:32:41,912 INFO L93 Difference]: Finished difference Result 2369 states and 6739 transitions. [2019-12-27 06:32:41,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:32:41,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 06:32:41,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:32:41,916 INFO L225 Difference]: With dead ends: 2369 [2019-12-27 06:32:41,916 INFO L226 Difference]: Without dead ends: 2369 [2019-12-27 06:32:41,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:32:41,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2019-12-27 06:32:41,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1502. [2019-12-27 06:32:41,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2019-12-27 06:32:41,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 4321 transitions. [2019-12-27 06:32:41,945 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 4321 transitions. Word has length 58 [2019-12-27 06:32:41,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:32:41,946 INFO L462 AbstractCegarLoop]: Abstraction has 1502 states and 4321 transitions. [2019-12-27 06:32:41,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:32:41,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 4321 transitions. [2019-12-27 06:32:41,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:32:41,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:32:41,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:32:41,950 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:32:41,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:32:41,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1828606006, now seen corresponding path program 3 times [2019-12-27 06:32:41,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:32:41,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186827747] [2019-12-27 06:32:41,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:32:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:32:42,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:32:42,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186827747] [2019-12-27 06:32:42,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:32:42,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:32:42,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918950440] [2019-12-27 06:32:42,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:32:42,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:32:42,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:32:42,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:32:42,079 INFO L87 Difference]: Start difference. First operand 1502 states and 4321 transitions. Second operand 6 states. [2019-12-27 06:32:42,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:32:42,447 INFO L93 Difference]: Finished difference Result 2376 states and 6757 transitions. [2019-12-27 06:32:42,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:32:42,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 06:32:42,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:32:42,455 INFO L225 Difference]: With dead ends: 2376 [2019-12-27 06:32:42,455 INFO L226 Difference]: Without dead ends: 2376 [2019-12-27 06:32:42,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:32:42,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-12-27 06:32:42,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1690. [2019-12-27 06:32:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2019-12-27 06:32:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 4865 transitions. [2019-12-27 06:32:42,478 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 4865 transitions. Word has length 58 [2019-12-27 06:32:42,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:32:42,478 INFO L462 AbstractCegarLoop]: Abstraction has 1690 states and 4865 transitions. [2019-12-27 06:32:42,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:32:42,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 4865 transitions. [2019-12-27 06:32:42,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:32:42,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:32:42,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:32:42,482 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:32:42,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:32:42,483 INFO L82 PathProgramCache]: Analyzing trace with hash 361631606, now seen corresponding path program 4 times [2019-12-27 06:32:42,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:32:42,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937120697] [2019-12-27 06:32:42,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:32:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:32:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:32:42,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937120697] [2019-12-27 06:32:42,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:32:42,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:32:42,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976292252] [2019-12-27 06:32:42,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:32:42,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:32:42,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:32:42,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:32:42,635 INFO L87 Difference]: Start difference. First operand 1690 states and 4865 transitions. Second operand 7 states. [2019-12-27 06:32:42,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:32:42,792 INFO L93 Difference]: Finished difference Result 3343 states and 8987 transitions. [2019-12-27 06:32:42,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 06:32:42,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-27 06:32:42,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:32:42,796 INFO L225 Difference]: With dead ends: 3343 [2019-12-27 06:32:42,796 INFO L226 Difference]: Without dead ends: 2351 [2019-12-27 06:32:42,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:32:42,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2351 states. [2019-12-27 06:32:42,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2351 to 1544. [2019-12-27 06:32:42,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-12-27 06:32:42,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 4371 transitions. [2019-12-27 06:32:42,820 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 4371 transitions. Word has length 58 [2019-12-27 06:32:42,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:32:42,820 INFO L462 AbstractCegarLoop]: Abstraction has 1544 states and 4371 transitions. [2019-12-27 06:32:42,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:32:42,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 4371 transitions. [2019-12-27 06:32:42,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:32:42,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:32:42,825 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:32:42,825 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:32:42,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:32:42,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2125865736, now seen corresponding path program 5 times [2019-12-27 06:32:42,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:32:42,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112953455] [2019-12-27 06:32:42,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:32:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:32:42,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:32:42,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112953455] [2019-12-27 06:32:42,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:32:42,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:32:42,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152011143] [2019-12-27 06:32:42,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:32:42,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:32:42,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:32:42,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:32:42,994 INFO L87 Difference]: Start difference. First operand 1544 states and 4371 transitions. Second operand 8 states. [2019-12-27 06:32:43,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:32:43,430 INFO L93 Difference]: Finished difference Result 2473 states and 6950 transitions. [2019-12-27 06:32:43,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:32:43,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-27 06:32:43,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:32:43,435 INFO L225 Difference]: With dead ends: 2473 [2019-12-27 06:32:43,435 INFO L226 Difference]: Without dead ends: 2473 [2019-12-27 06:32:43,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:32:43,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2019-12-27 06:32:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 1476. [2019-12-27 06:32:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1476 states. [2019-12-27 06:32:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 4177 transitions. [2019-12-27 06:32:43,457 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 4177 transitions. Word has length 58 [2019-12-27 06:32:43,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:32:43,457 INFO L462 AbstractCegarLoop]: Abstraction has 1476 states and 4177 transitions. [2019-12-27 06:32:43,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:32:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 4177 transitions. [2019-12-27 06:32:43,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:32:43,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:32:43,461 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:32:43,461 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:32:43,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:32:43,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2124049444, now seen corresponding path program 1 times [2019-12-27 06:32:43,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:32:43,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125660106] [2019-12-27 06:32:43,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:32:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:32:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:32:43,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125660106] [2019-12-27 06:32:43,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:32:43,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:32:43,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325809195] [2019-12-27 06:32:43,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:32:43,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:32:43,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:32:43,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:32:43,612 INFO L87 Difference]: Start difference. First operand 1476 states and 4177 transitions. Second operand 6 states. [2019-12-27 06:32:43,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:32:43,690 INFO L93 Difference]: Finished difference Result 2100 states and 5644 transitions. [2019-12-27 06:32:43,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:32:43,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-27 06:32:43,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:32:43,693 INFO L225 Difference]: With dead ends: 2100 [2019-12-27 06:32:43,693 INFO L226 Difference]: Without dead ends: 1248 [2019-12-27 06:32:43,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:32:43,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2019-12-27 06:32:43,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1088. [2019-12-27 06:32:43,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-12-27 06:32:43,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 2717 transitions. [2019-12-27 06:32:43,715 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 2717 transitions. Word has length 59 [2019-12-27 06:32:43,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:32:43,716 INFO L462 AbstractCegarLoop]: Abstraction has 1088 states and 2717 transitions. [2019-12-27 06:32:43,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:32:43,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 2717 transitions. [2019-12-27 06:32:43,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:32:43,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:32:43,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:32:43,720 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:32:43,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:32:43,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1600996218, now seen corresponding path program 2 times [2019-12-27 06:32:43,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:32:43,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321293129] [2019-12-27 06:32:43,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:32:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:32:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:32:43,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321293129] [2019-12-27 06:32:43,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:32:43,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:32:43,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237519456] [2019-12-27 06:32:43,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:32:43,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:32:43,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:32:43,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:32:43,838 INFO L87 Difference]: Start difference. First operand 1088 states and 2717 transitions. Second operand 3 states. [2019-12-27 06:32:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:32:43,881 INFO L93 Difference]: Finished difference Result 1087 states and 2715 transitions. [2019-12-27 06:32:43,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:32:43,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 06:32:43,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:32:43,883 INFO L225 Difference]: With dead ends: 1087 [2019-12-27 06:32:43,884 INFO L226 Difference]: Without dead ends: 1087 [2019-12-27 06:32:43,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:32:43,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2019-12-27 06:32:43,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 693. [2019-12-27 06:32:43,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2019-12-27 06:32:43,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1734 transitions. [2019-12-27 06:32:43,896 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1734 transitions. Word has length 59 [2019-12-27 06:32:43,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:32:43,896 INFO L462 AbstractCegarLoop]: Abstraction has 693 states and 1734 transitions. [2019-12-27 06:32:43,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:32:43,896 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1734 transitions. [2019-12-27 06:32:43,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:32:43,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:32:43,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:32:43,898 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:32:43,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:32:43,898 INFO L82 PathProgramCache]: Analyzing trace with hash -983573057, now seen corresponding path program 1 times [2019-12-27 06:32:43,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:32:43,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155053250] [2019-12-27 06:32:43,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:32:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:32:44,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-27 06:32:44,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155053250] [2019-12-27 06:32:44,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:32:44,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:32:44,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915437863] [2019-12-27 06:32:44,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:32:44,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:32:44,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:32:44,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:32:44,014 INFO L87 Difference]: Start difference. First operand 693 states and 1734 transitions. Second operand 6 states. [2019-12-27 06:32:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:32:44,328 INFO L93 Difference]: Finished difference Result 911 states and 2142 transitions. [2019-12-27 06:32:44,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:32:44,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-27 06:32:44,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:32:44,330 INFO L225 Difference]: With dead ends: 911 [2019-12-27 06:32:44,330 INFO L226 Difference]: Without dead ends: 289 [2019-12-27 06:32:44,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:32:44,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-27 06:32:44,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2019-12-27 06:32:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-12-27 06:32:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 536 transitions. [2019-12-27 06:32:44,339 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 536 transitions. Word has length 59 [2019-12-27 06:32:44,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:32:44,340 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 536 transitions. [2019-12-27 06:32:44,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:32:44,340 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 536 transitions. [2019-12-27 06:32:44,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:32:44,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:32:44,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:32:44,342 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:32:44,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:32:44,343 INFO L82 PathProgramCache]: Analyzing trace with hash 851087049, now seen corresponding path program 2 times [2019-12-27 06:32:44,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:32:44,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173744963] [2019-12-27 06:32:44,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:32:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:32:44,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:32:44,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173744963] [2019-12-27 06:32:44,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:32:44,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:32:44,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094717592] [2019-12-27 06:32:44,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:32:44,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:32:44,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:32:44,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:32:44,461 INFO L87 Difference]: Start difference. First operand 289 states and 536 transitions. Second operand 3 states. [2019-12-27 06:32:44,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:32:44,475 INFO L93 Difference]: Finished difference Result 268 states and 479 transitions. [2019-12-27 06:32:44,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:32:44,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 06:32:44,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:32:44,476 INFO L225 Difference]: With dead ends: 268 [2019-12-27 06:32:44,476 INFO L226 Difference]: Without dead ends: 268 [2019-12-27 06:32:44,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:32:44,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-12-27 06:32:44,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 236. [2019-12-27 06:32:44,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-27 06:32:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 419 transitions. [2019-12-27 06:32:44,481 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 419 transitions. Word has length 59 [2019-12-27 06:32:44,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:32:44,481 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 419 transitions. [2019-12-27 06:32:44,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:32:44,481 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 419 transitions. [2019-12-27 06:32:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:32:44,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:32:44,482 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] [2019-12-27 06:32:44,482 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:32:44,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:32:44,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1833326427, now seen corresponding path program 1 times [2019-12-27 06:32:44,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:32:44,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414975178] [2019-12-27 06:32:44,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:32:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:32:44,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:32:44,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414975178] [2019-12-27 06:32:44,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:32:44,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 06:32:44,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362084997] [2019-12-27 06:32:44,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 06:32:44,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:32:44,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 06:32:44,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:32:44,801 INFO L87 Difference]: Start difference. First operand 236 states and 419 transitions. Second operand 14 states. [2019-12-27 06:32:45,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:32:45,447 INFO L93 Difference]: Finished difference Result 393 states and 681 transitions. [2019-12-27 06:32:45,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 06:32:45,447 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-27 06:32:45,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:32:45,448 INFO L225 Difference]: With dead ends: 393 [2019-12-27 06:32:45,448 INFO L226 Difference]: Without dead ends: 362 [2019-12-27 06:32:45,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:32:45,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-12-27 06:32:45,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 344. [2019-12-27 06:32:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-27 06:32:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 604 transitions. [2019-12-27 06:32:45,453 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 604 transitions. Word has length 60 [2019-12-27 06:32:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:32:45,453 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 604 transitions. [2019-12-27 06:32:45,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 06:32:45,454 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 604 transitions. [2019-12-27 06:32:45,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:32:45,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:32:45,455 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] [2019-12-27 06:32:45,455 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:32:45,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:32:45,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1060183003, now seen corresponding path program 2 times [2019-12-27 06:32:45,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:32:45,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971647648] [2019-12-27 06:32:45,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:32:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:32:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:32:45,578 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:32:45,578 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:32:45,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$r_buff1_thd0~0_47) (= 0 v_~a~0_9) (= 0 v_~__unbuffered_p3_EAX~0_10) (= |v_#NULL.offset_7| 0) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$mem_tmp~0_11 0) (= v_~z$r_buff0_thd1~0_8 0) (= v_~z$r_buff1_thd1~0_8 0) (< 0 |v_#StackHeapBarrier_21|) (= 0 v_~z$r_buff1_thd4~0_16) (= v_~z$r_buff1_thd2~0_9 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~b~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~z$w_buff1~0_22) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1173~0.base_19|) (= 0 v_~z$flush_delayed~0_16) (= v_~z$w_buff0_used~0_105 0) (= 0 v_~z$w_buff1_used~0_62) (= v_~z$r_buff0_thd4~0_24 0) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1173~0.base_19| 1)) (= (select .cse0 |v_ULTIMATE.start_main_~#t1173~0.base_19|) 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1173~0.base_19| 4) |v_#length_29|) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= v_~z$r_buff0_thd0~0_80 0) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~z$w_buff0~0_25) (= v_~x~0_12 0) (= v_~main$tmp_guard1~0_12 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1173~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1173~0.base_19|) |v_ULTIMATE.start_main_~#t1173~0.offset_16| 0)) |v_#memory_int_25|) (= 0 |v_ULTIMATE.start_main_~#t1173~0.offset_16|) (= 0 v_~z$r_buff1_thd3~0_17) (= 0 v_~__unbuffered_p3_EBX~0_10) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t1176~0.base=|v_ULTIMATE.start_main_~#t1176~0.base_22|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_10|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1173~0.base=|v_ULTIMATE.start_main_~#t1173~0.base_19|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ~a~0=v_~a~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_62, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_~#t1175~0.offset=|v_ULTIMATE.start_main_~#t1175~0.offset_16|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_15|, ULTIMATE.start_main_~#t1174~0.offset=|v_ULTIMATE.start_main_~#t1174~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ULTIMATE.start_main_~#t1175~0.base=|v_ULTIMATE.start_main_~#t1175~0.base_21|, ~x~0=v_~x~0_12, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_13|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~z$w_buff1~0=v_~z$w_buff1~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_~#t1173~0.offset=|v_ULTIMATE.start_main_~#t1173~0.offset_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_~#t1174~0.base=|v_ULTIMATE.start_main_~#t1174~0.base_22|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_47, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_8|, ~y~0=v_~y~0_9, ULTIMATE.start_main_~#t1176~0.offset=|v_ULTIMATE.start_main_~#t1176~0.offset_17|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~b~0=v_~b~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1176~0.base, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_~#t1173~0.base, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_~#t1175~0.offset, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1174~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1175~0.base, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1173~0.offset, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1174~0.base, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ULTIMATE.start_main_~#t1176~0.offset, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:32:45,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L833-1-->L835: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1174~0.offset_11|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1174~0.base_13|)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1174~0.base_13| 1)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1174~0.base_13|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1174~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1174~0.base_13|) |v_ULTIMATE.start_main_~#t1174~0.offset_11| 1)) |v_#memory_int_19|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1174~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1174~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1174~0.offset=|v_ULTIMATE.start_main_~#t1174~0.offset_11|, ULTIMATE.start_main_~#t1174~0.base=|v_ULTIMATE.start_main_~#t1174~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1174~0.offset, ULTIMATE.start_main_~#t1174~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 06:32:45,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L835-1-->L837: Formula: (and (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1175~0.base_12| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1175~0.base_12|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1175~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1175~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t1175~0.base_12| 0)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1175~0.base_12| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1175~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1175~0.base_12|) |v_ULTIMATE.start_main_~#t1175~0.offset_10| 2)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1175~0.base=|v_ULTIMATE.start_main_~#t1175~0.base_12|, ULTIMATE.start_main_~#t1175~0.offset=|v_ULTIMATE.start_main_~#t1175~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1175~0.base, ULTIMATE.start_main_~#t1175~0.offset] because there is no mapped edge [2019-12-27 06:32:45,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L837-1-->L839: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1176~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t1176~0.offset_10|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1176~0.base_12| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1176~0.base_12| 4)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1176~0.base_12|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1176~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1176~0.base_12|) |v_ULTIMATE.start_main_~#t1176~0.offset_10| 3)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t1176~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1176~0.base=|v_ULTIMATE.start_main_~#t1176~0.base_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ULTIMATE.start_main_~#t1176~0.offset=|v_ULTIMATE.start_main_~#t1176~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1176~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1176~0.offset] because there is no mapped edge [2019-12-27 06:32:45,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_4) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_15 1) (= v_~z$r_buff0_thd4~0_16 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff0_thd3~0_15 v_~z$r_buff1_thd3~0_11) (= v_~z$r_buff0_thd0~0_46 v_~z$r_buff1_thd0~0_26)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_10, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_26, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 06:32:45,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 1 v_~b~0_7) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~x~0_7) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_7, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_7, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 06:32:45,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= v_~__unbuffered_p1_EAX~0_6 v_~y~0_5) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 2 v_~x~0_8) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, ~y~0=v_~y~0_5} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y~0=v_~y~0_5, ~x~0=v_~x~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 06:32:45,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In682433661 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In682433661 256)))) (or (and (= ~z$w_buff0_used~0_In682433661 |P3Thread1of1ForFork3_#t~ite11_Out682433661|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out682433661| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In682433661, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In682433661} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In682433661, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In682433661, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out682433661|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 06:32:45,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In462121995 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In462121995 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In462121995 |P2Thread1of1ForFork2_#t~ite3_Out462121995|)) (and (= ~z$w_buff1~0_In462121995 |P2Thread1of1ForFork2_#t~ite3_Out462121995|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In462121995, ~z$w_buff1_used~0=~z$w_buff1_used~0_In462121995, ~z$w_buff1~0=~z$w_buff1~0_In462121995, ~z~0=~z~0_In462121995} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out462121995|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In462121995, ~z$w_buff1_used~0=~z$w_buff1_used~0_In462121995, ~z$w_buff1~0=~z$w_buff1~0_In462121995, ~z~0=~z~0_In462121995} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 06:32:45,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1733075480 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1733075480 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In1733075480 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1733075480 256) 0))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite12_Out1733075480|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1733075480 |P3Thread1of1ForFork3_#t~ite12_Out1733075480|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1733075480, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1733075480, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1733075480, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1733075480} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1733075480, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1733075480, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1733075480, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1733075480, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out1733075480|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 06:32:45,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In1981925792 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1981925792 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out1981925792 ~z$r_buff0_thd4~0_In1981925792)) (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out1981925792 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1981925792, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1981925792} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1981925792, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1981925792, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out1981925792|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 06:32:45,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-1683592916 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1683592916 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1683592916 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-1683592916 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In-1683592916 |P3Thread1of1ForFork3_#t~ite14_Out-1683592916|) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork3_#t~ite14_Out-1683592916|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1683592916, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1683592916, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1683592916, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1683592916} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1683592916, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1683592916, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-1683592916|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1683592916, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1683592916} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 06:32:45,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_11) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_11, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 06:32:45,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 06:32:45,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In355433172 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In355433172 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite5_Out355433172| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In355433172 |P2Thread1of1ForFork2_#t~ite5_Out355433172|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In355433172, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In355433172} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out355433172|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In355433172, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In355433172} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 06:32:45,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In2061681109 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In2061681109 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In2061681109 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In2061681109 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite6_Out2061681109| ~z$w_buff1_used~0_In2061681109) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite6_Out2061681109| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2061681109, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2061681109, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2061681109, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2061681109} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out2061681109|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2061681109, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2061681109, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2061681109, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2061681109} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 06:32:45,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1382575051 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1382575051 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out1382575051| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out1382575051| ~z$r_buff0_thd3~0_In1382575051)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1382575051, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1382575051} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1382575051, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1382575051, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1382575051|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 06:32:45,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In514262121 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In514262121 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In514262121 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In514262121 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite8_Out514262121| ~z$r_buff1_thd3~0_In514262121) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite8_Out514262121| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In514262121, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In514262121, ~z$w_buff1_used~0=~z$w_buff1_used~0_In514262121, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In514262121} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In514262121, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In514262121, ~z$w_buff1_used~0=~z$w_buff1_used~0_In514262121, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In514262121, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out514262121|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:32:45,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_~z$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork2_#t~ite8_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:32:45,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-27 06:32:45,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1039312431 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1039312431 256)))) (or (and (= ~z~0_In1039312431 |ULTIMATE.start_main_#t~ite19_Out1039312431|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In1039312431 |ULTIMATE.start_main_#t~ite19_Out1039312431|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1039312431, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1039312431, ~z$w_buff1~0=~z$w_buff1~0_In1039312431, ~z~0=~z~0_In1039312431} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1039312431|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1039312431, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1039312431, ~z$w_buff1~0=~z$w_buff1~0_In1039312431, ~z~0=~z~0_In1039312431} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 06:32:45,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_16 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_16, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 06:32:45,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In570936844 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In570936844 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out570936844| ~z$w_buff0_used~0_In570936844) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out570936844|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In570936844, ~z$w_buff0_used~0=~z$w_buff0_used~0_In570936844} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In570936844, ~z$w_buff0_used~0=~z$w_buff0_used~0_In570936844, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out570936844|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 06:32:45,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1042964185 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1042964185 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1042964185 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1042964185 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-1042964185|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-1042964185 |ULTIMATE.start_main_#t~ite22_Out-1042964185|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1042964185, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1042964185, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1042964185, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1042964185} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1042964185, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1042964185, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1042964185, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1042964185, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1042964185|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 06:32:45,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-201591821 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-201591821 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In-201591821 |ULTIMATE.start_main_#t~ite23_Out-201591821|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite23_Out-201591821|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-201591821, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-201591821} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-201591821, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-201591821, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-201591821|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 06:32:45,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-968701028 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-968701028 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-968701028 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-968701028 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out-968701028| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite24_Out-968701028| ~z$r_buff1_thd0~0_In-968701028) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-968701028, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-968701028, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-968701028, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-968701028} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-968701028, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-968701028, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-968701028, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-968701028|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-968701028} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 06:32:45,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L860-->L860-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1551318244 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1551318244 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd0~0_In-1551318244 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-1551318244 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1551318244 256) 0)))) (= |ULTIMATE.start_main_#t~ite39_Out-1551318244| ~z$w_buff1_used~0_In-1551318244) (= |ULTIMATE.start_main_#t~ite39_Out-1551318244| |ULTIMATE.start_main_#t~ite40_Out-1551318244|)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1551318244| ~z$w_buff1_used~0_In-1551318244) (not .cse0) (= |ULTIMATE.start_main_#t~ite39_In-1551318244| |ULTIMATE.start_main_#t~ite39_Out-1551318244|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1551318244, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1551318244, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-1551318244|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1551318244, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1551318244, ~weak$$choice2~0=~weak$$choice2~0_In-1551318244} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1551318244, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1551318244|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1551318244|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1551318244, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1551318244, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1551318244, ~weak$$choice2~0=~weak$$choice2~0_In-1551318244} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:32:45,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_59 v_~z$r_buff0_thd0~0_60) (not (= (mod v_~weak$$choice2~0_18 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_18, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:32:45,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L862-->L862-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-714119794 256))) (.cse5 (= |ULTIMATE.start_main_#t~ite45_Out-714119794| |ULTIMATE.start_main_#t~ite46_Out-714119794|)) (.cse3 (= (mod ~z$w_buff0_used~0_In-714119794 256) 0)) (.cse4 (= (mod ~z$r_buff1_thd0~0_In-714119794 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-714119794 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-714119794 256) 0))) (or (and (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-714119794| ~z$r_buff1_thd0~0_In-714119794) (= |ULTIMATE.start_main_#t~ite45_In-714119794| |ULTIMATE.start_main_#t~ite45_Out-714119794|)) (and (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2)) .cse0 .cse5 (= |ULTIMATE.start_main_#t~ite45_Out-714119794| ~z$r_buff1_thd0~0_In-714119794))) (= |ULTIMATE.start_main_#t~ite44_In-714119794| |ULTIMATE.start_main_#t~ite44_Out-714119794|)) (let ((.cse6 (not .cse2))) (and .cse0 .cse5 (not .cse3) (or (not .cse4) .cse6) (= 0 |ULTIMATE.start_main_#t~ite44_Out-714119794|) (or .cse6 (not .cse1)) (= |ULTIMATE.start_main_#t~ite45_Out-714119794| |ULTIMATE.start_main_#t~ite44_Out-714119794|))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-714119794, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-714119794, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-714119794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-714119794, ~weak$$choice2~0=~weak$$choice2~0_In-714119794, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-714119794|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-714119794|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-714119794, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-714119794, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-714119794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-714119794, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-714119794|, ~weak$$choice2~0=~weak$$choice2~0_In-714119794, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-714119794|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-714119794|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:32:45,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L864-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (not (= 0 (mod v_~z$flush_delayed~0_12 256))) (= v_~z~0_23 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:32:45,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:32:45,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:32:45 BasicIcfg [2019-12-27 06:32:45,701 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:32:45,703 INFO L168 Benchmark]: Toolchain (without parser) took 28465.00 ms. Allocated memory was 136.8 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 100.1 MB in the beginning and 721.5 MB in the end (delta: -621.3 MB). Peak memory consumption was 770.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:32:45,704 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 06:32:45,705 INFO L168 Benchmark]: CACSL2BoogieTranslator took 776.06 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.7 MB in the beginning and 151.7 MB in the end (delta: -52.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:32:45,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.03 ms. Allocated memory is still 200.8 MB. Free memory was 151.7 MB in the beginning and 149.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:32:45,706 INFO L168 Benchmark]: Boogie Preprocessor took 44.31 ms. Allocated memory is still 200.8 MB. Free memory was 149.0 MB in the beginning and 146.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:32:45,707 INFO L168 Benchmark]: RCFGBuilder took 834.82 ms. Allocated memory is still 200.8 MB. Free memory was 146.2 MB in the beginning and 97.0 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:32:45,708 INFO L168 Benchmark]: TraceAbstraction took 26727.41 ms. Allocated memory was 200.8 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 96.3 MB in the beginning and 721.5 MB in the end (delta: -625.1 MB). Peak memory consumption was 702.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:32:45,711 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.20 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 776.06 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.7 MB in the beginning and 151.7 MB in the end (delta: -52.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.03 ms. Allocated memory is still 200.8 MB. Free memory was 151.7 MB in the beginning and 149.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.31 ms. Allocated memory is still 200.8 MB. Free memory was 149.0 MB in the beginning and 146.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 834.82 ms. Allocated memory is still 200.8 MB. Free memory was 146.2 MB in the beginning and 97.0 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26727.41 ms. Allocated memory was 200.8 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 96.3 MB in the beginning and 721.5 MB in the end (delta: -625.1 MB). Peak memory consumption was 702.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 181 ProgramPointsBefore, 93 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4801 VarBasedMoverChecksPositive, 172 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54567 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1173, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1174, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1175, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1176, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 4 z$w_buff1 = z$w_buff0 [L789] 4 z$w_buff0 = 2 [L790] 4 z$w_buff1_used = z$w_buff0_used [L791] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 1 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L774] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 z$flush_delayed = weak$$choice2 [L855] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 26.4s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1893 SDtfs, 1966 SDslu, 4218 SDs, 0 SdLazy, 1837 SolverSat, 129 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 34 SyntacticMatches, 12 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50070occurred 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: 9.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 10488 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 805 NumberOfCodeBlocks, 805 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 728 ConstructedInterpolants, 0 QuantifiedInterpolants, 145113 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...