/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:54:35,902 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:54:35,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:54:35,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:54:35,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:54:35,924 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:54:35,925 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:54:35,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:54:35,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:54:35,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:54:35,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:54:35,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:54:35,947 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:54:35,948 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:54:35,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:54:35,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:54:35,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:54:35,961 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:54:35,962 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:54:35,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:54:35,969 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:54:35,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:54:35,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:54:35,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:54:35,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:54:35,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:54:35,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:54:35,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:54:35,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:54:35,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:54:35,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:54:35,989 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:54:35,990 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:54:35,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:54:35,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:54:35,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:54:35,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:54:35,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:54:35,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:54:35,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:54:36,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:54:36,001 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-SemanticLbe.epf [2019-12-27 03:54:36,019 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:54:36,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:54:36,020 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:54:36,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:54:36,021 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:54:36,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:54:36,021 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:54:36,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:54:36,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:54:36,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:54:36,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:54:36,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:54:36,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:54:36,022 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:54:36,023 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:54:36,023 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:54:36,023 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:54:36,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:54:36,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:54:36,024 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:54:36,024 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:54:36,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:54:36,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:54:36,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:54:36,025 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:54:36,025 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:54:36,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:54:36,025 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:54:36,025 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:54:36,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:54:36,311 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:54:36,315 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:54:36,317 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:54:36,317 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:54:36,318 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_rmo.oepc.i [2019-12-27 03:54:36,397 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef75f1133/eb6f9b987a3b483b91476545c3cbdf77/FLAG4ce17b4fa [2019-12-27 03:54:36,958 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:54:36,959 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_rmo.oepc.i [2019-12-27 03:54:36,974 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef75f1133/eb6f9b987a3b483b91476545c3cbdf77/FLAG4ce17b4fa [2019-12-27 03:54:37,243 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef75f1133/eb6f9b987a3b483b91476545c3cbdf77 [2019-12-27 03:54:37,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:54:37,254 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:54:37,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:54:37,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:54:37,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:54:37,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:54:37" (1/1) ... [2019-12-27 03:54:37,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a539cca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:37, skipping insertion in model container [2019-12-27 03:54:37,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:54:37" (1/1) ... [2019-12-27 03:54:37,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:54:37,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:54:37,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:54:37,903 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:54:37,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:54:38,060 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:54:38,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:38 WrapperNode [2019-12-27 03:54:38,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:54:38,061 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:54:38,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:54:38,062 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:54:38,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:38" (1/1) ... [2019-12-27 03:54:38,097 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:38" (1/1) ... [2019-12-27 03:54:38,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:54:38,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:54:38,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:54:38,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:54:38,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:38" (1/1) ... [2019-12-27 03:54:38,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:38" (1/1) ... [2019-12-27 03:54:38,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:38" (1/1) ... [2019-12-27 03:54:38,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:38" (1/1) ... [2019-12-27 03:54:38,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:38" (1/1) ... [2019-12-27 03:54:38,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:38" (1/1) ... [2019-12-27 03:54:38,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:38" (1/1) ... [2019-12-27 03:54:38,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:54:38,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:54:38,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:54:38,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:54:38,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:54:38,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:54:38,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:54:38,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:54:38,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:54:38,265 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:54:38,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:54:38,265 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:54:38,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:54:38,266 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:54:38,266 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:54:38,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:54:38,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:54:38,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:54:38,268 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 03:54:38,998 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:54:38,999 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:54:39,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:54:39 BoogieIcfgContainer [2019-12-27 03:54:39,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:54:39,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:54:39,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:54:39,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:54:39,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:54:37" (1/3) ... [2019-12-27 03:54:39,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e013af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:54:39, skipping insertion in model container [2019-12-27 03:54:39,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:38" (2/3) ... [2019-12-27 03:54:39,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e013af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:54:39, skipping insertion in model container [2019-12-27 03:54:39,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:54:39" (3/3) ... [2019-12-27 03:54:39,010 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_rmo.oepc.i [2019-12-27 03:54:39,020 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:54:39,020 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:54:39,032 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:54:39,033 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:54:39,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,081 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,081 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,081 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,082 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,082 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,090 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,091 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,127 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,127 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,168 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,168 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,169 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,171 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,172 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,176 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,178 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:54:39,208 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:54:39,231 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:54:39,231 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:54:39,231 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:54:39,232 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:54:39,232 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:54:39,232 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:54:39,232 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:54:39,232 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:54:39,248 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 03:54:39,250 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 03:54:39,353 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 03:54:39,353 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:54:39,370 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 03:54:39,395 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 03:54:39,452 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 03:54:39,453 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:54:39,461 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 03:54:39,483 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 03:54:39,485 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:54:45,322 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 03:54:45,448 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 03:54:45,790 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-27 03:54:45,791 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 03:54:45,795 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-27 03:55:05,126 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-27 03:55:05,128 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-27 03:55:05,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 03:55:05,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:05,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 03:55:05,135 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-27 03:55:05,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:05,140 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-27 03:55:05,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:05,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149072652] [2019-12-27 03:55:05,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:05,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149072652] [2019-12-27 03:55:05,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:05,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:55:05,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990238691] [2019-12-27 03:55:05,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:55:05,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:05,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:55:05,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:55:05,466 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-27 03:55:09,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:09,036 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-27 03:55:09,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:55:09,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 03:55:09,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:09,651 INFO L225 Difference]: With dead ends: 110910 [2019-12-27 03:55:09,651 INFO L226 Difference]: Without dead ends: 98066 [2019-12-27 03:55:09,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:55:13,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-27 03:55:15,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-27 03:55:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-27 03:55:16,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-27 03:55:16,058 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-27 03:55:16,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:16,059 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-27 03:55:16,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:55:16,059 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-27 03:55:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:55:16,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:16,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:55:16,064 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-27 03:55:16,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:16,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-27 03:55:16,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:16,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595643343] [2019-12-27 03:55:16,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:16,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:16,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595643343] [2019-12-27 03:55:16,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:16,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:55:16,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348844033] [2019-12-27 03:55:16,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:55:16,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:16,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:55:16,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:55:16,161 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-27 03:55:20,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:20,632 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-27 03:55:20,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:55:20,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:55:20,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:21,222 INFO L225 Difference]: With dead ends: 156656 [2019-12-27 03:55:21,223 INFO L226 Difference]: Without dead ends: 156558 [2019-12-27 03:55:21,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:55:25,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-27 03:55:32,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-27 03:55:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-27 03:55:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-27 03:55:34,049 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-27 03:55:34,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:34,049 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-27 03:55:34,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:55:34,049 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-27 03:55:34,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:55:34,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:34,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:55:34,056 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-27 03:55:34,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:34,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-27 03:55:34,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:34,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206801144] [2019-12-27 03:55:34,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:34,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:34,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206801144] [2019-12-27 03:55:34,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:34,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:55:34,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132014426] [2019-12-27 03:55:34,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:55:34,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:34,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:55:34,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:55:34,110 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 3 states. [2019-12-27 03:55:34,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:34,240 INFO L93 Difference]: Finished difference Result 31386 states and 102018 transitions. [2019-12-27 03:55:34,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:55:34,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 03:55:34,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:34,303 INFO L225 Difference]: With dead ends: 31386 [2019-12-27 03:55:34,303 INFO L226 Difference]: Without dead ends: 31386 [2019-12-27 03:55:34,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:55:34,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31386 states. [2019-12-27 03:55:34,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31386 to 31386. [2019-12-27 03:55:34,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31386 states. [2019-12-27 03:55:34,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31386 states to 31386 states and 102018 transitions. [2019-12-27 03:55:34,922 INFO L78 Accepts]: Start accepts. Automaton has 31386 states and 102018 transitions. Word has length 13 [2019-12-27 03:55:34,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:34,923 INFO L462 AbstractCegarLoop]: Abstraction has 31386 states and 102018 transitions. [2019-12-27 03:55:34,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:55:34,924 INFO L276 IsEmpty]: Start isEmpty. Operand 31386 states and 102018 transitions. [2019-12-27 03:55:34,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 03:55:34,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:34,927 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:55:34,927 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-27 03:55:34,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:34,927 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-27 03:55:34,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:34,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821515503] [2019-12-27 03:55:34,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:35,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:35,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821515503] [2019-12-27 03:55:35,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:35,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:55:35,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867927950] [2019-12-27 03:55:35,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:55:35,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:35,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:55:35,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:55:35,019 INFO L87 Difference]: Start difference. First operand 31386 states and 102018 transitions. Second operand 5 states. [2019-12-27 03:55:35,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:35,541 INFO L93 Difference]: Finished difference Result 43205 states and 138515 transitions. [2019-12-27 03:55:35,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:55:35,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 03:55:35,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:35,639 INFO L225 Difference]: With dead ends: 43205 [2019-12-27 03:55:35,639 INFO L226 Difference]: Without dead ends: 43205 [2019-12-27 03:55:35,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:55:38,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43205 states. [2019-12-27 03:55:38,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43205 to 36470. [2019-12-27 03:55:38,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36470 states. [2019-12-27 03:55:38,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36470 states to 36470 states and 117941 transitions. [2019-12-27 03:55:38,614 INFO L78 Accepts]: Start accepts. Automaton has 36470 states and 117941 transitions. Word has length 16 [2019-12-27 03:55:38,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:38,615 INFO L462 AbstractCegarLoop]: Abstraction has 36470 states and 117941 transitions. [2019-12-27 03:55:38,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:55:38,615 INFO L276 IsEmpty]: Start isEmpty. Operand 36470 states and 117941 transitions. [2019-12-27 03:55:38,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:55:38,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:38,625 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-27 03:55:38,625 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-27 03:55:38,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:38,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-27 03:55:38,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:38,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779077440] [2019-12-27 03:55:38,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:38,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779077440] [2019-12-27 03:55:38,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:38,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:55:38,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61405697] [2019-12-27 03:55:38,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:55:38,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:38,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:55:38,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:55:38,772 INFO L87 Difference]: Start difference. First operand 36470 states and 117941 transitions. Second operand 6 states. [2019-12-27 03:55:39,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:39,699 INFO L93 Difference]: Finished difference Result 56051 states and 176371 transitions. [2019-12-27 03:55:39,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:55:39,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 03:55:39,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:39,791 INFO L225 Difference]: With dead ends: 56051 [2019-12-27 03:55:39,791 INFO L226 Difference]: Without dead ends: 56037 [2019-12-27 03:55:39,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:55:39,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56037 states. [2019-12-27 03:55:40,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56037 to 37420. [2019-12-27 03:55:40,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37420 states. [2019-12-27 03:55:40,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37420 states to 37420 states and 120221 transitions. [2019-12-27 03:55:40,892 INFO L78 Accepts]: Start accepts. Automaton has 37420 states and 120221 transitions. Word has length 22 [2019-12-27 03:55:40,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:40,893 INFO L462 AbstractCegarLoop]: Abstraction has 37420 states and 120221 transitions. [2019-12-27 03:55:40,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:55:40,893 INFO L276 IsEmpty]: Start isEmpty. Operand 37420 states and 120221 transitions. [2019-12-27 03:55:40,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:55:40,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:40,908 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:55:40,908 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-27 03:55:40,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:40,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-27 03:55:40,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:40,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976475481] [2019-12-27 03:55:40,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:40,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976475481] [2019-12-27 03:55:40,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:40,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:55:40,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048247983] [2019-12-27 03:55:40,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:55:40,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:40,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:55:40,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:55:40,973 INFO L87 Difference]: Start difference. First operand 37420 states and 120221 transitions. Second operand 4 states. [2019-12-27 03:55:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:41,048 INFO L93 Difference]: Finished difference Result 15281 states and 46378 transitions. [2019-12-27 03:55:41,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:55:41,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 03:55:41,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:41,069 INFO L225 Difference]: With dead ends: 15281 [2019-12-27 03:55:41,070 INFO L226 Difference]: Without dead ends: 15281 [2019-12-27 03:55:41,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:55:41,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15281 states. [2019-12-27 03:55:41,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15281 to 15023. [2019-12-27 03:55:41,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2019-12-27 03:55:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 45642 transitions. [2019-12-27 03:55:41,290 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 45642 transitions. Word has length 25 [2019-12-27 03:55:41,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:41,290 INFO L462 AbstractCegarLoop]: Abstraction has 15023 states and 45642 transitions. [2019-12-27 03:55:41,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:55:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 45642 transitions. [2019-12-27 03:55:41,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 03:55:41,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:41,300 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:55:41,301 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-27 03:55:41,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:41,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-27 03:55:41,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:41,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124329821] [2019-12-27 03:55:41,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:41,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124329821] [2019-12-27 03:55:41,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:41,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:55:41,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501790776] [2019-12-27 03:55:41,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:55:41,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:41,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:55:41,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:55:41,441 INFO L87 Difference]: Start difference. First operand 15023 states and 45642 transitions. Second operand 6 states. [2019-12-27 03:55:42,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:42,005 INFO L93 Difference]: Finished difference Result 21679 states and 63968 transitions. [2019-12-27 03:55:42,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 03:55:42,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 03:55:42,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:42,038 INFO L225 Difference]: With dead ends: 21679 [2019-12-27 03:55:42,038 INFO L226 Difference]: Without dead ends: 21679 [2019-12-27 03:55:42,038 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-27 03:55:42,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2019-12-27 03:55:42,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 17339. [2019-12-27 03:55:42,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17339 states. [2019-12-27 03:55:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17339 states to 17339 states and 52223 transitions. [2019-12-27 03:55:42,320 INFO L78 Accepts]: Start accepts. Automaton has 17339 states and 52223 transitions. Word has length 27 [2019-12-27 03:55:42,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:42,321 INFO L462 AbstractCegarLoop]: Abstraction has 17339 states and 52223 transitions. [2019-12-27 03:55:42,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:55:42,321 INFO L276 IsEmpty]: Start isEmpty. Operand 17339 states and 52223 transitions. [2019-12-27 03:55:42,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 03:55:42,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:42,338 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:55:42,339 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-27 03:55:42,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:42,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-27 03:55:42,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:42,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766351923] [2019-12-27 03:55:42,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:42,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:42,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766351923] [2019-12-27 03:55:42,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:42,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:55:42,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663339047] [2019-12-27 03:55:42,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:55:42,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:42,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:55:42,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:55:42,484 INFO L87 Difference]: Start difference. First operand 17339 states and 52223 transitions. Second operand 7 states. [2019-12-27 03:55:43,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:43,698 INFO L93 Difference]: Finished difference Result 24589 states and 72044 transitions. [2019-12-27 03:55:43,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 03:55:43,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 03:55:43,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:43,738 INFO L225 Difference]: With dead ends: 24589 [2019-12-27 03:55:43,738 INFO L226 Difference]: Without dead ends: 24589 [2019-12-27 03:55:43,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 03:55:43,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24589 states. [2019-12-27 03:55:44,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24589 to 16666. [2019-12-27 03:55:44,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16666 states. [2019-12-27 03:55:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 50150 transitions. [2019-12-27 03:55:44,323 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 50150 transitions. Word has length 33 [2019-12-27 03:55:44,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:44,324 INFO L462 AbstractCegarLoop]: Abstraction has 16666 states and 50150 transitions. [2019-12-27 03:55:44,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:55:44,324 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 50150 transitions. [2019-12-27 03:55:44,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 03:55:44,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:44,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:55:44,351 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-27 03:55:44,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:44,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1641373212, now seen corresponding path program 1 times [2019-12-27 03:55:44,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:44,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767845701] [2019-12-27 03:55:44,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:44,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767845701] [2019-12-27 03:55:44,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:44,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:55:44,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586807605] [2019-12-27 03:55:44,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:55:44,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:44,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:55:44,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:55:44,419 INFO L87 Difference]: Start difference. First operand 16666 states and 50150 transitions. Second operand 3 states. [2019-12-27 03:55:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:44,478 INFO L93 Difference]: Finished difference Result 16665 states and 50148 transitions. [2019-12-27 03:55:44,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:55:44,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 03:55:44,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:44,500 INFO L225 Difference]: With dead ends: 16665 [2019-12-27 03:55:44,501 INFO L226 Difference]: Without dead ends: 16665 [2019-12-27 03:55:44,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:55:44,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16665 states. [2019-12-27 03:55:44,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16665 to 16665. [2019-12-27 03:55:44,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16665 states. [2019-12-27 03:55:44,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16665 states to 16665 states and 50148 transitions. [2019-12-27 03:55:44,724 INFO L78 Accepts]: Start accepts. Automaton has 16665 states and 50148 transitions. Word has length 39 [2019-12-27 03:55:44,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:44,724 INFO L462 AbstractCegarLoop]: Abstraction has 16665 states and 50148 transitions. [2019-12-27 03:55:44,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:55:44,724 INFO L276 IsEmpty]: Start isEmpty. Operand 16665 states and 50148 transitions. [2019-12-27 03:55:44,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:55:44,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:44,743 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-27 03:55:44,744 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-27 03:55:44,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:44,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1450973103, now seen corresponding path program 1 times [2019-12-27 03:55:44,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:44,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835264017] [2019-12-27 03:55:44,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:44,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:44,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835264017] [2019-12-27 03:55:44,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:44,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:55:44,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083155245] [2019-12-27 03:55:44,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:55:44,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:44,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:55:44,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:55:44,813 INFO L87 Difference]: Start difference. First operand 16665 states and 50148 transitions. Second operand 4 states. [2019-12-27 03:55:44,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:44,903 INFO L93 Difference]: Finished difference Result 31503 states and 94864 transitions. [2019-12-27 03:55:44,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:55:44,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 03:55:44,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:44,926 INFO L225 Difference]: With dead ends: 31503 [2019-12-27 03:55:44,926 INFO L226 Difference]: Without dead ends: 16332 [2019-12-27 03:55:44,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:55:44,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16332 states. [2019-12-27 03:55:45,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16332 to 16328. [2019-12-27 03:55:45,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16328 states. [2019-12-27 03:55:45,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16328 states to 16328 states and 48458 transitions. [2019-12-27 03:55:45,144 INFO L78 Accepts]: Start accepts. Automaton has 16328 states and 48458 transitions. Word has length 40 [2019-12-27 03:55:45,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:45,144 INFO L462 AbstractCegarLoop]: Abstraction has 16328 states and 48458 transitions. [2019-12-27 03:55:45,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:55:45,144 INFO L276 IsEmpty]: Start isEmpty. Operand 16328 states and 48458 transitions. [2019-12-27 03:55:45,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:55:45,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:45,162 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-27 03:55:45,162 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-27 03:55:45,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:45,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1753570543, now seen corresponding path program 2 times [2019-12-27 03:55:45,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:45,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867191201] [2019-12-27 03:55:45,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:45,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867191201] [2019-12-27 03:55:45,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:45,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:55:45,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056851121] [2019-12-27 03:55:45,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:55:45,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:45,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:55:45,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:55:45,234 INFO L87 Difference]: Start difference. First operand 16328 states and 48458 transitions. Second operand 5 states. [2019-12-27 03:55:45,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:45,325 INFO L93 Difference]: Finished difference Result 15204 states and 45885 transitions. [2019-12-27 03:55:45,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:55:45,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 03:55:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:45,351 INFO L225 Difference]: With dead ends: 15204 [2019-12-27 03:55:45,351 INFO L226 Difference]: Without dead ends: 14710 [2019-12-27 03:55:45,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:55:45,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14710 states. [2019-12-27 03:55:45,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14710 to 14213. [2019-12-27 03:55:45,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14213 states. [2019-12-27 03:55:45,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14213 states to 14213 states and 43578 transitions. [2019-12-27 03:55:45,567 INFO L78 Accepts]: Start accepts. Automaton has 14213 states and 43578 transitions. Word has length 40 [2019-12-27 03:55:45,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:45,567 INFO L462 AbstractCegarLoop]: Abstraction has 14213 states and 43578 transitions. [2019-12-27 03:55:45,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:55:45,567 INFO L276 IsEmpty]: Start isEmpty. Operand 14213 states and 43578 transitions. [2019-12-27 03:55:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:55:45,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:45,583 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-27 03:55:45,583 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-27 03:55:45,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:45,583 INFO L82 PathProgramCache]: Analyzing trace with hash -48564843, now seen corresponding path program 1 times [2019-12-27 03:55:45,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:45,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790526467] [2019-12-27 03:55:45,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:45,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:45,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790526467] [2019-12-27 03:55:45,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:45,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:55:45,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313139174] [2019-12-27 03:55:45,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:55:45,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:45,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:55:45,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:55:45,649 INFO L87 Difference]: Start difference. First operand 14213 states and 43578 transitions. Second operand 3 states. [2019-12-27 03:55:45,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:45,788 INFO L93 Difference]: Finished difference Result 21231 states and 65206 transitions. [2019-12-27 03:55:45,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:55:45,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 03:55:45,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:45,833 INFO L225 Difference]: With dead ends: 21231 [2019-12-27 03:55:45,833 INFO L226 Difference]: Without dead ends: 21231 [2019-12-27 03:55:45,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:55:45,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21231 states. [2019-12-27 03:55:46,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21231 to 15723. [2019-12-27 03:55:46,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15723 states. [2019-12-27 03:55:46,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15723 states to 15723 states and 48991 transitions. [2019-12-27 03:55:46,220 INFO L78 Accepts]: Start accepts. Automaton has 15723 states and 48991 transitions. Word has length 64 [2019-12-27 03:55:46,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:46,221 INFO L462 AbstractCegarLoop]: Abstraction has 15723 states and 48991 transitions. [2019-12-27 03:55:46,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:55:46,221 INFO L276 IsEmpty]: Start isEmpty. Operand 15723 states and 48991 transitions. [2019-12-27 03:55:46,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:55:46,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:46,238 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-27 03:55:46,238 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-27 03:55:46,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:46,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1559426519, now seen corresponding path program 1 times [2019-12-27 03:55:46,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:46,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625151574] [2019-12-27 03:55:46,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:46,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-27 03:55:46,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625151574] [2019-12-27 03:55:46,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:46,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:55:46,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590233785] [2019-12-27 03:55:46,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:55:46,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:46,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:55:46,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:55:46,458 INFO L87 Difference]: Start difference. First operand 15723 states and 48991 transitions. Second operand 7 states. [2019-12-27 03:55:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:46,971 INFO L93 Difference]: Finished difference Result 46938 states and 144585 transitions. [2019-12-27 03:55:46,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:55:46,972 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 03:55:46,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:47,020 INFO L225 Difference]: With dead ends: 46938 [2019-12-27 03:55:47,020 INFO L226 Difference]: Without dead ends: 33282 [2019-12-27 03:55:47,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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-27 03:55:47,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33282 states. [2019-12-27 03:55:47,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33282 to 18382. [2019-12-27 03:55:47,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18382 states. [2019-12-27 03:55:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18382 states to 18382 states and 57406 transitions. [2019-12-27 03:55:47,397 INFO L78 Accepts]: Start accepts. Automaton has 18382 states and 57406 transitions. Word has length 64 [2019-12-27 03:55:47,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:47,397 INFO L462 AbstractCegarLoop]: Abstraction has 18382 states and 57406 transitions. [2019-12-27 03:55:47,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:55:47,398 INFO L276 IsEmpty]: Start isEmpty. Operand 18382 states and 57406 transitions. [2019-12-27 03:55:47,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:55:47,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:47,426 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-27 03:55:47,426 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-27 03:55:47,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:47,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1388462743, now seen corresponding path program 2 times [2019-12-27 03:55:47,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:47,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127357613] [2019-12-27 03:55:47,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:47,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:47,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127357613] [2019-12-27 03:55:47,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:47,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:55:47,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982010951] [2019-12-27 03:55:47,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:55:47,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:47,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:55:47,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:55:47,518 INFO L87 Difference]: Start difference. First operand 18382 states and 57406 transitions. Second operand 7 states. [2019-12-27 03:55:48,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:48,045 INFO L93 Difference]: Finished difference Result 51331 states and 159915 transitions. [2019-12-27 03:55:48,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 03:55:48,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 03:55:48,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:48,102 INFO L225 Difference]: With dead ends: 51331 [2019-12-27 03:55:48,102 INFO L226 Difference]: Without dead ends: 39815 [2019-12-27 03:55:48,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:55:48,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39815 states. [2019-12-27 03:55:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39815 to 21811. [2019-12-27 03:55:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21811 states. [2019-12-27 03:55:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21811 states to 21811 states and 68616 transitions. [2019-12-27 03:55:48,559 INFO L78 Accepts]: Start accepts. Automaton has 21811 states and 68616 transitions. Word has length 64 [2019-12-27 03:55:48,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:48,559 INFO L462 AbstractCegarLoop]: Abstraction has 21811 states and 68616 transitions. [2019-12-27 03:55:48,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:55:48,559 INFO L276 IsEmpty]: Start isEmpty. Operand 21811 states and 68616 transitions. [2019-12-27 03:55:48,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:55:48,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:48,589 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-27 03:55:48,590 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-27 03:55:48,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:48,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1026171661, now seen corresponding path program 3 times [2019-12-27 03:55:48,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:48,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61346413] [2019-12-27 03:55:48,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:48,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61346413] [2019-12-27 03:55:48,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:48,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:55:48,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273806716] [2019-12-27 03:55:48,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:55:48,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:48,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:55:48,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:55:48,699 INFO L87 Difference]: Start difference. First operand 21811 states and 68616 transitions. Second operand 7 states. [2019-12-27 03:55:49,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:49,341 INFO L93 Difference]: Finished difference Result 45057 states and 140142 transitions. [2019-12-27 03:55:49,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:55:49,342 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 03:55:49,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:49,410 INFO L225 Difference]: With dead ends: 45057 [2019-12-27 03:55:49,411 INFO L226 Difference]: Without dead ends: 40843 [2019-12-27 03:55:49,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:55:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40843 states. [2019-12-27 03:55:49,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40843 to 22027. [2019-12-27 03:55:49,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22027 states. [2019-12-27 03:55:49,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22027 states to 22027 states and 69303 transitions. [2019-12-27 03:55:49,868 INFO L78 Accepts]: Start accepts. Automaton has 22027 states and 69303 transitions. Word has length 64 [2019-12-27 03:55:49,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:49,869 INFO L462 AbstractCegarLoop]: Abstraction has 22027 states and 69303 transitions. [2019-12-27 03:55:49,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:55:49,869 INFO L276 IsEmpty]: Start isEmpty. Operand 22027 states and 69303 transitions. [2019-12-27 03:55:49,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:55:49,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:49,897 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-27 03:55:49,897 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-27 03:55:49,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:49,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1087297877, now seen corresponding path program 4 times [2019-12-27 03:55:49,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:49,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122739138] [2019-12-27 03:55:49,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:49,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122739138] [2019-12-27 03:55:49,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:49,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:55:49,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997114757] [2019-12-27 03:55:49,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:55:49,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:49,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:55:49,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:55:49,990 INFO L87 Difference]: Start difference. First operand 22027 states and 69303 transitions. Second operand 5 states. [2019-12-27 03:55:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:50,580 INFO L93 Difference]: Finished difference Result 34201 states and 104680 transitions. [2019-12-27 03:55:50,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:55:50,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-27 03:55:50,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:50,630 INFO L225 Difference]: With dead ends: 34201 [2019-12-27 03:55:50,631 INFO L226 Difference]: Without dead ends: 34033 [2019-12-27 03:55:50,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:55:50,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34033 states. [2019-12-27 03:55:51,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34033 to 28062. [2019-12-27 03:55:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28062 states. [2019-12-27 03:55:51,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28062 states to 28062 states and 87165 transitions. [2019-12-27 03:55:51,109 INFO L78 Accepts]: Start accepts. Automaton has 28062 states and 87165 transitions. Word has length 64 [2019-12-27 03:55:51,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:51,109 INFO L462 AbstractCegarLoop]: Abstraction has 28062 states and 87165 transitions. [2019-12-27 03:55:51,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:55:51,109 INFO L276 IsEmpty]: Start isEmpty. Operand 28062 states and 87165 transitions. [2019-12-27 03:55:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:55:51,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:51,141 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:55:51,141 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-27 03:55:51,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:51,142 INFO L82 PathProgramCache]: Analyzing trace with hash -738203667, now seen corresponding path program 5 times [2019-12-27 03:55:51,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:51,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458229482] [2019-12-27 03:55:51,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:51,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:51,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458229482] [2019-12-27 03:55:51,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:51,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:55:51,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115650663] [2019-12-27 03:55:51,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:55:51,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:51,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:55:51,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:55:51,234 INFO L87 Difference]: Start difference. First operand 28062 states and 87165 transitions. Second operand 5 states. [2019-12-27 03:55:51,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:51,757 INFO L93 Difference]: Finished difference Result 30014 states and 92644 transitions. [2019-12-27 03:55:51,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:55:51,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-27 03:55:51,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:51,825 INFO L225 Difference]: With dead ends: 30014 [2019-12-27 03:55:51,825 INFO L226 Difference]: Without dead ends: 30014 [2019-12-27 03:55:51,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:55:51,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30014 states. [2019-12-27 03:55:52,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30014 to 28475. [2019-12-27 03:55:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28475 states. [2019-12-27 03:55:52,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28475 states to 28475 states and 88433 transitions. [2019-12-27 03:55:52,552 INFO L78 Accepts]: Start accepts. Automaton has 28475 states and 88433 transitions. Word has length 64 [2019-12-27 03:55:52,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:52,552 INFO L462 AbstractCegarLoop]: Abstraction has 28475 states and 88433 transitions. [2019-12-27 03:55:52,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:55:52,552 INFO L276 IsEmpty]: Start isEmpty. Operand 28475 states and 88433 transitions. [2019-12-27 03:55:52,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:55:52,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:52,585 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-27 03:55:52,585 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-27 03:55:52,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:52,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2028716035, now seen corresponding path program 6 times [2019-12-27 03:55:52,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:52,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283605887] [2019-12-27 03:55:52,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:52,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283605887] [2019-12-27 03:55:52,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:52,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:55:52,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987647516] [2019-12-27 03:55:52,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:55:52,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:52,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:55:52,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:55:52,678 INFO L87 Difference]: Start difference. First operand 28475 states and 88433 transitions. Second operand 6 states. [2019-12-27 03:55:53,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:53,528 INFO L93 Difference]: Finished difference Result 48040 states and 146628 transitions. [2019-12-27 03:55:53,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:55:53,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 03:55:53,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:53,596 INFO L225 Difference]: With dead ends: 48040 [2019-12-27 03:55:53,596 INFO L226 Difference]: Without dead ends: 47747 [2019-12-27 03:55:53,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:55:53,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47747 states. [2019-12-27 03:55:54,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47747 to 36218. [2019-12-27 03:55:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36218 states. [2019-12-27 03:55:54,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36218 states to 36218 states and 112422 transitions. [2019-12-27 03:55:54,223 INFO L78 Accepts]: Start accepts. Automaton has 36218 states and 112422 transitions. Word has length 64 [2019-12-27 03:55:54,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:54,223 INFO L462 AbstractCegarLoop]: Abstraction has 36218 states and 112422 transitions. [2019-12-27 03:55:54,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:55:54,224 INFO L276 IsEmpty]: Start isEmpty. Operand 36218 states and 112422 transitions. [2019-12-27 03:55:54,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:55:54,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:54,281 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-27 03:55:54,281 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-27 03:55:54,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:54,281 INFO L82 PathProgramCache]: Analyzing trace with hash -2089785517, now seen corresponding path program 7 times [2019-12-27 03:55:54,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:54,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99181254] [2019-12-27 03:55:54,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:54,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:54,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99181254] [2019-12-27 03:55:54,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:54,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:55:54,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421758586] [2019-12-27 03:55:54,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:55:54,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:54,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:55:54,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:55:54,386 INFO L87 Difference]: Start difference. First operand 36218 states and 112422 transitions. Second operand 3 states. [2019-12-27 03:55:54,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:54,563 INFO L93 Difference]: Finished difference Result 36218 states and 112421 transitions. [2019-12-27 03:55:54,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:55:54,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 03:55:54,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:54,648 INFO L225 Difference]: With dead ends: 36218 [2019-12-27 03:55:54,648 INFO L226 Difference]: Without dead ends: 36218 [2019-12-27 03:55:54,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:55:54,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36218 states. [2019-12-27 03:55:55,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36218 to 31693. [2019-12-27 03:55:55,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31693 states. [2019-12-27 03:55:55,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31693 states to 31693 states and 99497 transitions. [2019-12-27 03:55:55,683 INFO L78 Accepts]: Start accepts. Automaton has 31693 states and 99497 transitions. Word has length 64 [2019-12-27 03:55:55,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:55,683 INFO L462 AbstractCegarLoop]: Abstraction has 31693 states and 99497 transitions. [2019-12-27 03:55:55,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:55:55,683 INFO L276 IsEmpty]: Start isEmpty. Operand 31693 states and 99497 transitions. [2019-12-27 03:55:55,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:55:55,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:55,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:55:55,720 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-27 03:55:55,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:55,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1914914851, now seen corresponding path program 1 times [2019-12-27 03:55:55,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:55,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775245929] [2019-12-27 03:55:55,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:55,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:55,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775245929] [2019-12-27 03:55:55,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:55,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:55:55,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061941495] [2019-12-27 03:55:55,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:55:55,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:55,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:55:55,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:55:55,818 INFO L87 Difference]: Start difference. First operand 31693 states and 99497 transitions. Second operand 6 states. [2019-12-27 03:55:56,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:56,457 INFO L93 Difference]: Finished difference Result 33466 states and 104373 transitions. [2019-12-27 03:55:56,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:55:56,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 03:55:56,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:56,534 INFO L225 Difference]: With dead ends: 33466 [2019-12-27 03:55:56,535 INFO L226 Difference]: Without dead ends: 33466 [2019-12-27 03:55:56,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:55:56,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33466 states. [2019-12-27 03:55:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33466 to 31726. [2019-12-27 03:55:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31726 states. [2019-12-27 03:55:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31726 states to 31726 states and 99597 transitions. [2019-12-27 03:55:57,116 INFO L78 Accepts]: Start accepts. Automaton has 31726 states and 99597 transitions. Word has length 65 [2019-12-27 03:55:57,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:57,117 INFO L462 AbstractCegarLoop]: Abstraction has 31726 states and 99597 transitions. [2019-12-27 03:55:57,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:55:57,117 INFO L276 IsEmpty]: Start isEmpty. Operand 31726 states and 99597 transitions. [2019-12-27 03:55:57,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:55:57,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:57,151 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:55:57,151 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-27 03:55:57,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:57,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1796094165, now seen corresponding path program 2 times [2019-12-27 03:55:57,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:57,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408053402] [2019-12-27 03:55:57,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:57,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408053402] [2019-12-27 03:55:57,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:57,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:55:57,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214954097] [2019-12-27 03:55:57,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:55:57,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:57,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:55:57,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:55:57,251 INFO L87 Difference]: Start difference. First operand 31726 states and 99597 transitions. Second operand 3 states. [2019-12-27 03:55:57,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:55:57,352 INFO L93 Difference]: Finished difference Result 23388 states and 72333 transitions. [2019-12-27 03:55:57,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:55:57,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 03:55:57,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:55:57,393 INFO L225 Difference]: With dead ends: 23388 [2019-12-27 03:55:57,393 INFO L226 Difference]: Without dead ends: 23388 [2019-12-27 03:55:57,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:55:57,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23388 states. [2019-12-27 03:55:57,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23388 to 22384. [2019-12-27 03:55:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22384 states. [2019-12-27 03:55:57,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22384 states to 22384 states and 69136 transitions. [2019-12-27 03:55:57,723 INFO L78 Accepts]: Start accepts. Automaton has 22384 states and 69136 transitions. Word has length 65 [2019-12-27 03:55:57,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:55:57,723 INFO L462 AbstractCegarLoop]: Abstraction has 22384 states and 69136 transitions. [2019-12-27 03:55:57,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:55:57,723 INFO L276 IsEmpty]: Start isEmpty. Operand 22384 states and 69136 transitions. [2019-12-27 03:55:57,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:55:57,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:55:57,745 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-27 03:55:57,745 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-27 03:55:57,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:55:57,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1860630415, now seen corresponding path program 1 times [2019-12-27 03:55:57,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:55:57,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583451985] [2019-12-27 03:55:57,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:55:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:55:57,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:55:57,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583451985] [2019-12-27 03:55:57,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:55:57,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:55:57,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624310128] [2019-12-27 03:55:57,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:55:57,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:55:57,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:55:57,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:55:57,862 INFO L87 Difference]: Start difference. First operand 22384 states and 69136 transitions. Second operand 8 states. [2019-12-27 03:56:00,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:00,810 INFO L93 Difference]: Finished difference Result 36775 states and 110702 transitions. [2019-12-27 03:56:00,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 03:56:00,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 03:56:00,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:00,893 INFO L225 Difference]: With dead ends: 36775 [2019-12-27 03:56:00,893 INFO L226 Difference]: Without dead ends: 36503 [2019-12-27 03:56:00,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-27 03:56:01,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36503 states. [2019-12-27 03:56:01,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36503 to 24201. [2019-12-27 03:56:01,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24201 states. [2019-12-27 03:56:01,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24201 states to 24201 states and 74702 transitions. [2019-12-27 03:56:01,632 INFO L78 Accepts]: Start accepts. Automaton has 24201 states and 74702 transitions. Word has length 66 [2019-12-27 03:56:01,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:01,632 INFO L462 AbstractCegarLoop]: Abstraction has 24201 states and 74702 transitions. [2019-12-27 03:56:01,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:56:01,632 INFO L276 IsEmpty]: Start isEmpty. Operand 24201 states and 74702 transitions. [2019-12-27 03:56:01,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:56:01,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:01,659 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-27 03:56:01,659 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-27 03:56:01,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:01,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1036503919, now seen corresponding path program 2 times [2019-12-27 03:56:01,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:01,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830716647] [2019-12-27 03:56:01,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:56:01,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830716647] [2019-12-27 03:56:01,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:01,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:56:01,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599077523] [2019-12-27 03:56:01,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:56:01,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:01,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:56:01,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:56:01,775 INFO L87 Difference]: Start difference. First operand 24201 states and 74702 transitions. Second operand 9 states. [2019-12-27 03:56:03,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:03,263 INFO L93 Difference]: Finished difference Result 45743 states and 140753 transitions. [2019-12-27 03:56:03,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 03:56:03,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 03:56:03,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:03,320 INFO L225 Difference]: With dead ends: 45743 [2019-12-27 03:56:03,320 INFO L226 Difference]: Without dead ends: 36796 [2019-12-27 03:56:03,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 03:56:03,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36796 states. [2019-12-27 03:56:03,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36796 to 24806. [2019-12-27 03:56:03,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24806 states. [2019-12-27 03:56:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24806 states to 24806 states and 76001 transitions. [2019-12-27 03:56:03,778 INFO L78 Accepts]: Start accepts. Automaton has 24806 states and 76001 transitions. Word has length 66 [2019-12-27 03:56:03,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:03,779 INFO L462 AbstractCegarLoop]: Abstraction has 24806 states and 76001 transitions. [2019-12-27 03:56:03,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:56:03,779 INFO L276 IsEmpty]: Start isEmpty. Operand 24806 states and 76001 transitions. [2019-12-27 03:56:03,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:56:03,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:03,807 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-27 03:56:03,807 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-27 03:56:03,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:03,807 INFO L82 PathProgramCache]: Analyzing trace with hash 216698061, now seen corresponding path program 3 times [2019-12-27 03:56:03,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:03,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090015524] [2019-12-27 03:56:03,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:56:03,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090015524] [2019-12-27 03:56:03,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:03,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:56:03,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609827324] [2019-12-27 03:56:03,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:56:03,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:03,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:56:03,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:56:03,980 INFO L87 Difference]: Start difference. First operand 24806 states and 76001 transitions. Second operand 11 states. [2019-12-27 03:56:05,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:05,353 INFO L93 Difference]: Finished difference Result 49982 states and 152918 transitions. [2019-12-27 03:56:05,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 03:56:05,353 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 03:56:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:05,410 INFO L225 Difference]: With dead ends: 49982 [2019-12-27 03:56:05,410 INFO L226 Difference]: Without dead ends: 40195 [2019-12-27 03:56:05,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 03:56:05,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40195 states. [2019-12-27 03:56:06,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40195 to 23864. [2019-12-27 03:56:06,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23864 states. [2019-12-27 03:56:06,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23864 states to 23864 states and 73092 transitions. [2019-12-27 03:56:06,045 INFO L78 Accepts]: Start accepts. Automaton has 23864 states and 73092 transitions. Word has length 66 [2019-12-27 03:56:06,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:06,046 INFO L462 AbstractCegarLoop]: Abstraction has 23864 states and 73092 transitions. [2019-12-27 03:56:06,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:56:06,046 INFO L276 IsEmpty]: Start isEmpty. Operand 23864 states and 73092 transitions. [2019-12-27 03:56:06,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:56:06,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:06,071 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-27 03:56:06,071 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-27 03:56:06,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:06,071 INFO L82 PathProgramCache]: Analyzing trace with hash -821584657, now seen corresponding path program 4 times [2019-12-27 03:56:06,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:06,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642848179] [2019-12-27 03:56:06,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:56:06,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642848179] [2019-12-27 03:56:06,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:06,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:56:06,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474267345] [2019-12-27 03:56:06,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:56:06,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:06,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:56:06,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:56:06,152 INFO L87 Difference]: Start difference. First operand 23864 states and 73092 transitions. Second operand 3 states. [2019-12-27 03:56:06,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:06,311 INFO L93 Difference]: Finished difference Result 27941 states and 85304 transitions. [2019-12-27 03:56:06,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:56:06,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 03:56:06,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:06,348 INFO L225 Difference]: With dead ends: 27941 [2019-12-27 03:56:06,348 INFO L226 Difference]: Without dead ends: 27941 [2019-12-27 03:56:06,349 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-27 03:56:06,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27941 states. [2019-12-27 03:56:06,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27941 to 23912. [2019-12-27 03:56:06,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23912 states. [2019-12-27 03:56:06,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23912 states to 23912 states and 73418 transitions. [2019-12-27 03:56:06,750 INFO L78 Accepts]: Start accepts. Automaton has 23912 states and 73418 transitions. Word has length 66 [2019-12-27 03:56:06,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:06,750 INFO L462 AbstractCegarLoop]: Abstraction has 23912 states and 73418 transitions. [2019-12-27 03:56:06,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:56:06,750 INFO L276 IsEmpty]: Start isEmpty. Operand 23912 states and 73418 transitions. [2019-12-27 03:56:06,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:56:06,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:06,778 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-27 03:56:06,778 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-27 03:56:06,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:06,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1156108883, now seen corresponding path program 1 times [2019-12-27 03:56:06,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:06,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895813160] [2019-12-27 03:56:06,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:56:06,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895813160] [2019-12-27 03:56:06,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:06,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:56:06,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066115503] [2019-12-27 03:56:06,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:56:06,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:06,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:56:06,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:56:06,958 INFO L87 Difference]: Start difference. First operand 23912 states and 73418 transitions. Second operand 12 states. [2019-12-27 03:56:08,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:08,105 INFO L93 Difference]: Finished difference Result 40486 states and 124488 transitions. [2019-12-27 03:56:08,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:56:08,106 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 03:56:08,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:08,164 INFO L225 Difference]: With dead ends: 40486 [2019-12-27 03:56:08,164 INFO L226 Difference]: Without dead ends: 40057 [2019-12-27 03:56:08,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 03:56:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40057 states. [2019-12-27 03:56:08,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40057 to 23658. [2019-12-27 03:56:08,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23658 states. [2019-12-27 03:56:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23658 states to 23658 states and 72774 transitions. [2019-12-27 03:56:08,627 INFO L78 Accepts]: Start accepts. Automaton has 23658 states and 72774 transitions. Word has length 67 [2019-12-27 03:56:08,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:08,627 INFO L462 AbstractCegarLoop]: Abstraction has 23658 states and 72774 transitions. [2019-12-27 03:56:08,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 03:56:08,627 INFO L276 IsEmpty]: Start isEmpty. Operand 23658 states and 72774 transitions. [2019-12-27 03:56:08,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:56:08,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:08,653 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-27 03:56:08,653 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-27 03:56:08,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:08,653 INFO L82 PathProgramCache]: Analyzing trace with hash 750664618, now seen corresponding path program 1 times [2019-12-27 03:56:08,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:08,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594803903] [2019-12-27 03:56:08,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:08,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-27 03:56:08,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594803903] [2019-12-27 03:56:08,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:08,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:56:08,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076859350] [2019-12-27 03:56:08,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:56:08,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:08,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:56:08,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:56:08,702 INFO L87 Difference]: Start difference. First operand 23658 states and 72774 transitions. Second operand 4 states. [2019-12-27 03:56:08,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:08,997 INFO L93 Difference]: Finished difference Result 35745 states and 110826 transitions. [2019-12-27 03:56:08,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:56:08,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 03:56:08,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:09,050 INFO L225 Difference]: With dead ends: 35745 [2019-12-27 03:56:09,050 INFO L226 Difference]: Without dead ends: 35745 [2019-12-27 03:56:09,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:56:09,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35745 states. [2019-12-27 03:56:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35745 to 25027. [2019-12-27 03:56:09,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25027 states. [2019-12-27 03:56:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25027 states to 25027 states and 77638 transitions. [2019-12-27 03:56:09,673 INFO L78 Accepts]: Start accepts. Automaton has 25027 states and 77638 transitions. Word has length 67 [2019-12-27 03:56:09,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:09,673 INFO L462 AbstractCegarLoop]: Abstraction has 25027 states and 77638 transitions. [2019-12-27 03:56:09,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:56:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 25027 states and 77638 transitions. [2019-12-27 03:56:09,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:56:09,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:09,704 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-27 03:56:09,704 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-27 03:56:09,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:09,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1791716501, now seen corresponding path program 1 times [2019-12-27 03:56:09,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:09,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797984387] [2019-12-27 03:56:09,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:09,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:56:09,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797984387] [2019-12-27 03:56:09,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:09,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:56:09,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110790357] [2019-12-27 03:56:09,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:56:09,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:09,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:56:09,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:56:09,995 INFO L87 Difference]: Start difference. First operand 25027 states and 77638 transitions. Second operand 11 states. [2019-12-27 03:56:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:14,062 INFO L93 Difference]: Finished difference Result 126648 states and 397244 transitions. [2019-12-27 03:56:14,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 03:56:14,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 03:56:14,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:14,300 INFO L225 Difference]: With dead ends: 126648 [2019-12-27 03:56:14,300 INFO L226 Difference]: Without dead ends: 126204 [2019-12-27 03:56:14,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=292, Invalid=830, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 03:56:14,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126204 states. [2019-12-27 03:56:16,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126204 to 45865. [2019-12-27 03:56:16,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45865 states. [2019-12-27 03:56:16,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45865 states to 45865 states and 146893 transitions. [2019-12-27 03:56:16,113 INFO L78 Accepts]: Start accepts. Automaton has 45865 states and 146893 transitions. Word has length 67 [2019-12-27 03:56:16,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:16,113 INFO L462 AbstractCegarLoop]: Abstraction has 45865 states and 146893 transitions. [2019-12-27 03:56:16,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:56:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 45865 states and 146893 transitions. [2019-12-27 03:56:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:56:16,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:16,166 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-27 03:56:16,166 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-27 03:56:16,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:16,167 INFO L82 PathProgramCache]: Analyzing trace with hash -3014007, now seen corresponding path program 1 times [2019-12-27 03:56:16,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:16,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586974352] [2019-12-27 03:56:16,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:16,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:56:16,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586974352] [2019-12-27 03:56:16,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:16,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:56:16,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477570341] [2019-12-27 03:56:16,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:56:16,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:16,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:56:16,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:56:16,206 INFO L87 Difference]: Start difference. First operand 45865 states and 146893 transitions. Second operand 3 states. [2019-12-27 03:56:16,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:16,686 INFO L93 Difference]: Finished difference Result 59577 states and 189667 transitions. [2019-12-27 03:56:16,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:56:16,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 03:56:16,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:16,823 INFO L225 Difference]: With dead ends: 59577 [2019-12-27 03:56:16,823 INFO L226 Difference]: Without dead ends: 59577 [2019-12-27 03:56:16,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:56:16,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59577 states. [2019-12-27 03:56:17,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59577 to 45873. [2019-12-27 03:56:17,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45873 states. [2019-12-27 03:56:17,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45873 states to 45873 states and 146908 transitions. [2019-12-27 03:56:17,647 INFO L78 Accepts]: Start accepts. Automaton has 45873 states and 146908 transitions. Word has length 67 [2019-12-27 03:56:17,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:17,647 INFO L462 AbstractCegarLoop]: Abstraction has 45873 states and 146908 transitions. [2019-12-27 03:56:17,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:56:17,647 INFO L276 IsEmpty]: Start isEmpty. Operand 45873 states and 146908 transitions. [2019-12-27 03:56:17,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:56:17,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:17,701 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-27 03:56:17,701 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-27 03:56:17,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:17,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1799686927, now seen corresponding path program 2 times [2019-12-27 03:56:17,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:17,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439949515] [2019-12-27 03:56:17,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:56:17,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439949515] [2019-12-27 03:56:17,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:17,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:56:17,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160723364] [2019-12-27 03:56:17,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:56:17,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:17,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:56:17,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:56:17,832 INFO L87 Difference]: Start difference. First operand 45873 states and 146908 transitions. Second operand 10 states. [2019-12-27 03:56:20,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:20,123 INFO L93 Difference]: Finished difference Result 85464 states and 274630 transitions. [2019-12-27 03:56:20,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 03:56:20,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 03:56:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:20,267 INFO L225 Difference]: With dead ends: 85464 [2019-12-27 03:56:20,268 INFO L226 Difference]: Without dead ends: 85464 [2019-12-27 03:56:20,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2019-12-27 03:56:20,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85464 states. [2019-12-27 03:56:21,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85464 to 50362. [2019-12-27 03:56:21,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50362 states. [2019-12-27 03:56:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50362 states to 50362 states and 161819 transitions. [2019-12-27 03:56:21,395 INFO L78 Accepts]: Start accepts. Automaton has 50362 states and 161819 transitions. Word has length 67 [2019-12-27 03:56:21,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:21,395 INFO L462 AbstractCegarLoop]: Abstraction has 50362 states and 161819 transitions. [2019-12-27 03:56:21,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:56:21,395 INFO L276 IsEmpty]: Start isEmpty. Operand 50362 states and 161819 transitions. [2019-12-27 03:56:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:56:21,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:21,457 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-27 03:56:21,457 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-27 03:56:21,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:21,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1038037876, now seen corresponding path program 1 times [2019-12-27 03:56:21,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:21,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755600996] [2019-12-27 03:56:21,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:56:21,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755600996] [2019-12-27 03:56:21,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:21,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:56:21,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136235184] [2019-12-27 03:56:21,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:56:21,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:21,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:56:21,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:56:21,548 INFO L87 Difference]: Start difference. First operand 50362 states and 161819 transitions. Second operand 4 states. [2019-12-27 03:56:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:21,811 INFO L93 Difference]: Finished difference Result 50207 states and 160768 transitions. [2019-12-27 03:56:21,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:56:21,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 03:56:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:21,890 INFO L225 Difference]: With dead ends: 50207 [2019-12-27 03:56:21,890 INFO L226 Difference]: Without dead ends: 50015 [2019-12-27 03:56:21,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:56:22,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50015 states. [2019-12-27 03:56:22,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50015 to 40872. [2019-12-27 03:56:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40872 states. [2019-12-27 03:56:22,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40872 states to 40872 states and 130268 transitions. [2019-12-27 03:56:22,932 INFO L78 Accepts]: Start accepts. Automaton has 40872 states and 130268 transitions. Word has length 67 [2019-12-27 03:56:22,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:22,932 INFO L462 AbstractCegarLoop]: Abstraction has 40872 states and 130268 transitions. [2019-12-27 03:56:22,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:56:22,932 INFO L276 IsEmpty]: Start isEmpty. Operand 40872 states and 130268 transitions. [2019-12-27 03:56:22,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:56:22,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:22,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:56:22,986 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-27 03:56:22,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:22,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 2 times [2019-12-27 03:56:22,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:22,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333071865] [2019-12-27 03:56:22,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:56:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:56:23,114 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:56:23,115 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:56:23,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~y~0_23 0) (= v_~z$r_buff0_thd2~0_111 0) (= v_~x~0_76 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_178 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2293~0.base_26|) 0) (= 0 v_~__unbuffered_p2_EAX~0_45) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t2293~0.base_26| 1)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2293~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2293~0.base_26|) |v_ULTIMATE.start_main_~#t2293~0.offset_19| 0)) |v_#memory_int_21|) (= 0 |v_ULTIMATE.start_main_~#t2293~0.offset_19|) (= v_~z$w_buff1_used~0_531 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_43 0) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~z$flush_delayed~0_28) (= v_~z$r_buff1_thd2~0_104 0) (= v_~z$mem_tmp~0_17 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2293~0.base_26| 4) |v_#length_23|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2293~0.base_26|) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd0~0_141 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~weak$$choice0~0_16) (= 0 v_~__unbuffered_cnt~0_91) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= v_~__unbuffered_p2_EBX~0_57 0) (= v_~z$r_buff1_thd0~0_133 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_45, ULTIMATE.start_main_~#t2295~0.base=|v_ULTIMATE.start_main_~#t2295~0.base_16|, ULTIMATE.start_main_~#t2294~0.offset=|v_ULTIMATE.start_main_~#t2294~0.offset_19|, ULTIMATE.start_main_~#t2293~0.base=|v_ULTIMATE.start_main_~#t2293~0.base_26|, ~z$mem_tmp~0=v_~z$mem_tmp~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ULTIMATE.start_main_~#t2293~0.offset=|v_ULTIMATE.start_main_~#t2293~0.offset_19|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ULTIMATE.start_main_~#t2294~0.base=|v_ULTIMATE.start_main_~#t2294~0.base_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_76, ULTIMATE.start_main_~#t2295~0.offset=|v_ULTIMATE.start_main_~#t2295~0.offset_12|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_133, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2295~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2295~0.base, ~y~0, ULTIMATE.start_main_~#t2294~0.offset, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t2293~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2293~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t2294~0.base, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 03:56:23,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2294~0.base_9| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2294~0.base_9|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2294~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2294~0.base_9|) |v_ULTIMATE.start_main_~#t2294~0.offset_8| 1))) (= 0 |v_ULTIMATE.start_main_~#t2294~0.offset_8|) (not (= |v_ULTIMATE.start_main_~#t2294~0.base_9| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2294~0.base_9| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2294~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2294~0.base=|v_ULTIMATE.start_main_~#t2294~0.base_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2294~0.offset=|v_ULTIMATE.start_main_~#t2294~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t2294~0.base, #length, ULTIMATE.start_main_~#t2294~0.offset] because there is no mapped edge [2019-12-27 03:56:23,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2105389899| 1) (= |P0Thread1of1ForFork0_#in~arg.offset_In-2105389899| P0Thread1of1ForFork0_~arg.offset_Out-2105389899) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2105389899| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-2105389899) (= ~z$w_buff0~0_In-2105389899 ~z$w_buff1~0_Out-2105389899) (= |P0Thread1of1ForFork0_#in~arg.base_In-2105389899| P0Thread1of1ForFork0_~arg.base_Out-2105389899) (= ~z$w_buff1_used~0_Out-2105389899 ~z$w_buff0_used~0_In-2105389899) (= 0 (mod ~z$w_buff1_used~0_Out-2105389899 256)) (= ~z$w_buff0_used~0_Out-2105389899 1) (= 1 ~z$w_buff0~0_Out-2105389899)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-2105389899|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2105389899, ~z$w_buff0~0=~z$w_buff0~0_In-2105389899, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-2105389899|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-2105389899|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-2105389899, ~z$w_buff0~0=~z$w_buff0~0_Out-2105389899, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-2105389899, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-2105389899, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-2105389899|, ~z$w_buff1~0=~z$w_buff1~0_Out-2105389899, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-2105389899, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2105389899|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-2105389899} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 03:56:23,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2295~0.base_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2295~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2295~0.base_11|) |v_ULTIMATE.start_main_~#t2295~0.offset_9| 2)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t2295~0.offset_9|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2295~0.base_11|)) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2295~0.base_11| 1) |v_#valid_40|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2295~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t2295~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2295~0.offset=|v_ULTIMATE.start_main_~#t2295~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2295~0.base=|v_ULTIMATE.start_main_~#t2295~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2295~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t2295~0.base] because there is no mapped edge [2019-12-27 03:56:23,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In257311460 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In257311460 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite10_Out257311460| |P1Thread1of1ForFork1_#t~ite9_Out257311460|))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In257311460 |P1Thread1of1ForFork1_#t~ite9_Out257311460|)) (and (not .cse0) (not .cse1) .cse2 (= ~z$w_buff1~0_In257311460 |P1Thread1of1ForFork1_#t~ite9_Out257311460|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In257311460, ~z$w_buff1_used~0=~z$w_buff1_used~0_In257311460, ~z$w_buff1~0=~z$w_buff1~0_In257311460, ~z~0=~z~0_In257311460} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out257311460|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In257311460, ~z$w_buff1_used~0=~z$w_buff1_used~0_In257311460, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out257311460|, ~z$w_buff1~0=~z$w_buff1~0_In257311460, ~z~0=~z~0_In257311460} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 03:56:23,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-16012307 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-16012307 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-16012307|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-16012307 |P1Thread1of1ForFork1_#t~ite11_Out-16012307|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-16012307, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-16012307} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-16012307, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-16012307|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-16012307} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 03:56:23,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In915075992 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In915075992 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In915075992 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In915075992 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out915075992| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out915075992| ~z$w_buff1_used~0_In915075992) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In915075992, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In915075992, ~z$w_buff1_used~0=~z$w_buff1_used~0_In915075992, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In915075992} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In915075992, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In915075992, ~z$w_buff1_used~0=~z$w_buff1_used~0_In915075992, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out915075992|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In915075992} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 03:56:23,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-553025939 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-553025939 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-553025939| ~z$r_buff0_thd2~0_In-553025939)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out-553025939| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-553025939, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-553025939} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-553025939, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-553025939|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-553025939} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 03:56:23,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-738849256 256) 0))) (or (and (= ~z$w_buff1~0_In-738849256 |P2Thread1of1ForFork2_#t~ite23_Out-738849256|) .cse0 (= |P2Thread1of1ForFork2_#t~ite23_Out-738849256| |P2Thread1of1ForFork2_#t~ite24_Out-738849256|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-738849256 256)))) (or (= (mod ~z$w_buff0_used~0_In-738849256 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In-738849256 256)) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In-738849256 256)) .cse1)))) (and (= ~z$w_buff1~0_In-738849256 |P2Thread1of1ForFork2_#t~ite24_Out-738849256|) (= |P2Thread1of1ForFork2_#t~ite23_In-738849256| |P2Thread1of1ForFork2_#t~ite23_Out-738849256|) (not .cse0)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-738849256|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-738849256, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-738849256, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-738849256, ~z$w_buff1~0=~z$w_buff1~0_In-738849256, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-738849256, ~weak$$choice2~0=~weak$$choice2~0_In-738849256} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-738849256|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-738849256|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-738849256, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-738849256, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-738849256, ~z$w_buff1~0=~z$w_buff1~0_In-738849256, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-738849256, ~weak$$choice2~0=~weak$$choice2~0_In-738849256} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 03:56:23,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1234103893 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite26_In-1234103893| |P2Thread1of1ForFork2_#t~ite26_Out-1234103893|) (= |P2Thread1of1ForFork2_#t~ite27_Out-1234103893| ~z$w_buff0_used~0_In-1234103893)) (and (= |P2Thread1of1ForFork2_#t~ite27_Out-1234103893| |P2Thread1of1ForFork2_#t~ite26_Out-1234103893|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1234103893 256)))) (or (= (mod ~z$w_buff0_used~0_In-1234103893 256) 0) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-1234103893 256) 0)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1234103893 256) 0)))) (= ~z$w_buff0_used~0_In-1234103893 |P2Thread1of1ForFork2_#t~ite26_Out-1234103893|) .cse0))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-1234103893|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1234103893, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1234103893, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1234103893, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1234103893, ~weak$$choice2~0=~weak$$choice2~0_In-1234103893} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-1234103893|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1234103893, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1234103893, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1234103893, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1234103893, ~weak$$choice2~0=~weak$$choice2~0_In-1234103893, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-1234103893|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 03:56:23,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1089051857 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1089051857 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1089051857 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1089051857 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1089051857|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd2~0_In1089051857 |P1Thread1of1ForFork1_#t~ite14_Out1089051857|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1089051857, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1089051857, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1089051857, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1089051857} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1089051857, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1089051857, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1089051857, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1089051857|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1089051857} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 03:56:23,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 03:56:23,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2147429216 256) 0))) (or (and (= ~z$w_buff1_used~0_In-2147429216 |P2Thread1of1ForFork2_#t~ite30_Out-2147429216|) (= |P2Thread1of1ForFork2_#t~ite29_In-2147429216| |P2Thread1of1ForFork2_#t~ite29_Out-2147429216|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork2_#t~ite29_Out-2147429216| |P2Thread1of1ForFork2_#t~ite30_Out-2147429216|) (= ~z$w_buff1_used~0_In-2147429216 |P2Thread1of1ForFork2_#t~ite29_Out-2147429216|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-2147429216 256)))) (or (= (mod ~z$w_buff0_used~0_In-2147429216 256) 0) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-2147429216 256))) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-2147429216 256)))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2147429216, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2147429216, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2147429216, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2147429216, ~weak$$choice2~0=~weak$$choice2~0_In-2147429216, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-2147429216|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-2147429216|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2147429216, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2147429216, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2147429216, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2147429216, ~weak$$choice2~0=~weak$$choice2~0_In-2147429216, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-2147429216|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 03:56:23,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 03:56:23,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 03:56:23,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1728561712 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1728561712 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1728561712| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1728561712| ~z$w_buff0_used~0_In1728561712)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1728561712, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1728561712} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1728561712|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1728561712, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1728561712} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 03:56:23,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1689896614 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In1689896614 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1689896614 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1689896614 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1689896614| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1689896614 |P0Thread1of1ForFork0_#t~ite6_Out1689896614|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1689896614, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1689896614, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1689896614, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1689896614} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1689896614|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1689896614, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1689896614, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1689896614, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1689896614} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 03:56:23,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In962961321 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In962961321 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In962961321 ~z$r_buff0_thd1~0_Out962961321)) (and (= ~z$r_buff0_thd1~0_Out962961321 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In962961321, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In962961321} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In962961321, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out962961321|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out962961321} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 03:56:23,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd1~0_In1738660 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1738660 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1738660 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1738660 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1738660|)) (and (or .cse1 .cse0) (= ~z$r_buff1_thd1~0_In1738660 |P0Thread1of1ForFork0_#t~ite8_Out1738660|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1738660, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1738660, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1738660, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1738660} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1738660, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1738660|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1738660, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1738660, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1738660} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 03:56:23,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 03:56:23,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse1 (= |P2Thread1of1ForFork2_#t~ite39_Out-1196600575| |P2Thread1of1ForFork2_#t~ite38_Out-1196600575|)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1196600575 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1196600575 256)))) (or (and (not .cse0) .cse1 (= |P2Thread1of1ForFork2_#t~ite38_Out-1196600575| ~z$w_buff1~0_In-1196600575) (not .cse2)) (and .cse1 (or .cse0 .cse2) (= |P2Thread1of1ForFork2_#t~ite38_Out-1196600575| ~z~0_In-1196600575)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1196600575, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1196600575, ~z$w_buff1~0=~z$w_buff1~0_In-1196600575, ~z~0=~z~0_In-1196600575} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1196600575, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1196600575, ~z$w_buff1~0=~z$w_buff1~0_In-1196600575, ~z~0=~z~0_In-1196600575, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-1196600575|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-1196600575|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 03:56:23,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In2041239375 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In2041239375 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out2041239375|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In2041239375 |P2Thread1of1ForFork2_#t~ite40_Out2041239375|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2041239375, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2041239375} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2041239375, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2041239375, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out2041239375|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 03:56:23,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In516799769 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In516799769 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In516799769 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In516799769 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite41_Out516799769| ~z$w_buff1_used~0_In516799769)) (and (= |P2Thread1of1ForFork2_#t~ite41_Out516799769| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In516799769, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In516799769, ~z$w_buff1_used~0=~z$w_buff1_used~0_In516799769, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In516799769} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out516799769|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In516799769, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In516799769, ~z$w_buff1_used~0=~z$w_buff1_used~0_In516799769, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In516799769} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 03:56:23,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-150100196 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-150100196 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out-150100196| 0)) (and (= |P2Thread1of1ForFork2_#t~ite42_Out-150100196| ~z$r_buff0_thd3~0_In-150100196) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-150100196, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-150100196} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-150100196|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-150100196, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-150100196} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 03:56:23,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-437188058 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-437188058 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-437188058 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-437188058 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite43_Out-437188058| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In-437188058 |P2Thread1of1ForFork2_#t~ite43_Out-437188058|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-437188058, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-437188058, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-437188058, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-437188058} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-437188058, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-437188058, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-437188058|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-437188058, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-437188058} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 03:56:23,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_30|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 03:56:23,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:56:23,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1159413906 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1159413906 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out1159413906| |ULTIMATE.start_main_#t~ite48_Out1159413906|))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out1159413906| ~z$w_buff1~0_In1159413906) (not .cse0) (not .cse1) .cse2) (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite47_Out1159413906| ~z~0_In1159413906)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1159413906, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1159413906, ~z$w_buff1~0=~z$w_buff1~0_In1159413906, ~z~0=~z~0_In1159413906} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1159413906, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1159413906|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1159413906, ~z$w_buff1~0=~z$w_buff1~0_In1159413906, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1159413906|, ~z~0=~z~0_In1159413906} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 03:56:23,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1062649202 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1062649202 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1062649202| ~z$w_buff0_used~0_In-1062649202)) (and (= |ULTIMATE.start_main_#t~ite49_Out-1062649202| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1062649202, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1062649202} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1062649202, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1062649202, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1062649202|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 03:56:23,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1494062898 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1494062898 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1494062898 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1494062898 256)))) (or (and (= ~z$w_buff1_used~0_In-1494062898 |ULTIMATE.start_main_#t~ite50_Out-1494062898|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite50_Out-1494062898| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1494062898, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1494062898, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1494062898, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1494062898} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1494062898|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1494062898, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1494062898, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1494062898, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1494062898} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 03:56:23,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1866435289 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1866435289 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out1866435289|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1866435289 |ULTIMATE.start_main_#t~ite51_Out1866435289|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1866435289, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1866435289} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1866435289, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1866435289|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1866435289} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 03:56:23,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In223416130 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In223416130 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In223416130 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In223416130 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out223416130| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In223416130 |ULTIMATE.start_main_#t~ite52_Out223416130|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In223416130, ~z$w_buff0_used~0=~z$w_buff0_used~0_In223416130, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In223416130, ~z$w_buff1_used~0=~z$w_buff1_used~0_In223416130} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out223416130|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In223416130, ~z$w_buff0_used~0=~z$w_buff0_used~0_In223416130, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In223416130, ~z$w_buff1_used~0=~z$w_buff1_used~0_In223416130} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 03:56:23,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_23 256)) (= |v_ULTIMATE.start_main_#t~ite52_54| v_~z$r_buff1_thd0~0_96) (= v_~x~0_49 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_23 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_25)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_96, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:56:23,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:56:23 BasicIcfg [2019-12-27 03:56:23,255 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:56:23,257 INFO L168 Benchmark]: Toolchain (without parser) took 106003.59 ms. Allocated memory was 139.5 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 102.4 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 03:56:23,258 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 139.5 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 03:56:23,258 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.27 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.0 MB in the beginning and 157.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-12-27 03:56:23,259 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.72 ms. Allocated memory is still 203.9 MB. Free memory was 157.8 MB in the beginning and 155.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:56:23,263 INFO L168 Benchmark]: Boogie Preprocessor took 39.21 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 152.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:56:23,263 INFO L168 Benchmark]: RCFGBuilder took 829.65 ms. Allocated memory is still 203.9 MB. Free memory was 152.2 MB in the beginning and 102.7 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-27 03:56:23,264 INFO L168 Benchmark]: TraceAbstraction took 104253.59 ms. Allocated memory was 203.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 101.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 966.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:56:23,270 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 139.5 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 806.27 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.0 MB in the beginning and 157.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.72 ms. Allocated memory is still 203.9 MB. Free memory was 157.8 MB in the beginning and 155.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.21 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 152.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 829.65 ms. Allocated memory is still 203.9 MB. Free memory was 152.2 MB in the beginning and 102.7 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 104253.59 ms. Allocated memory was 203.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 101.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 966.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.5s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7185 VarBasedMoverChecksPositive, 382 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 288 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2293, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t2294, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t2295, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 __unbuffered_p2_EAX = y [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 103.8s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 34.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6749 SDtfs, 8977 SDslu, 22171 SDs, 0 SdLazy, 13004 SolverSat, 582 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 378 GetRequests, 65 SyntacticMatches, 25 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142946occurred 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: 39.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 345579 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1644 NumberOfCodeBlocks, 1644 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1546 ConstructedInterpolants, 0 QuantifiedInterpolants, 342767 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...