/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/mix002_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:56:57,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:56:57,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:56:57,924 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:56:57,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:56:57,927 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:56:57,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:56:57,932 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:56:57,934 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:56:57,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:56:57,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:56:57,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:56:57,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:56:57,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:56:57,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:56:57,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:56:57,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:56:57,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:56:57,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:56:57,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:56:57,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:56:57,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:56:57,948 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:56:57,949 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:56:57,951 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:56:57,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:56:57,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:56:57,953 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:56:57,954 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:56:57,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:56:57,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:56:57,956 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:56:57,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:56:57,957 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:56:57,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:56:57,958 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:56:57,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:56:57,959 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:56:57,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:56:57,960 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:56:57,961 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:56:57,962 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 19:56:57,976 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:56:57,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:56:57,977 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:56:57,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:56:57,978 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:56:57,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:56:57,978 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:56:57,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:56:57,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:56:57,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:56:57,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:56:57,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:56:57,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:56:57,980 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:56:57,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:56:57,980 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:56:57,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:56:57,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:56:57,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:56:57,981 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:56:57,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:56:57,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:56:57,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:56:57,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:56:57,982 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:56:57,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:56:57,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:56:57,983 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 19:56:57,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:56:57,983 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:56:58,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:56:58,292 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:56:58,296 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:56:58,297 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:56:58,298 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:56:58,300 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002_power.oepc.i [2019-12-18 19:56:58,376 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71cd2984b/6c37e21fbbaf4f7eb076269a332d86d9/FLAG4db77e00a [2019-12-18 19:56:58,930 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:56:58,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002_power.oepc.i [2019-12-18 19:56:58,946 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71cd2984b/6c37e21fbbaf4f7eb076269a332d86d9/FLAG4db77e00a [2019-12-18 19:56:59,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71cd2984b/6c37e21fbbaf4f7eb076269a332d86d9 [2019-12-18 19:56:59,197 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:56:59,199 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:56:59,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:56:59,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:56:59,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:56:59,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:56:59" (1/1) ... [2019-12-18 19:56:59,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65a8b86a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:56:59, skipping insertion in model container [2019-12-18 19:56:59,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:56:59" (1/1) ... [2019-12-18 19:56:59,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:56:59,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:56:59,862 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:56:59,879 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:56:59,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:57:00,043 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:57:00,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:57:00 WrapperNode [2019-12-18 19:57:00,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:57:00,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:57:00,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:57:00,044 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:57:00,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:57:00" (1/1) ... [2019-12-18 19:57:00,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:57:00" (1/1) ... [2019-12-18 19:57:00,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:57:00,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:57:00,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:57:00,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:57:00,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:57:00" (1/1) ... [2019-12-18 19:57:00,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:57:00" (1/1) ... [2019-12-18 19:57:00,132 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:57:00" (1/1) ... [2019-12-18 19:57:00,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:57:00" (1/1) ... [2019-12-18 19:57:00,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:57:00" (1/1) ... [2019-12-18 19:57:00,147 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:57:00" (1/1) ... [2019-12-18 19:57:00,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:57:00" (1/1) ... [2019-12-18 19:57:00,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:57:00,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:57:00,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:57:00,157 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:57:00,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:57:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:57:00,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:57:00,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 19:57:00,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:57:00,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:57:00,222 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 19:57:00,222 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 19:57:00,223 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 19:57:00,223 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 19:57:00,223 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 19:57:00,223 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 19:57:00,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 19:57:00,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:57:00,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:57:00,226 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 19:57:01,003 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:57:01,003 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 19:57:01,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:57:01 BoogieIcfgContainer [2019-12-18 19:57:01,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:57:01,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:57:01,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:57:01,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:57:01,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:56:59" (1/3) ... [2019-12-18 19:57:01,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68627f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:57:01, skipping insertion in model container [2019-12-18 19:57:01,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:57:00" (2/3) ... [2019-12-18 19:57:01,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68627f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:57:01, skipping insertion in model container [2019-12-18 19:57:01,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:57:01" (3/3) ... [2019-12-18 19:57:01,018 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_power.oepc.i [2019-12-18 19:57:01,030 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:57:01,030 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:57:01,045 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 19:57:01,046 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:57:01,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,106 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,107 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,107 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,108 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,108 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,133 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,133 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,140 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,140 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,166 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,166 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,172 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,173 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,180 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,181 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,181 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:57:01,196 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 19:57:01,217 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:57:01,217 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:57:01,217 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:57:01,217 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:57:01,218 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:57:01,218 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:57:01,218 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:57:01,218 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:57:01,236 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-18 19:57:01,238 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-18 19:57:01,322 INFO L126 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-18 19:57:01,322 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:57:01,339 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 19:57:01,371 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-18 19:57:01,419 INFO L126 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-18 19:57:01,420 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:57:01,430 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 19:57:01,455 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 19:57:01,457 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 19:57:04,958 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 19:57:05,110 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 19:57:05,243 INFO L206 etLargeBlockEncoding]: Checked pairs total: 96061 [2019-12-18 19:57:05,243 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-18 19:57:05,247 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 106 transitions [2019-12-18 19:57:25,153 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123272 states. [2019-12-18 19:57:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand 123272 states. [2019-12-18 19:57:25,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:57:25,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:57:25,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:57:25,165 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:57:25,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:57:25,170 INFO L82 PathProgramCache]: Analyzing trace with hash 920016, now seen corresponding path program 1 times [2019-12-18 19:57:25,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:57:25,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214792351] [2019-12-18 19:57:25,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:57:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:57:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:57:25,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214792351] [2019-12-18 19:57:25,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:57:25,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:57:25,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445485579] [2019-12-18 19:57:25,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:57:25,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:57:25,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:57:25,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:57:25,398 INFO L87 Difference]: Start difference. First operand 123272 states. Second operand 3 states. [2019-12-18 19:57:26,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:57:26,657 INFO L93 Difference]: Finished difference Result 122274 states and 522952 transitions. [2019-12-18 19:57:26,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:57:26,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:57:26,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:57:30,647 INFO L225 Difference]: With dead ends: 122274 [2019-12-18 19:57:30,647 INFO L226 Difference]: Without dead ends: 115176 [2019-12-18 19:57:30,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:57:35,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115176 states. [2019-12-18 19:57:38,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115176 to 115176. [2019-12-18 19:57:38,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115176 states. [2019-12-18 19:57:38,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115176 states to 115176 states and 491986 transitions. [2019-12-18 19:57:38,915 INFO L78 Accepts]: Start accepts. Automaton has 115176 states and 491986 transitions. Word has length 3 [2019-12-18 19:57:38,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:57:38,916 INFO L462 AbstractCegarLoop]: Abstraction has 115176 states and 491986 transitions. [2019-12-18 19:57:38,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:57:38,916 INFO L276 IsEmpty]: Start isEmpty. Operand 115176 states and 491986 transitions. [2019-12-18 19:57:38,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 19:57:38,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:57:38,921 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:57:38,921 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:57:38,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:57:38,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1323565433, now seen corresponding path program 1 times [2019-12-18 19:57:38,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:57:38,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950507083] [2019-12-18 19:57:38,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:57:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:57:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:57:39,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950507083] [2019-12-18 19:57:39,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:57:39,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:57:39,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519471497] [2019-12-18 19:57:39,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:57:39,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:57:39,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:57:39,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:57:39,055 INFO L87 Difference]: Start difference. First operand 115176 states and 491986 transitions. Second operand 4 states. [2019-12-18 19:57:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:57:44,249 INFO L93 Difference]: Finished difference Result 183662 states and 752302 transitions. [2019-12-18 19:57:44,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:57:44,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 19:57:44,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:57:44,870 INFO L225 Difference]: With dead ends: 183662 [2019-12-18 19:57:44,870 INFO L226 Difference]: Without dead ends: 183613 [2019-12-18 19:57:44,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:57:51,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183613 states. [2019-12-18 19:57:59,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183613 to 166753. [2019-12-18 19:57:59,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166753 states. [2019-12-18 19:58:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166753 states to 166753 states and 692266 transitions. [2019-12-18 19:58:00,270 INFO L78 Accepts]: Start accepts. Automaton has 166753 states and 692266 transitions. Word has length 11 [2019-12-18 19:58:00,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:00,271 INFO L462 AbstractCegarLoop]: Abstraction has 166753 states and 692266 transitions. [2019-12-18 19:58:00,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:58:00,271 INFO L276 IsEmpty]: Start isEmpty. Operand 166753 states and 692266 transitions. [2019-12-18 19:58:00,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:58:00,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:00,276 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:00,277 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:00,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:00,277 INFO L82 PathProgramCache]: Analyzing trace with hash -447069332, now seen corresponding path program 1 times [2019-12-18 19:58:00,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:00,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97838078] [2019-12-18 19:58:00,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:00,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:00,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97838078] [2019-12-18 19:58:00,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:00,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:58:00,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076030680] [2019-12-18 19:58:00,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:58:00,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:00,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:58:00,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:58:00,332 INFO L87 Difference]: Start difference. First operand 166753 states and 692266 transitions. Second operand 3 states. [2019-12-18 19:58:00,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:00,471 INFO L93 Difference]: Finished difference Result 35653 states and 116140 transitions. [2019-12-18 19:58:00,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:58:00,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 19:58:00,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:00,532 INFO L225 Difference]: With dead ends: 35653 [2019-12-18 19:58:00,533 INFO L226 Difference]: Without dead ends: 35653 [2019-12-18 19:58:00,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:58:00,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35653 states. [2019-12-18 19:58:01,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35653 to 35653. [2019-12-18 19:58:01,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35653 states. [2019-12-18 19:58:01,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35653 states to 35653 states and 116140 transitions. [2019-12-18 19:58:01,269 INFO L78 Accepts]: Start accepts. Automaton has 35653 states and 116140 transitions. Word has length 13 [2019-12-18 19:58:01,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:01,270 INFO L462 AbstractCegarLoop]: Abstraction has 35653 states and 116140 transitions. [2019-12-18 19:58:01,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:58:01,270 INFO L276 IsEmpty]: Start isEmpty. Operand 35653 states and 116140 transitions. [2019-12-18 19:58:01,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 19:58:01,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:01,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:01,272 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:01,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:01,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1594630647, now seen corresponding path program 1 times [2019-12-18 19:58:01,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:01,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758086020] [2019-12-18 19:58:01,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:01,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758086020] [2019-12-18 19:58:01,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:01,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:58:01,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710509910] [2019-12-18 19:58:01,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:58:01,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:01,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:58:01,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:58:01,394 INFO L87 Difference]: Start difference. First operand 35653 states and 116140 transitions. Second operand 5 states. [2019-12-18 19:58:04,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:04,208 INFO L93 Difference]: Finished difference Result 49040 states and 157904 transitions. [2019-12-18 19:58:04,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:58:04,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 19:58:04,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:04,291 INFO L225 Difference]: With dead ends: 49040 [2019-12-18 19:58:04,292 INFO L226 Difference]: Without dead ends: 49040 [2019-12-18 19:58:04,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:58:04,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49040 states. [2019-12-18 19:58:05,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49040 to 42019. [2019-12-18 19:58:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42019 states. [2019-12-18 19:58:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42019 states to 42019 states and 136433 transitions. [2019-12-18 19:58:05,133 INFO L78 Accepts]: Start accepts. Automaton has 42019 states and 136433 transitions. Word has length 16 [2019-12-18 19:58:05,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:05,134 INFO L462 AbstractCegarLoop]: Abstraction has 42019 states and 136433 transitions. [2019-12-18 19:58:05,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:58:05,134 INFO L276 IsEmpty]: Start isEmpty. Operand 42019 states and 136433 transitions. [2019-12-18 19:58:05,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:58:05,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:05,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:05,145 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:05,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:05,145 INFO L82 PathProgramCache]: Analyzing trace with hash -2124632115, now seen corresponding path program 1 times [2019-12-18 19:58:05,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:05,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70134099] [2019-12-18 19:58:05,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:05,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70134099] [2019-12-18 19:58:05,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:05,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:58:05,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665914033] [2019-12-18 19:58:05,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:58:05,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:05,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:58:05,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:58:05,231 INFO L87 Difference]: Start difference. First operand 42019 states and 136433 transitions. Second operand 6 states. [2019-12-18 19:58:06,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:06,161 INFO L93 Difference]: Finished difference Result 63228 states and 200109 transitions. [2019-12-18 19:58:06,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:58:06,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 19:58:06,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:06,279 INFO L225 Difference]: With dead ends: 63228 [2019-12-18 19:58:06,280 INFO L226 Difference]: Without dead ends: 63221 [2019-12-18 19:58:06,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:58:06,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63221 states. [2019-12-18 19:58:07,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63221 to 41773. [2019-12-18 19:58:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41773 states. [2019-12-18 19:58:07,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41773 states to 41773 states and 134916 transitions. [2019-12-18 19:58:07,563 INFO L78 Accepts]: Start accepts. Automaton has 41773 states and 134916 transitions. Word has length 22 [2019-12-18 19:58:07,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:07,563 INFO L462 AbstractCegarLoop]: Abstraction has 41773 states and 134916 transitions. [2019-12-18 19:58:07,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:58:07,563 INFO L276 IsEmpty]: Start isEmpty. Operand 41773 states and 134916 transitions. [2019-12-18 19:58:07,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:58:07,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:07,578 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:07,578 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:07,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:07,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1985611191, now seen corresponding path program 1 times [2019-12-18 19:58:07,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:07,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575380249] [2019-12-18 19:58:07,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:07,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-18 19:58:07,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575380249] [2019-12-18 19:58:07,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:07,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:58:07,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782737234] [2019-12-18 19:58:07,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:58:07,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:07,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:58:07,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:58:07,636 INFO L87 Difference]: Start difference. First operand 41773 states and 134916 transitions. Second operand 4 states. [2019-12-18 19:58:07,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:07,702 INFO L93 Difference]: Finished difference Result 16487 states and 50228 transitions. [2019-12-18 19:58:07,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:58:07,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 19:58:07,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:07,725 INFO L225 Difference]: With dead ends: 16487 [2019-12-18 19:58:07,725 INFO L226 Difference]: Without dead ends: 16487 [2019-12-18 19:58:07,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:58:07,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16487 states. [2019-12-18 19:58:07,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16487 to 16124. [2019-12-18 19:58:07,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16124 states. [2019-12-18 19:58:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16124 states to 16124 states and 49192 transitions. [2019-12-18 19:58:07,980 INFO L78 Accepts]: Start accepts. Automaton has 16124 states and 49192 transitions. Word has length 25 [2019-12-18 19:58:07,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:07,980 INFO L462 AbstractCegarLoop]: Abstraction has 16124 states and 49192 transitions. [2019-12-18 19:58:07,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:58:07,980 INFO L276 IsEmpty]: Start isEmpty. Operand 16124 states and 49192 transitions. [2019-12-18 19:58:07,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:58:07,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:07,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:07,992 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:07,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:07,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1670307795, now seen corresponding path program 1 times [2019-12-18 19:58:07,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:07,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080489568] [2019-12-18 19:58:07,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:08,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:08,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080489568] [2019-12-18 19:58:08,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:08,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:58:08,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931961179] [2019-12-18 19:58:08,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:58:08,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:08,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:58:08,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:58:08,078 INFO L87 Difference]: Start difference. First operand 16124 states and 49192 transitions. Second operand 3 states. [2019-12-18 19:58:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:08,180 INFO L93 Difference]: Finished difference Result 23364 states and 69824 transitions. [2019-12-18 19:58:08,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:58:08,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 19:58:08,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:08,214 INFO L225 Difference]: With dead ends: 23364 [2019-12-18 19:58:08,214 INFO L226 Difference]: Without dead ends: 23364 [2019-12-18 19:58:08,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:58:08,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23364 states. [2019-12-18 19:58:08,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23364 to 17891. [2019-12-18 19:58:08,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17891 states. [2019-12-18 19:58:08,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17891 states to 17891 states and 54042 transitions. [2019-12-18 19:58:08,522 INFO L78 Accepts]: Start accepts. Automaton has 17891 states and 54042 transitions. Word has length 27 [2019-12-18 19:58:08,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:08,523 INFO L462 AbstractCegarLoop]: Abstraction has 17891 states and 54042 transitions. [2019-12-18 19:58:08,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:58:08,523 INFO L276 IsEmpty]: Start isEmpty. Operand 17891 states and 54042 transitions. [2019-12-18 19:58:08,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:58:08,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:08,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:08,535 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:08,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:08,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1181786131, now seen corresponding path program 1 times [2019-12-18 19:58:08,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:08,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061908598] [2019-12-18 19:58:08,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:08,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:08,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061908598] [2019-12-18 19:58:08,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:08,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:58:08,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307283055] [2019-12-18 19:58:08,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:58:08,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:08,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:58:08,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:58:08,620 INFO L87 Difference]: Start difference. First operand 17891 states and 54042 transitions. Second operand 6 states. [2019-12-18 19:58:09,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:09,120 INFO L93 Difference]: Finished difference Result 25058 states and 73821 transitions. [2019-12-18 19:58:09,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 19:58:09,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 19:58:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:09,155 INFO L225 Difference]: With dead ends: 25058 [2019-12-18 19:58:09,155 INFO L226 Difference]: Without dead ends: 25058 [2019-12-18 19:58:09,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:58:09,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25058 states. [2019-12-18 19:58:09,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25058 to 20577. [2019-12-18 19:58:09,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20577 states. [2019-12-18 19:58:09,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20577 states to 20577 states and 61791 transitions. [2019-12-18 19:58:09,668 INFO L78 Accepts]: Start accepts. Automaton has 20577 states and 61791 transitions. Word has length 27 [2019-12-18 19:58:09,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:09,668 INFO L462 AbstractCegarLoop]: Abstraction has 20577 states and 61791 transitions. [2019-12-18 19:58:09,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:58:09,669 INFO L276 IsEmpty]: Start isEmpty. Operand 20577 states and 61791 transitions. [2019-12-18 19:58:09,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 19:58:09,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:09,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:09,690 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:09,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:09,691 INFO L82 PathProgramCache]: Analyzing trace with hash -2129802289, now seen corresponding path program 1 times [2019-12-18 19:58:09,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:09,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599988224] [2019-12-18 19:58:09,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:09,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599988224] [2019-12-18 19:58:09,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:09,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:58:09,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938034835] [2019-12-18 19:58:09,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:58:09,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:09,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:58:09,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:58:09,794 INFO L87 Difference]: Start difference. First operand 20577 states and 61791 transitions. Second operand 7 states. [2019-12-18 19:58:10,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:10,953 INFO L93 Difference]: Finished difference Result 27892 states and 81805 transitions. [2019-12-18 19:58:10,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 19:58:10,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 19:58:10,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:10,995 INFO L225 Difference]: With dead ends: 27892 [2019-12-18 19:58:10,995 INFO L226 Difference]: Without dead ends: 27892 [2019-12-18 19:58:10,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 19:58:11,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27892 states. [2019-12-18 19:58:11,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27892 to 18703. [2019-12-18 19:58:11,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18703 states. [2019-12-18 19:58:11,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18703 states to 18703 states and 56394 transitions. [2019-12-18 19:58:11,347 INFO L78 Accepts]: Start accepts. Automaton has 18703 states and 56394 transitions. Word has length 33 [2019-12-18 19:58:11,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:11,348 INFO L462 AbstractCegarLoop]: Abstraction has 18703 states and 56394 transitions. [2019-12-18 19:58:11,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:58:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 18703 states and 56394 transitions. [2019-12-18 19:58:11,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 19:58:11,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:11,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:11,373 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:11,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:11,373 INFO L82 PathProgramCache]: Analyzing trace with hash -559725799, now seen corresponding path program 1 times [2019-12-18 19:58:11,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:11,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045680530] [2019-12-18 19:58:11,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:11,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045680530] [2019-12-18 19:58:11,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:11,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:58:11,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213413231] [2019-12-18 19:58:11,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:58:11,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:11,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:58:11,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:58:11,440 INFO L87 Difference]: Start difference. First operand 18703 states and 56394 transitions. Second operand 3 states. [2019-12-18 19:58:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:11,529 INFO L93 Difference]: Finished difference Result 18702 states and 56392 transitions. [2019-12-18 19:58:11,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:58:11,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 19:58:11,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:11,572 INFO L225 Difference]: With dead ends: 18702 [2019-12-18 19:58:11,572 INFO L226 Difference]: Without dead ends: 18702 [2019-12-18 19:58:11,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:58:11,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18702 states. [2019-12-18 19:58:11,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18702 to 18702. [2019-12-18 19:58:11,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18702 states. [2019-12-18 19:58:11,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18702 states to 18702 states and 56392 transitions. [2019-12-18 19:58:11,948 INFO L78 Accepts]: Start accepts. Automaton has 18702 states and 56392 transitions. Word has length 39 [2019-12-18 19:58:11,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:11,948 INFO L462 AbstractCegarLoop]: Abstraction has 18702 states and 56392 transitions. [2019-12-18 19:58:11,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:58:11,949 INFO L276 IsEmpty]: Start isEmpty. Operand 18702 states and 56392 transitions. [2019-12-18 19:58:11,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 19:58:11,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:11,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:11,971 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:11,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:11,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1324353592, now seen corresponding path program 1 times [2019-12-18 19:58:11,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:11,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193010181] [2019-12-18 19:58:11,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:12,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193010181] [2019-12-18 19:58:12,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:12,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:58:12,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110534000] [2019-12-18 19:58:12,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:58:12,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:12,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:58:12,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:58:12,038 INFO L87 Difference]: Start difference. First operand 18702 states and 56392 transitions. Second operand 5 states. [2019-12-18 19:58:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:12,115 INFO L93 Difference]: Finished difference Result 17378 states and 53366 transitions. [2019-12-18 19:58:12,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:58:12,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 19:58:12,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:12,142 INFO L225 Difference]: With dead ends: 17378 [2019-12-18 19:58:12,142 INFO L226 Difference]: Without dead ends: 17378 [2019-12-18 19:58:12,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:58:12,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17378 states. [2019-12-18 19:58:12,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17378 to 16713. [2019-12-18 19:58:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16713 states. [2019-12-18 19:58:12,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16713 states to 16713 states and 51571 transitions. [2019-12-18 19:58:12,411 INFO L78 Accepts]: Start accepts. Automaton has 16713 states and 51571 transitions. Word has length 40 [2019-12-18 19:58:12,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:12,412 INFO L462 AbstractCegarLoop]: Abstraction has 16713 states and 51571 transitions. [2019-12-18 19:58:12,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:58:12,412 INFO L276 IsEmpty]: Start isEmpty. Operand 16713 states and 51571 transitions. [2019-12-18 19:58:12,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 19:58:12,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:12,429 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:12,429 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:12,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:12,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1560507821, now seen corresponding path program 1 times [2019-12-18 19:58:12,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:12,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720201403] [2019-12-18 19:58:12,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:12,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720201403] [2019-12-18 19:58:12,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:12,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:58:12,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856830495] [2019-12-18 19:58:12,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:58:12,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:12,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:58:12,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:58:12,487 INFO L87 Difference]: Start difference. First operand 16713 states and 51571 transitions. Second operand 3 states. [2019-12-18 19:58:12,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:12,605 INFO L93 Difference]: Finished difference Result 22522 states and 68098 transitions. [2019-12-18 19:58:12,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:58:12,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 19:58:12,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:12,646 INFO L225 Difference]: With dead ends: 22522 [2019-12-18 19:58:12,647 INFO L226 Difference]: Without dead ends: 22522 [2019-12-18 19:58:12,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:58:12,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22522 states. [2019-12-18 19:58:13,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22522 to 16531. [2019-12-18 19:58:13,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16531 states. [2019-12-18 19:58:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16531 states to 16531 states and 50417 transitions. [2019-12-18 19:58:13,092 INFO L78 Accepts]: Start accepts. Automaton has 16531 states and 50417 transitions. Word has length 64 [2019-12-18 19:58:13,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:13,092 INFO L462 AbstractCegarLoop]: Abstraction has 16531 states and 50417 transitions. [2019-12-18 19:58:13,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:58:13,092 INFO L276 IsEmpty]: Start isEmpty. Operand 16531 states and 50417 transitions. [2019-12-18 19:58:13,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 19:58:13,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:13,111 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:13,112 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:13,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:13,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1583187919, now seen corresponding path program 1 times [2019-12-18 19:58:13,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:13,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368566482] [2019-12-18 19:58:13,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:13,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368566482] [2019-12-18 19:58:13,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:13,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:58:13,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717432646] [2019-12-18 19:58:13,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:58:13,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:13,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:58:13,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:58:13,208 INFO L87 Difference]: Start difference. First operand 16531 states and 50417 transitions. Second operand 7 states. [2019-12-18 19:58:13,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:13,690 INFO L93 Difference]: Finished difference Result 48075 states and 145792 transitions. [2019-12-18 19:58:13,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:58:13,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 19:58:13,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:13,754 INFO L225 Difference]: With dead ends: 48075 [2019-12-18 19:58:13,755 INFO L226 Difference]: Without dead ends: 37314 [2019-12-18 19:58:13,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:58:13,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37314 states. [2019-12-18 19:58:14,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37314 to 20250. [2019-12-18 19:58:14,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20250 states. [2019-12-18 19:58:14,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20250 states to 20250 states and 62030 transitions. [2019-12-18 19:58:14,230 INFO L78 Accepts]: Start accepts. Automaton has 20250 states and 62030 transitions. Word has length 64 [2019-12-18 19:58:14,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:14,230 INFO L462 AbstractCegarLoop]: Abstraction has 20250 states and 62030 transitions. [2019-12-18 19:58:14,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:58:14,230 INFO L276 IsEmpty]: Start isEmpty. Operand 20250 states and 62030 transitions. [2019-12-18 19:58:14,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 19:58:14,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:14,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:14,257 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:14,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:14,258 INFO L82 PathProgramCache]: Analyzing trace with hash 713705511, now seen corresponding path program 2 times [2019-12-18 19:58:14,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:14,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596920450] [2019-12-18 19:58:14,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:14,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596920450] [2019-12-18 19:58:14,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:14,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:58:14,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367736241] [2019-12-18 19:58:14,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:58:14,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:14,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:58:14,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:58:14,349 INFO L87 Difference]: Start difference. First operand 20250 states and 62030 transitions. Second operand 7 states. [2019-12-18 19:58:14,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:14,865 INFO L93 Difference]: Finished difference Result 55081 states and 165238 transitions. [2019-12-18 19:58:14,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:58:14,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 19:58:14,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:14,925 INFO L225 Difference]: With dead ends: 55081 [2019-12-18 19:58:14,925 INFO L226 Difference]: Without dead ends: 40243 [2019-12-18 19:58:14,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:58:15,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40243 states. [2019-12-18 19:58:15,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40243 to 23749. [2019-12-18 19:58:15,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23749 states. [2019-12-18 19:58:15,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23749 states to 23749 states and 72556 transitions. [2019-12-18 19:58:15,452 INFO L78 Accepts]: Start accepts. Automaton has 23749 states and 72556 transitions. Word has length 64 [2019-12-18 19:58:15,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:15,452 INFO L462 AbstractCegarLoop]: Abstraction has 23749 states and 72556 transitions. [2019-12-18 19:58:15,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:58:15,452 INFO L276 IsEmpty]: Start isEmpty. Operand 23749 states and 72556 transitions. [2019-12-18 19:58:15,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 19:58:15,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:15,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:15,479 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:15,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:15,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1281034255, now seen corresponding path program 3 times [2019-12-18 19:58:15,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:15,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942879851] [2019-12-18 19:58:15,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:15,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942879851] [2019-12-18 19:58:15,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:15,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 19:58:15,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827171202] [2019-12-18 19:58:15,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:58:15,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:15,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:58:15,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:58:15,607 INFO L87 Difference]: Start difference. First operand 23749 states and 72556 transitions. Second operand 9 states. [2019-12-18 19:58:17,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:17,351 INFO L93 Difference]: Finished difference Result 74583 states and 224180 transitions. [2019-12-18 19:58:17,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 19:58:17,351 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 19:58:17,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:17,499 INFO L225 Difference]: With dead ends: 74583 [2019-12-18 19:58:17,499 INFO L226 Difference]: Without dead ends: 71960 [2019-12-18 19:58:17,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:58:17,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71960 states. [2019-12-18 19:58:18,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71960 to 23905. [2019-12-18 19:58:18,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23905 states. [2019-12-18 19:58:18,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23905 states to 23905 states and 73218 transitions. [2019-12-18 19:58:18,298 INFO L78 Accepts]: Start accepts. Automaton has 23905 states and 73218 transitions. Word has length 64 [2019-12-18 19:58:18,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:18,298 INFO L462 AbstractCegarLoop]: Abstraction has 23905 states and 73218 transitions. [2019-12-18 19:58:18,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:58:18,299 INFO L276 IsEmpty]: Start isEmpty. Operand 23905 states and 73218 transitions. [2019-12-18 19:58:18,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 19:58:18,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:18,326 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:18,326 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:18,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:18,326 INFO L82 PathProgramCache]: Analyzing trace with hash 229645845, now seen corresponding path program 4 times [2019-12-18 19:58:18,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:18,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071823647] [2019-12-18 19:58:18,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:18,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071823647] [2019-12-18 19:58:18,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:18,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 19:58:18,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461761992] [2019-12-18 19:58:18,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:58:18,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:18,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:58:18,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:58:18,464 INFO L87 Difference]: Start difference. First operand 23905 states and 73218 transitions. Second operand 9 states. [2019-12-18 19:58:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:19,831 INFO L93 Difference]: Finished difference Result 87530 states and 263304 transitions. [2019-12-18 19:58:19,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 19:58:19,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 19:58:19,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:19,953 INFO L225 Difference]: With dead ends: 87530 [2019-12-18 19:58:19,954 INFO L226 Difference]: Without dead ends: 84971 [2019-12-18 19:58:19,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 19:58:20,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84971 states. [2019-12-18 19:58:20,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84971 to 23942. [2019-12-18 19:58:20,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23942 states. [2019-12-18 19:58:21,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23942 states to 23942 states and 73416 transitions. [2019-12-18 19:58:21,031 INFO L78 Accepts]: Start accepts. Automaton has 23942 states and 73416 transitions. Word has length 64 [2019-12-18 19:58:21,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:21,032 INFO L462 AbstractCegarLoop]: Abstraction has 23942 states and 73416 transitions. [2019-12-18 19:58:21,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:58:21,032 INFO L276 IsEmpty]: Start isEmpty. Operand 23942 states and 73416 transitions. [2019-12-18 19:58:21,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 19:58:21,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:21,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:21,060 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:21,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:21,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1004584677, now seen corresponding path program 5 times [2019-12-18 19:58:21,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:21,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276502353] [2019-12-18 19:58:21,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:21,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276502353] [2019-12-18 19:58:21,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:21,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 19:58:21,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174053449] [2019-12-18 19:58:21,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:58:21,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:21,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:58:21,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:58:21,203 INFO L87 Difference]: Start difference. First operand 23942 states and 73416 transitions. Second operand 8 states. [2019-12-18 19:58:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:22,942 INFO L93 Difference]: Finished difference Result 44340 states and 133727 transitions. [2019-12-18 19:58:22,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:58:22,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 19:58:22,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:23,006 INFO L225 Difference]: With dead ends: 44340 [2019-12-18 19:58:23,006 INFO L226 Difference]: Without dead ends: 44172 [2019-12-18 19:58:23,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-12-18 19:58:23,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44172 states. [2019-12-18 19:58:23,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44172 to 30209. [2019-12-18 19:58:23,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30209 states. [2019-12-18 19:58:23,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30209 states to 30209 states and 91646 transitions. [2019-12-18 19:58:23,566 INFO L78 Accepts]: Start accepts. Automaton has 30209 states and 91646 transitions. Word has length 64 [2019-12-18 19:58:23,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:23,566 INFO L462 AbstractCegarLoop]: Abstraction has 30209 states and 91646 transitions. [2019-12-18 19:58:23,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:58:23,566 INFO L276 IsEmpty]: Start isEmpty. Operand 30209 states and 91646 transitions. [2019-12-18 19:58:23,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 19:58:23,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:23,595 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:23,595 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:23,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:23,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2094479057, now seen corresponding path program 6 times [2019-12-18 19:58:23,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:23,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829376491] [2019-12-18 19:58:23,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:23,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:23,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829376491] [2019-12-18 19:58:23,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:23,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:58:23,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244272548] [2019-12-18 19:58:23,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:58:23,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:23,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:58:23,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:58:23,678 INFO L87 Difference]: Start difference. First operand 30209 states and 91646 transitions. Second operand 5 states. [2019-12-18 19:58:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:24,035 INFO L93 Difference]: Finished difference Result 32231 states and 97319 transitions. [2019-12-18 19:58:24,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:58:24,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-18 19:58:24,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:24,085 INFO L225 Difference]: With dead ends: 32231 [2019-12-18 19:58:24,085 INFO L226 Difference]: Without dead ends: 32231 [2019-12-18 19:58:24,086 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-18 19:58:24,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32231 states. [2019-12-18 19:58:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32231 to 30728. [2019-12-18 19:58:24,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30728 states. [2019-12-18 19:58:24,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30728 states to 30728 states and 93212 transitions. [2019-12-18 19:58:24,738 INFO L78 Accepts]: Start accepts. Automaton has 30728 states and 93212 transitions. Word has length 64 [2019-12-18 19:58:24,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:24,739 INFO L462 AbstractCegarLoop]: Abstraction has 30728 states and 93212 transitions. [2019-12-18 19:58:24,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:58:24,739 INFO L276 IsEmpty]: Start isEmpty. Operand 30728 states and 93212 transitions. [2019-12-18 19:58:24,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 19:58:24,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:24,786 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:24,787 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:24,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:24,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1576440573, now seen corresponding path program 7 times [2019-12-18 19:58:24,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:24,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203141641] [2019-12-18 19:58:24,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:24,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:24,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203141641] [2019-12-18 19:58:24,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:24,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 19:58:24,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493040247] [2019-12-18 19:58:24,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:58:24,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:24,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:58:24,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:58:24,927 INFO L87 Difference]: Start difference. First operand 30728 states and 93212 transitions. Second operand 8 states. [2019-12-18 19:58:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:26,179 INFO L93 Difference]: Finished difference Result 54321 states and 161321 transitions. [2019-12-18 19:58:26,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 19:58:26,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 19:58:26,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:26,255 INFO L225 Difference]: With dead ends: 54321 [2019-12-18 19:58:26,255 INFO L226 Difference]: Without dead ends: 53941 [2019-12-18 19:58:26,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:58:26,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53941 states. [2019-12-18 19:58:26,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53941 to 36811. [2019-12-18 19:58:26,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36811 states. [2019-12-18 19:58:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36811 states to 36811 states and 111342 transitions. [2019-12-18 19:58:26,948 INFO L78 Accepts]: Start accepts. Automaton has 36811 states and 111342 transitions. Word has length 64 [2019-12-18 19:58:26,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:26,948 INFO L462 AbstractCegarLoop]: Abstraction has 36811 states and 111342 transitions. [2019-12-18 19:58:26,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:58:26,949 INFO L276 IsEmpty]: Start isEmpty. Operand 36811 states and 111342 transitions. [2019-12-18 19:58:26,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 19:58:26,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:26,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:26,987 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:26,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:26,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1856816855, now seen corresponding path program 8 times [2019-12-18 19:58:26,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:26,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308567589] [2019-12-18 19:58:26,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:27,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308567589] [2019-12-18 19:58:27,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:27,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:58:27,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342488499] [2019-12-18 19:58:27,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:58:27,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:27,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:58:27,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:58:27,114 INFO L87 Difference]: Start difference. First operand 36811 states and 111342 transitions. Second operand 7 states. [2019-12-18 19:58:28,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:28,079 INFO L93 Difference]: Finished difference Result 62412 states and 186098 transitions. [2019-12-18 19:58:28,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 19:58:28,080 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 19:58:28,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:28,172 INFO L225 Difference]: With dead ends: 62412 [2019-12-18 19:58:28,172 INFO L226 Difference]: Without dead ends: 62088 [2019-12-18 19:58:28,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:58:28,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62088 states. [2019-12-18 19:58:29,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62088 to 45741. [2019-12-18 19:58:29,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45741 states. [2019-12-18 19:58:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45741 states to 45741 states and 138558 transitions. [2019-12-18 19:58:29,218 INFO L78 Accepts]: Start accepts. Automaton has 45741 states and 138558 transitions. Word has length 64 [2019-12-18 19:58:29,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:29,218 INFO L462 AbstractCegarLoop]: Abstraction has 45741 states and 138558 transitions. [2019-12-18 19:58:29,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:58:29,218 INFO L276 IsEmpty]: Start isEmpty. Operand 45741 states and 138558 transitions. [2019-12-18 19:58:29,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 19:58:29,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:29,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:29,270 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:29,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:29,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1074784319, now seen corresponding path program 9 times [2019-12-18 19:58:29,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:29,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833970313] [2019-12-18 19:58:29,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:29,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:29,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833970313] [2019-12-18 19:58:29,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:29,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:58:29,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924544697] [2019-12-18 19:58:29,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:58:29,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:29,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:58:29,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:58:29,363 INFO L87 Difference]: Start difference. First operand 45741 states and 138558 transitions. Second operand 6 states. [2019-12-18 19:58:29,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:29,878 INFO L93 Difference]: Finished difference Result 48161 states and 145147 transitions. [2019-12-18 19:58:29,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:58:29,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-18 19:58:29,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:29,951 INFO L225 Difference]: With dead ends: 48161 [2019-12-18 19:58:29,951 INFO L226 Difference]: Without dead ends: 48161 [2019-12-18 19:58:29,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:58:30,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48161 states. [2019-12-18 19:58:30,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48161 to 45854. [2019-12-18 19:58:30,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45854 states. [2019-12-18 19:58:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45854 states to 45854 states and 138890 transitions. [2019-12-18 19:58:30,679 INFO L78 Accepts]: Start accepts. Automaton has 45854 states and 138890 transitions. Word has length 64 [2019-12-18 19:58:30,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:30,679 INFO L462 AbstractCegarLoop]: Abstraction has 45854 states and 138890 transitions. [2019-12-18 19:58:30,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:58:30,679 INFO L276 IsEmpty]: Start isEmpty. Operand 45854 states and 138890 transitions. [2019-12-18 19:58:30,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 19:58:30,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:30,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:30,738 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:30,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:30,738 INFO L82 PathProgramCache]: Analyzing trace with hash -261330579, now seen corresponding path program 10 times [2019-12-18 19:58:30,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:30,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895604460] [2019-12-18 19:58:30,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:30,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895604460] [2019-12-18 19:58:30,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:30,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 19:58:30,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801785534] [2019-12-18 19:58:30,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:58:30,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:30,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:58:30,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:58:30,882 INFO L87 Difference]: Start difference. First operand 45854 states and 138890 transitions. Second operand 8 states. [2019-12-18 19:58:32,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:32,326 INFO L93 Difference]: Finished difference Result 68908 states and 204884 transitions. [2019-12-18 19:58:32,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 19:58:32,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 19:58:32,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:32,724 INFO L225 Difference]: With dead ends: 68908 [2019-12-18 19:58:32,724 INFO L226 Difference]: Without dead ends: 68831 [2019-12-18 19:58:32,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:58:32,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68831 states. [2019-12-18 19:58:33,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68831 to 46116. [2019-12-18 19:58:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46116 states. [2019-12-18 19:58:33,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46116 states to 46116 states and 137896 transitions. [2019-12-18 19:58:33,561 INFO L78 Accepts]: Start accepts. Automaton has 46116 states and 137896 transitions. Word has length 64 [2019-12-18 19:58:33,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:33,562 INFO L462 AbstractCegarLoop]: Abstraction has 46116 states and 137896 transitions. [2019-12-18 19:58:33,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:58:33,562 INFO L276 IsEmpty]: Start isEmpty. Operand 46116 states and 137896 transitions. [2019-12-18 19:58:33,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 19:58:33,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:33,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:33,609 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:33,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:33,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1977381587, now seen corresponding path program 11 times [2019-12-18 19:58:33,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:33,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906071567] [2019-12-18 19:58:33,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:33,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906071567] [2019-12-18 19:58:33,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:33,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:58:33,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872565314] [2019-12-18 19:58:33,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:58:33,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:33,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:58:33,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:58:33,702 INFO L87 Difference]: Start difference. First operand 46116 states and 137896 transitions. Second operand 7 states. [2019-12-18 19:58:34,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:34,634 INFO L93 Difference]: Finished difference Result 72970 states and 214444 transitions. [2019-12-18 19:58:34,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 19:58:34,634 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 19:58:34,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:34,745 INFO L225 Difference]: With dead ends: 72970 [2019-12-18 19:58:34,745 INFO L226 Difference]: Without dead ends: 72970 [2019-12-18 19:58:34,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:58:34,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72970 states. [2019-12-18 19:58:35,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72970 to 45942. [2019-12-18 19:58:35,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45942 states. [2019-12-18 19:58:35,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45942 states to 45942 states and 137476 transitions. [2019-12-18 19:58:35,688 INFO L78 Accepts]: Start accepts. Automaton has 45942 states and 137476 transitions. Word has length 64 [2019-12-18 19:58:35,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:35,688 INFO L462 AbstractCegarLoop]: Abstraction has 45942 states and 137476 transitions. [2019-12-18 19:58:35,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:58:35,689 INFO L276 IsEmpty]: Start isEmpty. Operand 45942 states and 137476 transitions. [2019-12-18 19:58:36,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 19:58:36,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:36,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:36,119 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:36,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:36,119 INFO L82 PathProgramCache]: Analyzing trace with hash 552913381, now seen corresponding path program 12 times [2019-12-18 19:58:36,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:36,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73970763] [2019-12-18 19:58:36,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:36,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:36,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73970763] [2019-12-18 19:58:36,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:36,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:58:36,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368960718] [2019-12-18 19:58:36,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:58:36,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:36,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:58:36,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:58:36,191 INFO L87 Difference]: Start difference. First operand 45942 states and 137476 transitions. Second operand 3 states. [2019-12-18 19:58:36,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:36,332 INFO L93 Difference]: Finished difference Result 45941 states and 137474 transitions. [2019-12-18 19:58:36,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:58:36,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 19:58:36,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:36,399 INFO L225 Difference]: With dead ends: 45941 [2019-12-18 19:58:36,399 INFO L226 Difference]: Without dead ends: 45941 [2019-12-18 19:58:36,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:58:36,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45941 states. [2019-12-18 19:58:37,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45941 to 36050. [2019-12-18 19:58:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36050 states. [2019-12-18 19:58:37,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36050 states to 36050 states and 108817 transitions. [2019-12-18 19:58:37,074 INFO L78 Accepts]: Start accepts. Automaton has 36050 states and 108817 transitions. Word has length 64 [2019-12-18 19:58:37,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:37,074 INFO L462 AbstractCegarLoop]: Abstraction has 36050 states and 108817 transitions. [2019-12-18 19:58:37,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:58:37,074 INFO L276 IsEmpty]: Start isEmpty. Operand 36050 states and 108817 transitions. [2019-12-18 19:58:37,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 19:58:37,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:37,114 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:37,114 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:37,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:37,114 INFO L82 PathProgramCache]: Analyzing trace with hash 296700108, now seen corresponding path program 1 times [2019-12-18 19:58:37,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:37,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515929810] [2019-12-18 19:58:37,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:37,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:37,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515929810] [2019-12-18 19:58:37,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:37,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 19:58:37,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885484577] [2019-12-18 19:58:37,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:58:37,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:37,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:58:37,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:58:37,248 INFO L87 Difference]: Start difference. First operand 36050 states and 108817 transitions. Second operand 9 states. [2019-12-18 19:58:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:39,043 INFO L93 Difference]: Finished difference Result 53826 states and 160800 transitions. [2019-12-18 19:58:39,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 19:58:39,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 19:58:39,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:39,124 INFO L225 Difference]: With dead ends: 53826 [2019-12-18 19:58:39,124 INFO L226 Difference]: Without dead ends: 53574 [2019-12-18 19:58:39,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:58:39,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53574 states. [2019-12-18 19:58:39,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53574 to 34348. [2019-12-18 19:58:39,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34348 states. [2019-12-18 19:58:39,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34348 states to 34348 states and 103724 transitions. [2019-12-18 19:58:39,823 INFO L78 Accepts]: Start accepts. Automaton has 34348 states and 103724 transitions. Word has length 65 [2019-12-18 19:58:39,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:39,823 INFO L462 AbstractCegarLoop]: Abstraction has 34348 states and 103724 transitions. [2019-12-18 19:58:39,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:58:39,823 INFO L276 IsEmpty]: Start isEmpty. Operand 34348 states and 103724 transitions. [2019-12-18 19:58:39,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 19:58:39,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:39,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:39,861 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:39,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:39,862 INFO L82 PathProgramCache]: Analyzing trace with hash -823976072, now seen corresponding path program 2 times [2019-12-18 19:58:39,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:39,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225693480] [2019-12-18 19:58:39,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:39,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:39,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225693480] [2019-12-18 19:58:39,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:39,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:58:39,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135837244] [2019-12-18 19:58:39,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:58:39,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:39,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:58:39,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:58:39,917 INFO L87 Difference]: Start difference. First operand 34348 states and 103724 transitions. Second operand 3 states. [2019-12-18 19:58:40,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:40,031 INFO L93 Difference]: Finished difference Result 26123 states and 78075 transitions. [2019-12-18 19:58:40,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:58:40,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 19:58:40,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:40,259 INFO L225 Difference]: With dead ends: 26123 [2019-12-18 19:58:40,259 INFO L226 Difference]: Without dead ends: 26123 [2019-12-18 19:58:40,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:58:40,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26123 states. [2019-12-18 19:58:40,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26123 to 24143. [2019-12-18 19:58:40,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24143 states. [2019-12-18 19:58:40,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24143 states to 24143 states and 72039 transitions. [2019-12-18 19:58:40,645 INFO L78 Accepts]: Start accepts. Automaton has 24143 states and 72039 transitions. Word has length 65 [2019-12-18 19:58:40,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:40,645 INFO L462 AbstractCegarLoop]: Abstraction has 24143 states and 72039 transitions. [2019-12-18 19:58:40,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:58:40,646 INFO L276 IsEmpty]: Start isEmpty. Operand 24143 states and 72039 transitions. [2019-12-18 19:58:40,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 19:58:40,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:40,669 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:40,669 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:40,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:40,669 INFO L82 PathProgramCache]: Analyzing trace with hash 931723771, now seen corresponding path program 1 times [2019-12-18 19:58:40,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:40,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209113643] [2019-12-18 19:58:40,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:40,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:40,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209113643] [2019-12-18 19:58:40,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:40,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 19:58:40,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61739322] [2019-12-18 19:58:40,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:58:40,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:40,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:58:40,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:58:40,776 INFO L87 Difference]: Start difference. First operand 24143 states and 72039 transitions. Second operand 9 states. [2019-12-18 19:58:42,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:42,202 INFO L93 Difference]: Finished difference Result 42196 states and 125219 transitions. [2019-12-18 19:58:42,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 19:58:42,203 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 19:58:42,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:42,250 INFO L225 Difference]: With dead ends: 42196 [2019-12-18 19:58:42,250 INFO L226 Difference]: Without dead ends: 34336 [2019-12-18 19:58:42,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 19:58:42,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34336 states. [2019-12-18 19:58:42,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34336 to 24716. [2019-12-18 19:58:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24716 states. [2019-12-18 19:58:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24716 states to 24716 states and 73258 transitions. [2019-12-18 19:58:42,698 INFO L78 Accepts]: Start accepts. Automaton has 24716 states and 73258 transitions. Word has length 66 [2019-12-18 19:58:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:42,698 INFO L462 AbstractCegarLoop]: Abstraction has 24716 states and 73258 transitions. [2019-12-18 19:58:42,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:58:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 24716 states and 73258 transitions. [2019-12-18 19:58:42,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 19:58:42,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:42,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:42,723 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:42,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:42,723 INFO L82 PathProgramCache]: Analyzing trace with hash -643255755, now seen corresponding path program 2 times [2019-12-18 19:58:42,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:42,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29362952] [2019-12-18 19:58:42,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:43,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:43,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29362952] [2019-12-18 19:58:43,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:43,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 19:58:43,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507691169] [2019-12-18 19:58:43,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 19:58:43,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:43,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 19:58:43,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:58:43,133 INFO L87 Difference]: Start difference. First operand 24716 states and 73258 transitions. Second operand 17 states. [2019-12-18 19:58:45,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:45,773 INFO L93 Difference]: Finished difference Result 31399 states and 92605 transitions. [2019-12-18 19:58:45,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 19:58:45,773 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-18 19:58:45,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:45,816 INFO L225 Difference]: With dead ends: 31399 [2019-12-18 19:58:45,817 INFO L226 Difference]: Without dead ends: 28608 [2019-12-18 19:58:45,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=950, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:58:45,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28608 states. [2019-12-18 19:58:46,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28608 to 25232. [2019-12-18 19:58:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25232 states. [2019-12-18 19:58:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25232 states to 25232 states and 74612 transitions. [2019-12-18 19:58:46,226 INFO L78 Accepts]: Start accepts. Automaton has 25232 states and 74612 transitions. Word has length 66 [2019-12-18 19:58:46,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:46,226 INFO L462 AbstractCegarLoop]: Abstraction has 25232 states and 74612 transitions. [2019-12-18 19:58:46,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 19:58:46,227 INFO L276 IsEmpty]: Start isEmpty. Operand 25232 states and 74612 transitions. [2019-12-18 19:58:46,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 19:58:46,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:46,255 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:46,256 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:46,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:46,256 INFO L82 PathProgramCache]: Analyzing trace with hash 297848637, now seen corresponding path program 3 times [2019-12-18 19:58:46,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:46,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081095722] [2019-12-18 19:58:46,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:46,537 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-12-18 19:58:46,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:46,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081095722] [2019-12-18 19:58:46,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:46,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 19:58:46,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341253498] [2019-12-18 19:58:46,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:58:46,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:46,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:58:46,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:58:46,653 INFO L87 Difference]: Start difference. First operand 25232 states and 74612 transitions. Second operand 11 states. [2019-12-18 19:58:47,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:47,986 INFO L93 Difference]: Finished difference Result 50338 states and 149333 transitions. [2019-12-18 19:58:47,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 19:58:47,987 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 19:58:47,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:48,040 INFO L225 Difference]: With dead ends: 50338 [2019-12-18 19:58:48,040 INFO L226 Difference]: Without dead ends: 39845 [2019-12-18 19:58:48,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 19:58:48,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39845 states. [2019-12-18 19:58:48,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39845 to 23314. [2019-12-18 19:58:48,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23314 states. [2019-12-18 19:58:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23314 states to 23314 states and 69152 transitions. [2019-12-18 19:58:48,494 INFO L78 Accepts]: Start accepts. Automaton has 23314 states and 69152 transitions. Word has length 66 [2019-12-18 19:58:48,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:48,494 INFO L462 AbstractCegarLoop]: Abstraction has 23314 states and 69152 transitions. [2019-12-18 19:58:48,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:58:48,494 INFO L276 IsEmpty]: Start isEmpty. Operand 23314 states and 69152 transitions. [2019-12-18 19:58:48,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 19:58:48,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:48,515 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:48,515 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:48,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:48,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1204691391, now seen corresponding path program 4 times [2019-12-18 19:58:48,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:48,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317564820] [2019-12-18 19:58:48,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:48,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:48,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317564820] [2019-12-18 19:58:48,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:48,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 19:58:48,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906412586] [2019-12-18 19:58:48,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 19:58:48,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:48,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 19:58:48,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:58:48,681 INFO L87 Difference]: Start difference. First operand 23314 states and 69152 transitions. Second operand 10 states. [2019-12-18 19:58:51,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:51,730 INFO L93 Difference]: Finished difference Result 41349 states and 120282 transitions. [2019-12-18 19:58:51,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 19:58:51,731 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 19:58:51,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:51,785 INFO L225 Difference]: With dead ends: 41349 [2019-12-18 19:58:51,785 INFO L226 Difference]: Without dead ends: 41109 [2019-12-18 19:58:51,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=928, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:58:51,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41109 states. [2019-12-18 19:58:52,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41109 to 26110. [2019-12-18 19:58:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26110 states. [2019-12-18 19:58:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26110 states to 26110 states and 77092 transitions. [2019-12-18 19:58:52,285 INFO L78 Accepts]: Start accepts. Automaton has 26110 states and 77092 transitions. Word has length 66 [2019-12-18 19:58:52,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:52,285 INFO L462 AbstractCegarLoop]: Abstraction has 26110 states and 77092 transitions. [2019-12-18 19:58:52,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 19:58:52,285 INFO L276 IsEmpty]: Start isEmpty. Operand 26110 states and 77092 transitions. [2019-12-18 19:58:52,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 19:58:52,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:52,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:52,312 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:52,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:52,312 INFO L82 PathProgramCache]: Analyzing trace with hash -2109414549, now seen corresponding path program 5 times [2019-12-18 19:58:52,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:52,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499512729] [2019-12-18 19:58:52,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:52,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499512729] [2019-12-18 19:58:52,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:52,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 19:58:52,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124600775] [2019-12-18 19:58:52,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 19:58:52,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:52,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 19:58:52,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:58:52,458 INFO L87 Difference]: Start difference. First operand 26110 states and 77092 transitions. Second operand 10 states. [2019-12-18 19:58:56,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:56,145 INFO L93 Difference]: Finished difference Result 47206 states and 136594 transitions. [2019-12-18 19:58:56,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 19:58:56,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 19:58:56,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:56,209 INFO L225 Difference]: With dead ends: 47206 [2019-12-18 19:58:56,210 INFO L226 Difference]: Without dead ends: 46798 [2019-12-18 19:58:56,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=815, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:58:56,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46798 states. [2019-12-18 19:58:56,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46798 to 25712. [2019-12-18 19:58:56,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25712 states. [2019-12-18 19:58:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25712 states to 25712 states and 76139 transitions. [2019-12-18 19:58:56,744 INFO L78 Accepts]: Start accepts. Automaton has 25712 states and 76139 transitions. Word has length 66 [2019-12-18 19:58:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:56,745 INFO L462 AbstractCegarLoop]: Abstraction has 25712 states and 76139 transitions. [2019-12-18 19:58:56,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 19:58:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 25712 states and 76139 transitions. [2019-12-18 19:58:56,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 19:58:56,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:56,770 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:56,770 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:56,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:56,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1326856689, now seen corresponding path program 6 times [2019-12-18 19:58:56,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:56,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479483196] [2019-12-18 19:58:56,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:56,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479483196] [2019-12-18 19:58:56,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:56,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:58:56,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598434739] [2019-12-18 19:58:56,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:58:56,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:56,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:58:56,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:58:56,845 INFO L87 Difference]: Start difference. First operand 25712 states and 76139 transitions. Second operand 3 states. [2019-12-18 19:58:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:58:57,022 INFO L93 Difference]: Finished difference Result 29491 states and 87762 transitions. [2019-12-18 19:58:57,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:58:57,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 19:58:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:58:57,090 INFO L225 Difference]: With dead ends: 29491 [2019-12-18 19:58:57,091 INFO L226 Difference]: Without dead ends: 29491 [2019-12-18 19:58:57,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:58:57,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29491 states. [2019-12-18 19:58:57,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29491 to 23206. [2019-12-18 19:58:57,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23206 states. [2019-12-18 19:58:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23206 states to 23206 states and 69519 transitions. [2019-12-18 19:58:57,641 INFO L78 Accepts]: Start accepts. Automaton has 23206 states and 69519 transitions. Word has length 66 [2019-12-18 19:58:57,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:58:57,642 INFO L462 AbstractCegarLoop]: Abstraction has 23206 states and 69519 transitions. [2019-12-18 19:58:57,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:58:57,642 INFO L276 IsEmpty]: Start isEmpty. Operand 23206 states and 69519 transitions. [2019-12-18 19:58:57,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 19:58:57,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:58:57,664 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:58:57,664 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:58:57,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:58:57,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1265411945, now seen corresponding path program 1 times [2019-12-18 19:58:57,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:58:57,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860310838] [2019-12-18 19:58:57,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:58:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:58:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:58:57,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860310838] [2019-12-18 19:58:57,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:58:57,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:58:57,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495855065] [2019-12-18 19:58:57,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:58:57,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:58:57,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:58:57,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:58:57,986 INFO L87 Difference]: Start difference. First operand 23206 states and 69519 transitions. Second operand 14 states. [2019-12-18 19:59:00,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:59:00,724 INFO L93 Difference]: Finished difference Result 29250 states and 86474 transitions. [2019-12-18 19:59:00,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 19:59:00,724 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-18 19:59:00,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:59:00,764 INFO L225 Difference]: With dead ends: 29250 [2019-12-18 19:59:00,765 INFO L226 Difference]: Without dead ends: 28823 [2019-12-18 19:59:00,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=228, Invalid=962, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 19:59:00,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28823 states. [2019-12-18 19:59:01,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28823 to 22946. [2019-12-18 19:59:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22946 states. [2019-12-18 19:59:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22946 states to 22946 states and 68849 transitions. [2019-12-18 19:59:01,126 INFO L78 Accepts]: Start accepts. Automaton has 22946 states and 68849 transitions. Word has length 67 [2019-12-18 19:59:01,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:59:01,127 INFO L462 AbstractCegarLoop]: Abstraction has 22946 states and 68849 transitions. [2019-12-18 19:59:01,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:59:01,127 INFO L276 IsEmpty]: Start isEmpty. Operand 22946 states and 68849 transitions. [2019-12-18 19:59:01,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 19:59:01,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:59:01,148 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:59:01,148 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:59:01,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:59:01,149 INFO L82 PathProgramCache]: Analyzing trace with hash 674435820, now seen corresponding path program 1 times [2019-12-18 19:59:01,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:59:01,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3126435] [2019-12-18 19:59:01,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:59:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:59:01,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:59:01,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3126435] [2019-12-18 19:59:01,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:59:01,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:59:01,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224844036] [2019-12-18 19:59:01,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:59:01,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:59:01,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:59:01,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:59:01,383 INFO L87 Difference]: Start difference. First operand 22946 states and 68849 transitions. Second operand 3 states. [2019-12-18 19:59:01,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:59:01,624 INFO L93 Difference]: Finished difference Result 33297 states and 100314 transitions. [2019-12-18 19:59:01,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:59:01,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 19:59:01,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:59:01,669 INFO L225 Difference]: With dead ends: 33297 [2019-12-18 19:59:01,669 INFO L226 Difference]: Without dead ends: 33297 [2019-12-18 19:59:01,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:59:01,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33297 states. [2019-12-18 19:59:02,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33297 to 23450. [2019-12-18 19:59:02,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23450 states. [2019-12-18 19:59:02,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23450 states to 23450 states and 70501 transitions. [2019-12-18 19:59:02,089 INFO L78 Accepts]: Start accepts. Automaton has 23450 states and 70501 transitions. Word has length 67 [2019-12-18 19:59:02,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:59:02,089 INFO L462 AbstractCegarLoop]: Abstraction has 23450 states and 70501 transitions. [2019-12-18 19:59:02,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:59:02,089 INFO L276 IsEmpty]: Start isEmpty. Operand 23450 states and 70501 transitions. [2019-12-18 19:59:02,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 19:59:02,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:59:02,114 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:59:02,114 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:59:02,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:59:02,115 INFO L82 PathProgramCache]: Analyzing trace with hash -907259422, now seen corresponding path program 2 times [2019-12-18 19:59:02,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:59:02,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627885937] [2019-12-18 19:59:02,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:59:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:59:02,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:59:02,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627885937] [2019-12-18 19:59:02,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:59:02,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 19:59:02,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564946664] [2019-12-18 19:59:02,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:59:02,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:59:02,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:59:02,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:59:02,219 INFO L87 Difference]: Start difference. First operand 23450 states and 70501 transitions. Second operand 9 states. [2019-12-18 19:59:03,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:59:03,898 INFO L93 Difference]: Finished difference Result 54582 states and 167049 transitions. [2019-12-18 19:59:03,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 19:59:03,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 19:59:03,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:59:03,984 INFO L225 Difference]: With dead ends: 54582 [2019-12-18 19:59:03,984 INFO L226 Difference]: Without dead ends: 54582 [2019-12-18 19:59:03,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=216, Invalid=596, Unknown=0, NotChecked=0, Total=812 [2019-12-18 19:59:04,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54582 states. [2019-12-18 19:59:04,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54582 to 27943. [2019-12-18 19:59:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27943 states. [2019-12-18 19:59:04,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27943 states to 27943 states and 85562 transitions. [2019-12-18 19:59:04,656 INFO L78 Accepts]: Start accepts. Automaton has 27943 states and 85562 transitions. Word has length 67 [2019-12-18 19:59:04,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:59:04,656 INFO L462 AbstractCegarLoop]: Abstraction has 27943 states and 85562 transitions. [2019-12-18 19:59:04,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:59:04,656 INFO L276 IsEmpty]: Start isEmpty. Operand 27943 states and 85562 transitions. [2019-12-18 19:59:04,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 19:59:04,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:59:04,686 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:59:04,686 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:59:04,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:59:04,687 INFO L82 PathProgramCache]: Analyzing trace with hash 56904589, now seen corresponding path program 2 times [2019-12-18 19:59:04,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:59:04,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048761094] [2019-12-18 19:59:04,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:59:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:59:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:59:04,805 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:59:04,806 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:59:04,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~a$mem_tmp~0_9) (= 0 v_~weak$$choice0~0_8) (= 0 v_~a$w_buff0_used~0_114) (= 0 v_~a$w_buff1_used~0_71) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t38~0.base_23| 1)) (= v_~a$r_buff0_thd2~0_18 0) (= 0 v_~__unbuffered_p1_EAX~0_12) (= 0 v_~a$read_delayed~0_7) (= 0 v_~__unbuffered_p0_EAX~0_12) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~a$w_buff0~0_27) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t38~0.base_23| 4)) (= v_~__unbuffered_p2_EBX~0_12 0) (= 0 v_~a$r_buff1_thd1~0_15) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t38~0.base_23|) (= v_~a$flush_delayed~0_12 0) (= 0 v_~z~0_7) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t38~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t38~0.base_23|) |v_ULTIMATE.start_main_~#t38~0.offset_18| 0)) |v_#memory_int_21|) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_11) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= v_~a$r_buff0_thd0~0_18 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t38~0.base_23|) 0) (= 0 |v_ULTIMATE.start_main_~#t38~0.offset_18|) (= v_~__unbuffered_p0_EBX~0_12 0) (= v_~a$r_buff0_thd1~0_23 0) (= v_~a$r_buff0_thd3~0_75 0) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~a$w_buff1~0_25) (= 0 v_~a$r_buff1_thd2~0_18) (= v_~__unbuffered_p1_EBX~0_12 0) (= 0 v_~a$r_buff1_thd0~0_18) (= 0 v_~a$r_buff1_thd3~0_47) (= v_~a~0_27 0) (= 0 v_~x~0_8) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_11|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_18, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~a~0=v_~a~0_27, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_17|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ULTIMATE.start_main_~#t40~0.base=|v_ULTIMATE.start_main_~#t40~0.base_20|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_47, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_114, ULTIMATE.start_main_~#t40~0.offset=|v_ULTIMATE.start_main_~#t40~0.offset_15|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ULTIMATE.start_main_~#t38~0.offset=|v_ULTIMATE.start_main_~#t38~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_27, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_8, ULTIMATE.start_main_~#t39~0.offset=|v_ULTIMATE.start_main_~#t39~0.offset_18|, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ~a$mem_tmp~0=v_~a$mem_tmp~0_9, ULTIMATE.start_main_~#t39~0.base=|v_ULTIMATE.start_main_~#t39~0.base_23|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~y~0=v_~y~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_15, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_75, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t38~0.base=|v_ULTIMATE.start_main_~#t38~0.base_23|, ~z~0=v_~z~0_7, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t40~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ULTIMATE.start_main_~#t40~0.offset, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t38~0.offset, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t39~0.offset, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_~#t39~0.base, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t38~0.base, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 19:59:04,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] P0ENTRY-->L4-3: Formula: (and (= ~a$w_buff1_used~0_Out-1527444238 ~a$w_buff0_used~0_In-1527444238) (= ~a$w_buff0~0_Out-1527444238 1) (= ~a$w_buff0~0_In-1527444238 ~a$w_buff1~0_Out-1527444238) (= |P0Thread1of1ForFork2_#in~arg.base_In-1527444238| P0Thread1of1ForFork2_~arg.base_Out-1527444238) (= 1 ~a$w_buff0_used~0_Out-1527444238) (= P0Thread1of1ForFork2_~arg.offset_Out-1527444238 |P0Thread1of1ForFork2_#in~arg.offset_In-1527444238|) (= (mod ~a$w_buff1_used~0_Out-1527444238 256) 0) (= 1 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-1527444238|) (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out-1527444238 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-1527444238|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In-1527444238|, ~a$w_buff0~0=~a$w_buff0~0_In-1527444238, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1527444238, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In-1527444238|} OutVars{~a$w_buff1~0=~a$w_buff1~0_Out-1527444238, P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In-1527444238|, ~a$w_buff0~0=~a$w_buff0~0_Out-1527444238, P0Thread1of1ForFork2_~arg.offset=P0Thread1of1ForFork2_~arg.offset_Out-1527444238, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-1527444238, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out-1527444238, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In-1527444238|, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-1527444238, P0Thread1of1ForFork2_~arg.base=P0Thread1of1ForFork2_~arg.base_Out-1527444238, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-1527444238|} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork2_~arg.offset, ~a$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~a$w_buff1_used~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 19:59:04,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L842-1-->L844: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t39~0.base_13| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t39~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t39~0.base_13|) |v_ULTIMATE.start_main_~#t39~0.offset_11| 1)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t39~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t39~0.base_13|) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t39~0.base_13|) 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t39~0.base_13| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t39~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t39~0.offset=|v_ULTIMATE.start_main_~#t39~0.offset_11|, ULTIMATE.start_main_~#t39~0.base=|v_ULTIMATE.start_main_~#t39~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t39~0.offset, ULTIMATE.start_main_~#t39~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 19:59:04,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L783-2-->L783-5: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In314683798 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In314683798 256) 0)) (.cse2 (= |P1Thread1of1ForFork0_#t~ite10_Out314683798| |P1Thread1of1ForFork0_#t~ite9_Out314683798|))) (or (and (or .cse0 .cse1) (= ~a~0_In314683798 |P1Thread1of1ForFork0_#t~ite9_Out314683798|) .cse2) (and (not .cse1) (= |P1Thread1of1ForFork0_#t~ite9_Out314683798| ~a$w_buff1~0_In314683798) (not .cse0) .cse2))) InVars {~a~0=~a~0_In314683798, ~a$w_buff1~0=~a$w_buff1~0_In314683798, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In314683798, ~a$w_buff1_used~0=~a$w_buff1_used~0_In314683798} OutVars{~a~0=~a~0_In314683798, ~a$w_buff1~0=~a$w_buff1~0_In314683798, P1Thread1of1ForFork0_#t~ite10=|P1Thread1of1ForFork0_#t~ite10_Out314683798|, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In314683798, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out314683798|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In314683798} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-18 19:59:04,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In72388116 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In72388116 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite11_Out72388116|) (not .cse0) (not .cse1)) (and (= ~a$w_buff0_used~0_In72388116 |P1Thread1of1ForFork0_#t~ite11_Out72388116|) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In72388116, ~a$w_buff0_used~0=~a$w_buff0_used~0_In72388116} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In72388116, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out72388116|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In72388116} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 19:59:04,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In573098309 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In573098309 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In573098309 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In573098309 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite12_Out573098309| ~a$w_buff1_used~0_In573098309) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite12_Out573098309|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In573098309, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In573098309, ~a$w_buff0_used~0=~a$w_buff0_used~0_In573098309, ~a$w_buff1_used~0=~a$w_buff1_used~0_In573098309} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In573098309, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In573098309, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out573098309|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In573098309, ~a$w_buff1_used~0=~a$w_buff1_used~0_In573098309} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 19:59:04,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In862464821 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In862464821 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out862464821|)) (and (= ~a$r_buff0_thd2~0_In862464821 |P1Thread1of1ForFork0_#t~ite13_Out862464821|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In862464821, ~a$w_buff0_used~0=~a$w_buff0_used~0_In862464821} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In862464821, ~a$w_buff0_used~0=~a$w_buff0_used~0_In862464821, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out862464821|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 19:59:04,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In246330769 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In246330769 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In246330769 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In246330769 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite14_Out246330769| ~a$r_buff1_thd2~0_In246330769) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite14_Out246330769| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In246330769, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In246330769, ~a$w_buff0_used~0=~a$w_buff0_used~0_In246330769, ~a$w_buff1_used~0=~a$w_buff1_used~0_In246330769} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In246330769, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In246330769, ~a$w_buff0_used~0=~a$w_buff0_used~0_In246330769, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out246330769|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In246330769} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 19:59:04,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L787-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~a$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork0_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_8|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_7|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 19:59:04,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L844-1-->L846: Formula: (and (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t40~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t40~0.base_12|) |v_ULTIMATE.start_main_~#t40~0.offset_10| 2))) (not (= |v_ULTIMATE.start_main_~#t40~0.base_12| 0)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t40~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t40~0.offset_10| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t40~0.base_12|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t40~0.base_12| 4) |v_#length_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t40~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t40~0.base=|v_ULTIMATE.start_main_~#t40~0.base_12|, ULTIMATE.start_main_~#t40~0.offset=|v_ULTIMATE.start_main_~#t40~0.offset_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t40~0.base, ULTIMATE.start_main_~#t40~0.offset, #length] because there is no mapped edge [2019-12-18 19:59:04,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In120170728 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite20_Out120170728| |P2Thread1of1ForFork1_#t~ite21_Out120170728|) (= |P2Thread1of1ForFork1_#t~ite20_Out120170728| ~a$w_buff0~0_In120170728) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In120170728 256)))) (or (and (= 0 (mod ~a$w_buff1_used~0_In120170728 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In120170728 256)) (and (= (mod ~a$r_buff1_thd3~0_In120170728 256) 0) .cse1)))) (and (= |P2Thread1of1ForFork1_#t~ite20_In120170728| |P2Thread1of1ForFork1_#t~ite20_Out120170728|) (= |P2Thread1of1ForFork1_#t~ite21_Out120170728| ~a$w_buff0~0_In120170728) (not .cse0)))) InVars {P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In120170728|, ~a$w_buff0~0=~a$w_buff0~0_In120170728, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In120170728, ~a$w_buff0_used~0=~a$w_buff0_used~0_In120170728, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In120170728, ~a$w_buff1_used~0=~a$w_buff1_used~0_In120170728, ~weak$$choice2~0=~weak$$choice2~0_In120170728} OutVars{P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out120170728|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out120170728|, ~a$w_buff0~0=~a$w_buff0~0_In120170728, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In120170728, ~a$w_buff0_used~0=~a$w_buff0_used~0_In120170728, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In120170728, ~a$w_buff1_used~0=~a$w_buff1_used~0_In120170728, ~weak$$choice2~0=~weak$$choice2~0_In120170728} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 19:59:04,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-416530518 256)))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite26_Out-416530518| ~a$w_buff0_used~0_In-416530518) (= |P2Thread1of1ForFork1_#t~ite26_Out-416530518| |P2Thread1of1ForFork1_#t~ite27_Out-416530518|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-416530518 256) 0))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In-416530518 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-416530518 256)) (and (= (mod ~a$w_buff1_used~0_In-416530518 256) 0) .cse1)))) (and (= |P2Thread1of1ForFork1_#t~ite27_Out-416530518| ~a$w_buff0_used~0_In-416530518) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite26_In-416530518| |P2Thread1of1ForFork1_#t~ite26_Out-416530518|)))) InVars {P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-416530518|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-416530518, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-416530518, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-416530518, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-416530518, ~weak$$choice2~0=~weak$$choice2~0_In-416530518} OutVars{P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-416530518|, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-416530518|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-416530518, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-416530518, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-416530518, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-416530518, ~weak$$choice2~0=~weak$$choice2~0_In-416530518} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-18 19:59:04,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~a$r_buff0_thd3~0_48 v_~a$r_buff0_thd3~0_47)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33, ~a$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 19:59:04,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L815-->L819: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_20 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_20, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite37, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 19:59:04,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L819-2-->L819-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-511651840 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-511651840 256) 0))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In-511651840 |P2Thread1of1ForFork1_#t~ite38_Out-511651840|)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite38_Out-511651840| ~a~0_In-511651840)))) InVars {~a~0=~a~0_In-511651840, ~a$w_buff1~0=~a$w_buff1~0_In-511651840, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-511651840, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-511651840} OutVars{~a~0=~a~0_In-511651840, P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-511651840|, ~a$w_buff1~0=~a$w_buff1~0_In-511651840, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-511651840, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-511651840} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-18 19:59:04,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-4-->L820: Formula: (= v_~a~0_18 |v_P2Thread1of1ForFork1_#t~ite38_8|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_8|} OutVars{~a~0=v_~a~0_18, P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_7|, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite38, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-18 19:59:04,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1219529006 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1219529006 256)))) (or (and (= ~a$w_buff0_used~0_In-1219529006 |P2Thread1of1ForFork1_#t~ite40_Out-1219529006|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite40_Out-1219529006| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1219529006, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1219529006} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1219529006, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1219529006, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-1219529006|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-18 19:59:04,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In618374596 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In618374596 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In618374596 256))) (.cse3 (= (mod ~a$r_buff0_thd3~0_In618374596 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In618374596 |P2Thread1of1ForFork1_#t~ite41_Out618374596|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite41_Out618374596|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In618374596, ~a$w_buff0_used~0=~a$w_buff0_used~0_In618374596, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In618374596, ~a$w_buff1_used~0=~a$w_buff1_used~0_In618374596} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In618374596, ~a$w_buff0_used~0=~a$w_buff0_used~0_In618374596, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In618374596, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out618374596|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In618374596} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-18 19:59:04,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1751994025 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1751994025 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite42_Out-1751994025|) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd3~0_In-1751994025 |P2Thread1of1ForFork1_#t~ite42_Out-1751994025|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1751994025, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1751994025} OutVars{P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-1751994025|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1751994025, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1751994025} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-18 19:59:04,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L823-->L823-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In101635706 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In101635706 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In101635706 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In101635706 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In101635706 |P2Thread1of1ForFork1_#t~ite43_Out101635706|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork1_#t~ite43_Out101635706|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In101635706, ~a$w_buff0_used~0=~a$w_buff0_used~0_In101635706, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In101635706, ~a$w_buff1_used~0=~a$w_buff1_used~0_In101635706} OutVars{P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out101635706|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In101635706, ~a$w_buff0_used~0=~a$w_buff0_used~0_In101635706, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In101635706, ~a$w_buff1_used~0=~a$w_buff1_used~0_In101635706} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-18 19:59:04,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~a$r_buff1_thd3~0_40 |v_P2Thread1of1ForFork1_#t~ite43_8|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_40, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 19:59:04,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-528215835 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-528215835 256) 0))) (or (and (= ~a$w_buff0_used~0_In-528215835 |P0Thread1of1ForFork2_#t~ite5_Out-528215835|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork2_#t~ite5_Out-528215835|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-528215835, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-528215835} OutVars{P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out-528215835|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-528215835, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-528215835} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 19:59:04,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L762-->L762-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In889029644 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In889029644 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In889029644 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In889029644 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In889029644 |P0Thread1of1ForFork2_#t~ite6_Out889029644|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork2_#t~ite6_Out889029644| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In889029644, ~a$w_buff0_used~0=~a$w_buff0_used~0_In889029644, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In889029644, ~a$w_buff1_used~0=~a$w_buff1_used~0_In889029644} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In889029644, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out889029644|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In889029644, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In889029644, ~a$w_buff1_used~0=~a$w_buff1_used~0_In889029644} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 19:59:04,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L763-->L764: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-1157535485 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1157535485 256) 0))) (or (and (= ~a$r_buff0_thd1~0_In-1157535485 ~a$r_buff0_thd1~0_Out-1157535485) (or .cse0 .cse1)) (and (= 0 ~a$r_buff0_thd1~0_Out-1157535485) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1157535485, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1157535485} OutVars{P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-1157535485|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1157535485, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1157535485} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 19:59:04,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L764-->L764-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd1~0_In-1854237104 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1854237104 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1854237104 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1854237104 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork2_#t~ite8_Out-1854237104| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork2_#t~ite8_Out-1854237104| ~a$r_buff1_thd1~0_In-1854237104) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1854237104, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1854237104, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1854237104, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1854237104} OutVars{P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1854237104|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1854237104, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1854237104, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1854237104, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1854237104} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 19:59:04,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L764-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_8| v_~a$r_buff1_thd1~0_10)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_10, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, ~a$r_buff1_thd1~0, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 19:59:04,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L846-1-->L852: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 19:59:04,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L852-2-->L852-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In118774145 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In118774145 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out118774145| ~a~0_In118774145)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out118774145| ~a$w_buff1~0_In118774145) (not .cse1)))) InVars {~a~0=~a~0_In118774145, ~a$w_buff1~0=~a$w_buff1~0_In118774145, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In118774145, ~a$w_buff1_used~0=~a$w_buff1_used~0_In118774145} OutVars{~a~0=~a~0_In118774145, ~a$w_buff1~0=~a$w_buff1~0_In118774145, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out118774145|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In118774145, ~a$w_buff1_used~0=~a$w_buff1_used~0_In118774145} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 19:59:04,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L852-4-->L853: Formula: (= v_~a~0_22 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{~a~0=v_~a~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 19:59:04,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In856921416 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In856921416 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out856921416| ~a$w_buff0_used~0_In856921416)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out856921416| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In856921416, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In856921416} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In856921416, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out856921416|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In856921416} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 19:59:04,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L854-->L854-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In223237536 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In223237536 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In223237536 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In223237536 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In223237536 |ULTIMATE.start_main_#t~ite50_Out223237536|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite50_Out223237536|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In223237536, ~a$w_buff0_used~0=~a$w_buff0_used~0_In223237536, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In223237536, ~a$w_buff1_used~0=~a$w_buff1_used~0_In223237536} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out223237536|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In223237536, ~a$w_buff0_used~0=~a$w_buff0_used~0_In223237536, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In223237536, ~a$w_buff1_used~0=~a$w_buff1_used~0_In223237536} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 19:59:04,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1327952932 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1327952932 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-1327952932 |ULTIMATE.start_main_#t~ite51_Out-1327952932|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1327952932|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1327952932, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1327952932} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1327952932|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1327952932, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1327952932} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 19:59:04,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L856-->L856-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In726082605 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In726082605 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In726082605 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In726082605 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out726082605|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~a$r_buff1_thd0~0_In726082605 |ULTIMATE.start_main_#t~ite52_Out726082605|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In726082605, ~a$w_buff0_used~0=~a$w_buff0_used~0_In726082605, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In726082605, ~a$w_buff1_used~0=~a$w_buff1_used~0_In726082605} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out726082605|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In726082605, ~a$w_buff0_used~0=~a$w_buff0_used~0_In726082605, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In726082605, ~a$w_buff1_used~0=~a$w_buff1_used~0_In726082605} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 19:59:04,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= 1 v_~__unbuffered_p1_EAX~0_8) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_~__unbuffered_p0_EBX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_~__unbuffered_p0_EAX~0_8 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= |v_ULTIMATE.start_main_#t~ite52_12| v_~a$r_buff1_thd0~0_14)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 19:59:04,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:59:04 BasicIcfg [2019-12-18 19:59:04,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:59:04,942 INFO L168 Benchmark]: Toolchain (without parser) took 125743.47 ms. Allocated memory was 137.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 19:59:04,942 INFO L168 Benchmark]: CDTParser took 2.28 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 19:59:04,943 INFO L168 Benchmark]: CACSL2BoogieTranslator took 843.51 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.9 MB in the beginning and 152.7 MB in the end (delta: -51.8 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-12-18 19:59:04,943 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.16 ms. Allocated memory is still 201.3 MB. Free memory was 152.7 MB in the beginning and 149.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-18 19:59:04,943 INFO L168 Benchmark]: Boogie Preprocessor took 42.15 ms. Allocated memory is still 201.3 MB. Free memory was 149.7 MB in the beginning and 147.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 19:59:04,944 INFO L168 Benchmark]: RCFGBuilder took 848.20 ms. Allocated memory is still 201.3 MB. Free memory was 147.7 MB in the beginning and 95.9 MB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 7.1 GB. [2019-12-18 19:59:04,944 INFO L168 Benchmark]: TraceAbstraction took 123933.68 ms. Allocated memory was 201.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 95.9 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 19:59:04,946 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.28 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 843.51 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.9 MB in the beginning and 152.7 MB in the end (delta: -51.8 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.16 ms. Allocated memory is still 201.3 MB. Free memory was 152.7 MB in the beginning and 149.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.15 ms. Allocated memory is still 201.3 MB. Free memory was 149.7 MB in the beginning and 147.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 848.20 ms. Allocated memory is still 201.3 MB. Free memory was 147.7 MB in the beginning and 95.9 MB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 123933.68 ms. Allocated memory was 201.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 95.9 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 180 ProgramPointsBefore, 96 ProgramPointsAfterwards, 217 TransitionsBefore, 106 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 31 ChoiceCompositions, 7307 VarBasedMoverChecksPositive, 219 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 96061 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t38, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L744] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L745] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L746] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L747] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L748] 1 a$r_buff0_thd1 = (_Bool)1 [L751] 1 x = 1 [L754] 1 __unbuffered_p0_EAX = x [L757] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L774] 2 y = 1 [L777] 2 __unbuffered_p1_EAX = y [L780] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L760] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L783] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L786] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L846] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L797] 3 z = 1 [L800] 3 __unbuffered_p2_EAX = z [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L808] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L809] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L809] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L810] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L852] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L855] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 123.5s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 50.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9243 SDtfs, 12508 SDslu, 32477 SDs, 0 SdLazy, 24341 SolverSat, 664 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 557 GetRequests, 80 SyntacticMatches, 41 SemanticMatches, 436 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2198 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166753occurred 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: 43.4s AutomataMinimizationTime, 35 MinimizatonAttempts, 460483 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1882 NumberOfCodeBlocks, 1882 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1780 ConstructedInterpolants, 0 QuantifiedInterpolants, 420297 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...