/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:24:20,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:24:20,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:24:20,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:24:20,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:24:20,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:24:20,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:24:20,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:24:20,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:24:20,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:24:20,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:24:20,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:24:20,920 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:24:20,921 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:24:20,922 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:24:20,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:24:20,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:24:20,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:24:20,929 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:24:20,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:24:20,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:24:20,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:24:20,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:24:20,941 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:24:20,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:24:20,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:24:20,946 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:24:20,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:24:20,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:24:20,951 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:24:20,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:24:20,952 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:24:20,953 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:24:20,954 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:24:20,957 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:24:20,957 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:24:20,958 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:24:20,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:24:20,958 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:24:20,959 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:24:20,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:24:20,960 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:24:20,974 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:24:20,974 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:24:20,975 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:24:20,976 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:24:20,976 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:24:20,976 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:24:20,976 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:24:20,977 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:24:20,977 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:24:20,977 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:24:20,977 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:24:20,977 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:24:20,977 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:24:20,978 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:24:20,978 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:24:20,978 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:24:20,978 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:24:20,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:24:20,979 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:24:20,979 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:24:20,979 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:24:20,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:24:20,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:24:20,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:24:20,980 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:24:20,980 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:24:20,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:24:20,980 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:24:20,981 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:24:20,981 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:24:21,261 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:24:21,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:24:21,283 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:24:21,285 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:24:21,285 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:24:21,286 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_power.oepc.i [2019-12-18 21:24:21,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/846af3279/eef37058e8e24f6f9b2dd3b8e469d5e5/FLAGb9d5a6374 [2019-12-18 21:24:21,927 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:24:21,928 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_power.oepc.i [2019-12-18 21:24:21,951 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/846af3279/eef37058e8e24f6f9b2dd3b8e469d5e5/FLAGb9d5a6374 [2019-12-18 21:24:22,232 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/846af3279/eef37058e8e24f6f9b2dd3b8e469d5e5 [2019-12-18 21:24:22,240 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:24:22,243 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:24:22,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:24:22,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:24:22,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:24:22,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:24:22" (1/1) ... [2019-12-18 21:24:22,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a58602b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:22, skipping insertion in model container [2019-12-18 21:24:22,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:24:22" (1/1) ... [2019-12-18 21:24:22,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:24:22,306 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:24:22,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:24:22,901 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:24:22,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:24:23,053 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:24:23,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:23 WrapperNode [2019-12-18 21:24:23,054 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:24:23,055 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:24:23,055 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:24:23,055 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:24:23,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:23" (1/1) ... [2019-12-18 21:24:23,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:23" (1/1) ... [2019-12-18 21:24:23,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:24:23,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:24:23,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:24:23,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:24:23,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:23" (1/1) ... [2019-12-18 21:24:23,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:23" (1/1) ... [2019-12-18 21:24:23,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:23" (1/1) ... [2019-12-18 21:24:23,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:23" (1/1) ... [2019-12-18 21:24:23,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:23" (1/1) ... [2019-12-18 21:24:23,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:23" (1/1) ... [2019-12-18 21:24:23,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:23" (1/1) ... [2019-12-18 21:24:23,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:24:23,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:24:23,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:24:23,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:24:23,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:24:23,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:24:23,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:24:23,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:24:23,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:24:23,241 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:24:23,241 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:24:23,241 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:24:23,242 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:24:23,242 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:24:23,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:24:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:24:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:24:23,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:24:23,246 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:24:23,996 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:24:23,997 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:24:23,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:24:23 BoogieIcfgContainer [2019-12-18 21:24:23,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:24:23,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:24:24,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:24:24,003 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:24:24,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:24:22" (1/3) ... [2019-12-18 21:24:24,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f54005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:24:24, skipping insertion in model container [2019-12-18 21:24:24,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:23" (2/3) ... [2019-12-18 21:24:24,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f54005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:24:24, skipping insertion in model container [2019-12-18 21:24:24,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:24:23" (3/3) ... [2019-12-18 21:24:24,008 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_power.oepc.i [2019-12-18 21:24:24,018 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:24:24,019 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:24:24,029 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:24:24,031 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:24:24,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,091 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,091 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,091 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,092 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,092 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,106 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,107 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,122 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,122 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,184 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,186 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,204 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,204 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:24,223 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:24:24,240 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:24:24,240 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:24:24,241 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:24:24,241 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:24:24,241 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:24:24,241 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:24:24,241 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:24:24,241 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:24:24,256 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-18 21:24:24,257 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 21:24:24,359 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 21:24:24,359 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:24:24,383 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 21:24:24,408 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 21:24:24,466 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 21:24:24,466 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:24:24,483 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 21:24:24,505 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 21:24:24,506 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:24:28,376 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 21:24:28,508 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 21:24:28,542 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80962 [2019-12-18 21:24:28,542 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 21:24:28,546 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-18 21:24:43,989 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104862 states. [2019-12-18 21:24:43,991 INFO L276 IsEmpty]: Start isEmpty. Operand 104862 states. [2019-12-18 21:24:43,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:24:43,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:43,999 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:24:44,000 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:44,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:44,005 INFO L82 PathProgramCache]: Analyzing trace with hash 916881, now seen corresponding path program 1 times [2019-12-18 21:24:44,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:44,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423982069] [2019-12-18 21:24:44,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:24:44,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423982069] [2019-12-18 21:24:44,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:44,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:24:44,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249309327] [2019-12-18 21:24:44,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:24:44,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:44,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:24:44,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:24:44,235 INFO L87 Difference]: Start difference. First operand 104862 states. Second operand 3 states. [2019-12-18 21:24:45,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:45,546 INFO L93 Difference]: Finished difference Result 104092 states and 443334 transitions. [2019-12-18 21:24:45,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:24:45,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:24:45,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:46,095 INFO L225 Difference]: With dead ends: 104092 [2019-12-18 21:24:46,095 INFO L226 Difference]: Without dead ends: 97696 [2019-12-18 21:24:46,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:24:52,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97696 states. [2019-12-18 21:24:54,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97696 to 97696. [2019-12-18 21:24:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97696 states. [2019-12-18 21:24:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97696 states to 97696 states and 415501 transitions. [2019-12-18 21:24:55,286 INFO L78 Accepts]: Start accepts. Automaton has 97696 states and 415501 transitions. Word has length 3 [2019-12-18 21:24:55,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:55,286 INFO L462 AbstractCegarLoop]: Abstraction has 97696 states and 415501 transitions. [2019-12-18 21:24:55,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:24:55,287 INFO L276 IsEmpty]: Start isEmpty. Operand 97696 states and 415501 transitions. [2019-12-18 21:24:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:24:55,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:55,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:55,291 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:55,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:55,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1566799458, now seen corresponding path program 1 times [2019-12-18 21:24:55,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:55,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49259130] [2019-12-18 21:24:55,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:55,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:24:55,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49259130] [2019-12-18 21:24:55,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:55,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:24:55,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136351383] [2019-12-18 21:24:55,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:24:55,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:55,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:24:55,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:24:55,397 INFO L87 Difference]: Start difference. First operand 97696 states and 415501 transitions. Second operand 4 states. [2019-12-18 21:24:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:59,720 INFO L93 Difference]: Finished difference Result 155904 states and 634680 transitions. [2019-12-18 21:24:59,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:24:59,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:24:59,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:00,903 INFO L225 Difference]: With dead ends: 155904 [2019-12-18 21:25:00,904 INFO L226 Difference]: Without dead ends: 155855 [2019-12-18 21:25:00,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:25:09,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155855 states. [2019-12-18 21:25:12,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155855 to 141665. [2019-12-18 21:25:12,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141665 states. [2019-12-18 21:25:12,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141665 states to 141665 states and 584468 transitions. [2019-12-18 21:25:12,996 INFO L78 Accepts]: Start accepts. Automaton has 141665 states and 584468 transitions. Word has length 11 [2019-12-18 21:25:12,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:12,997 INFO L462 AbstractCegarLoop]: Abstraction has 141665 states and 584468 transitions. [2019-12-18 21:25:12,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:25:12,997 INFO L276 IsEmpty]: Start isEmpty. Operand 141665 states and 584468 transitions. [2019-12-18 21:25:13,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:25:13,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:13,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:13,002 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:13,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:13,003 INFO L82 PathProgramCache]: Analyzing trace with hash 2120295885, now seen corresponding path program 1 times [2019-12-18 21:25:13,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:13,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388316632] [2019-12-18 21:25:13,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:13,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:13,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388316632] [2019-12-18 21:25:13,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:13,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:25:13,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574320566] [2019-12-18 21:25:13,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:25:13,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:13,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:25:13,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:13,071 INFO L87 Difference]: Start difference. First operand 141665 states and 584468 transitions. Second operand 3 states. [2019-12-18 21:25:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:13,203 INFO L93 Difference]: Finished difference Result 31684 states and 102658 transitions. [2019-12-18 21:25:13,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:25:13,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:25:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:13,259 INFO L225 Difference]: With dead ends: 31684 [2019-12-18 21:25:13,259 INFO L226 Difference]: Without dead ends: 31684 [2019-12-18 21:25:13,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:13,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31684 states. [2019-12-18 21:25:18,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31684 to 31684. [2019-12-18 21:25:18,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31684 states. [2019-12-18 21:25:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31684 states to 31684 states and 102658 transitions. [2019-12-18 21:25:18,462 INFO L78 Accepts]: Start accepts. Automaton has 31684 states and 102658 transitions. Word has length 13 [2019-12-18 21:25:18,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:18,462 INFO L462 AbstractCegarLoop]: Abstraction has 31684 states and 102658 transitions. [2019-12-18 21:25:18,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:25:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 31684 states and 102658 transitions. [2019-12-18 21:25:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:25:18,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:18,466 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:18,466 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:18,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:18,467 INFO L82 PathProgramCache]: Analyzing trace with hash -2058055416, now seen corresponding path program 1 times [2019-12-18 21:25:18,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:18,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753107874] [2019-12-18 21:25:18,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:18,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753107874] [2019-12-18 21:25:18,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:18,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:25:18,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984366243] [2019-12-18 21:25:18,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:25:18,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:18,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:25:18,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:25:18,638 INFO L87 Difference]: Start difference. First operand 31684 states and 102658 transitions. Second operand 4 states. [2019-12-18 21:25:19,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:19,059 INFO L93 Difference]: Finished difference Result 39269 states and 126736 transitions. [2019-12-18 21:25:19,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:25:19,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:25:19,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:19,133 INFO L225 Difference]: With dead ends: 39269 [2019-12-18 21:25:19,133 INFO L226 Difference]: Without dead ends: 39269 [2019-12-18 21:25:19,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:25:19,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39269 states. [2019-12-18 21:25:20,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39269 to 35204. [2019-12-18 21:25:20,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35204 states. [2019-12-18 21:25:20,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35204 states to 35204 states and 113989 transitions. [2019-12-18 21:25:20,295 INFO L78 Accepts]: Start accepts. Automaton has 35204 states and 113989 transitions. Word has length 16 [2019-12-18 21:25:20,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:20,296 INFO L462 AbstractCegarLoop]: Abstraction has 35204 states and 113989 transitions. [2019-12-18 21:25:20,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:25:20,296 INFO L276 IsEmpty]: Start isEmpty. Operand 35204 states and 113989 transitions. [2019-12-18 21:25:20,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:25:20,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:20,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:20,306 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:20,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:20,306 INFO L82 PathProgramCache]: Analyzing trace with hash -36065168, now seen corresponding path program 1 times [2019-12-18 21:25:20,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:20,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449871611] [2019-12-18 21:25:20,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:20,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449871611] [2019-12-18 21:25:20,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:20,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:25:20,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160627873] [2019-12-18 21:25:20,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:25:20,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:20,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:25:20,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:25:20,422 INFO L87 Difference]: Start difference. First operand 35204 states and 113989 transitions. Second operand 5 states. [2019-12-18 21:25:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:21,034 INFO L93 Difference]: Finished difference Result 45733 states and 145470 transitions. [2019-12-18 21:25:21,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:25:21,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 21:25:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:21,117 INFO L225 Difference]: With dead ends: 45733 [2019-12-18 21:25:21,118 INFO L226 Difference]: Without dead ends: 45726 [2019-12-18 21:25:21,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:25:21,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45726 states. [2019-12-18 21:25:21,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45726 to 34769. [2019-12-18 21:25:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34769 states. [2019-12-18 21:25:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34769 states to 34769 states and 112450 transitions. [2019-12-18 21:25:22,369 INFO L78 Accepts]: Start accepts. Automaton has 34769 states and 112450 transitions. Word has length 22 [2019-12-18 21:25:22,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:22,369 INFO L462 AbstractCegarLoop]: Abstraction has 34769 states and 112450 transitions. [2019-12-18 21:25:22,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:25:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 34769 states and 112450 transitions. [2019-12-18 21:25:22,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:25:22,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:22,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:22,382 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:22,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:22,383 INFO L82 PathProgramCache]: Analyzing trace with hash -74237997, now seen corresponding path program 1 times [2019-12-18 21:25:22,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:22,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810162765] [2019-12-18 21:25:22,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:22,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:22,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810162765] [2019-12-18 21:25:22,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:22,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:25:22,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501568033] [2019-12-18 21:25:22,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:25:22,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:22,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:25:22,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:25:22,449 INFO L87 Difference]: Start difference. First operand 34769 states and 112450 transitions. Second operand 4 states. [2019-12-18 21:25:22,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:22,512 INFO L93 Difference]: Finished difference Result 14037 states and 42756 transitions. [2019-12-18 21:25:22,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:25:22,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 21:25:22,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:22,531 INFO L225 Difference]: With dead ends: 14037 [2019-12-18 21:25:22,532 INFO L226 Difference]: Without dead ends: 14037 [2019-12-18 21:25:22,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:25:22,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14037 states. [2019-12-18 21:25:22,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14037 to 13737. [2019-12-18 21:25:22,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13737 states. [2019-12-18 21:25:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13737 states to 13737 states and 41900 transitions. [2019-12-18 21:25:22,737 INFO L78 Accepts]: Start accepts. Automaton has 13737 states and 41900 transitions. Word has length 25 [2019-12-18 21:25:22,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:22,737 INFO L462 AbstractCegarLoop]: Abstraction has 13737 states and 41900 transitions. [2019-12-18 21:25:22,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:25:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 13737 states and 41900 transitions. [2019-12-18 21:25:22,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:25:22,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:22,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:22,748 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:22,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:22,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1416816819, now seen corresponding path program 1 times [2019-12-18 21:25:22,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:22,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865364066] [2019-12-18 21:25:22,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:22,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865364066] [2019-12-18 21:25:22,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:22,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:25:22,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355149327] [2019-12-18 21:25:22,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:25:22,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:22,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:25:22,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:22,807 INFO L87 Difference]: Start difference. First operand 13737 states and 41900 transitions. Second operand 3 states. [2019-12-18 21:25:22,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:22,915 INFO L93 Difference]: Finished difference Result 19578 states and 58726 transitions. [2019-12-18 21:25:22,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:25:22,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 21:25:22,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:22,950 INFO L225 Difference]: With dead ends: 19578 [2019-12-18 21:25:22,950 INFO L226 Difference]: Without dead ends: 19578 [2019-12-18 21:25:22,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:23,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19578 states. [2019-12-18 21:25:23,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19578 to 14483. [2019-12-18 21:25:23,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14483 states. [2019-12-18 21:25:23,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14483 states to 14483 states and 44038 transitions. [2019-12-18 21:25:23,218 INFO L78 Accepts]: Start accepts. Automaton has 14483 states and 44038 transitions. Word has length 27 [2019-12-18 21:25:23,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:23,219 INFO L462 AbstractCegarLoop]: Abstraction has 14483 states and 44038 transitions. [2019-12-18 21:25:23,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:25:23,219 INFO L276 IsEmpty]: Start isEmpty. Operand 14483 states and 44038 transitions. [2019-12-18 21:25:23,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:25:23,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:23,229 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:23,229 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:23,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:23,230 INFO L82 PathProgramCache]: Analyzing trace with hash -522150304, now seen corresponding path program 1 times [2019-12-18 21:25:23,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:23,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293507038] [2019-12-18 21:25:23,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:23,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293507038] [2019-12-18 21:25:23,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:23,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:25:23,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813595429] [2019-12-18 21:25:23,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:25:23,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:23,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:25:23,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:25:23,343 INFO L87 Difference]: Start difference. First operand 14483 states and 44038 transitions. Second operand 6 states. [2019-12-18 21:25:24,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:24,126 INFO L93 Difference]: Finished difference Result 37116 states and 111354 transitions. [2019-12-18 21:25:24,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:25:24,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 21:25:24,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:24,176 INFO L225 Difference]: With dead ends: 37116 [2019-12-18 21:25:24,176 INFO L226 Difference]: Without dead ends: 37116 [2019-12-18 21:25:24,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:25:24,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37116 states. [2019-12-18 21:25:24,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37116 to 20406. [2019-12-18 21:25:24,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20406 states. [2019-12-18 21:25:24,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20406 states to 20406 states and 62975 transitions. [2019-12-18 21:25:24,831 INFO L78 Accepts]: Start accepts. Automaton has 20406 states and 62975 transitions. Word has length 27 [2019-12-18 21:25:24,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:24,832 INFO L462 AbstractCegarLoop]: Abstraction has 20406 states and 62975 transitions. [2019-12-18 21:25:24,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:25:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 20406 states and 62975 transitions. [2019-12-18 21:25:24,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 21:25:24,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:24,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:24,848 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:24,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:24,848 INFO L82 PathProgramCache]: Analyzing trace with hash -624201971, now seen corresponding path program 1 times [2019-12-18 21:25:24,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:24,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994440146] [2019-12-18 21:25:24,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:24,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994440146] [2019-12-18 21:25:24,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:24,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:25:24,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41954191] [2019-12-18 21:25:24,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:25:24,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:24,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:25:24,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:25:24,934 INFO L87 Difference]: Start difference. First operand 20406 states and 62975 transitions. Second operand 6 states. [2019-12-18 21:25:25,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:25,779 INFO L93 Difference]: Finished difference Result 34406 states and 103090 transitions. [2019-12-18 21:25:25,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:25:25,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 21:25:25,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:25,831 INFO L225 Difference]: With dead ends: 34406 [2019-12-18 21:25:25,831 INFO L226 Difference]: Without dead ends: 34406 [2019-12-18 21:25:25,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:25:25,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34406 states. [2019-12-18 21:25:26,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34406 to 20168. [2019-12-18 21:25:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20168 states. [2019-12-18 21:25:26,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20168 states to 20168 states and 62360 transitions. [2019-12-18 21:25:26,252 INFO L78 Accepts]: Start accepts. Automaton has 20168 states and 62360 transitions. Word has length 28 [2019-12-18 21:25:26,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:26,252 INFO L462 AbstractCegarLoop]: Abstraction has 20168 states and 62360 transitions. [2019-12-18 21:25:26,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:25:26,252 INFO L276 IsEmpty]: Start isEmpty. Operand 20168 states and 62360 transitions. [2019-12-18 21:25:26,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:25:26,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:26,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:26,275 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:26,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:26,275 INFO L82 PathProgramCache]: Analyzing trace with hash -160608776, now seen corresponding path program 1 times [2019-12-18 21:25:26,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:26,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913753465] [2019-12-18 21:25:26,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:26,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913753465] [2019-12-18 21:25:26,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:26,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:25:26,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532286925] [2019-12-18 21:25:26,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:25:26,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:26,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:25:26,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:25:26,398 INFO L87 Difference]: Start difference. First operand 20168 states and 62360 transitions. Second operand 7 states. [2019-12-18 21:25:28,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:28,012 INFO L93 Difference]: Finished difference Result 46484 states and 138742 transitions. [2019-12-18 21:25:28,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 21:25:28,013 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 21:25:28,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:28,100 INFO L225 Difference]: With dead ends: 46484 [2019-12-18 21:25:28,100 INFO L226 Difference]: Without dead ends: 46484 [2019-12-18 21:25:28,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-18 21:25:28,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46484 states. [2019-12-18 21:25:28,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46484 to 21453. [2019-12-18 21:25:28,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21453 states. [2019-12-18 21:25:28,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21453 states to 21453 states and 66323 transitions. [2019-12-18 21:25:28,597 INFO L78 Accepts]: Start accepts. Automaton has 21453 states and 66323 transitions. Word has length 33 [2019-12-18 21:25:28,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:28,597 INFO L462 AbstractCegarLoop]: Abstraction has 21453 states and 66323 transitions. [2019-12-18 21:25:28,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:25:28,597 INFO L276 IsEmpty]: Start isEmpty. Operand 21453 states and 66323 transitions. [2019-12-18 21:25:28,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:25:28,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:28,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:28,620 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:28,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:28,620 INFO L82 PathProgramCache]: Analyzing trace with hash 88321435, now seen corresponding path program 1 times [2019-12-18 21:25:28,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:28,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586004718] [2019-12-18 21:25:28,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:28,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:28,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586004718] [2019-12-18 21:25:28,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:28,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:25:28,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793712559] [2019-12-18 21:25:28,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:25:28,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:28,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:25:28,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:28,660 INFO L87 Difference]: Start difference. First operand 21453 states and 66323 transitions. Second operand 3 states. [2019-12-18 21:25:28,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:28,778 INFO L93 Difference]: Finished difference Result 28695 states and 85797 transitions. [2019-12-18 21:25:28,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:25:28,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-18 21:25:28,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:28,819 INFO L225 Difference]: With dead ends: 28695 [2019-12-18 21:25:28,819 INFO L226 Difference]: Without dead ends: 28695 [2019-12-18 21:25:28,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:28,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28695 states. [2019-12-18 21:25:29,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28695 to 20429. [2019-12-18 21:25:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20429 states. [2019-12-18 21:25:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20429 states to 20429 states and 61176 transitions. [2019-12-18 21:25:29,195 INFO L78 Accepts]: Start accepts. Automaton has 20429 states and 61176 transitions. Word has length 33 [2019-12-18 21:25:29,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:29,196 INFO L462 AbstractCegarLoop]: Abstraction has 20429 states and 61176 transitions. [2019-12-18 21:25:29,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:25:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand 20429 states and 61176 transitions. [2019-12-18 21:25:29,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:25:29,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:29,216 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:29,216 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:29,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:29,216 INFO L82 PathProgramCache]: Analyzing trace with hash 838482894, now seen corresponding path program 2 times [2019-12-18 21:25:29,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:29,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979182962] [2019-12-18 21:25:29,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:29,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:29,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979182962] [2019-12-18 21:25:29,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:29,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:25:29,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252126004] [2019-12-18 21:25:29,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:25:29,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:29,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:25:29,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:25:29,430 INFO L87 Difference]: Start difference. First operand 20429 states and 61176 transitions. Second operand 10 states. [2019-12-18 21:25:32,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:32,478 INFO L93 Difference]: Finished difference Result 50109 states and 147731 transitions. [2019-12-18 21:25:32,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 21:25:32,479 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-12-18 21:25:32,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:32,552 INFO L225 Difference]: With dead ends: 50109 [2019-12-18 21:25:32,553 INFO L226 Difference]: Without dead ends: 50109 [2019-12-18 21:25:32,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=262, Invalid=998, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 21:25:32,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50109 states. [2019-12-18 21:25:33,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50109 to 20857. [2019-12-18 21:25:33,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20857 states. [2019-12-18 21:25:33,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20857 states to 20857 states and 62518 transitions. [2019-12-18 21:25:33,064 INFO L78 Accepts]: Start accepts. Automaton has 20857 states and 62518 transitions. Word has length 33 [2019-12-18 21:25:33,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:33,064 INFO L462 AbstractCegarLoop]: Abstraction has 20857 states and 62518 transitions. [2019-12-18 21:25:33,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:25:33,065 INFO L276 IsEmpty]: Start isEmpty. Operand 20857 states and 62518 transitions. [2019-12-18 21:25:33,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 21:25:33,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:33,082 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] [2019-12-18 21:25:33,082 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:33,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:33,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1993650805, now seen corresponding path program 1 times [2019-12-18 21:25:33,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:33,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889355641] [2019-12-18 21:25:33,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:33,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889355641] [2019-12-18 21:25:33,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:33,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:25:33,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279634656] [2019-12-18 21:25:33,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:25:33,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:33,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:25:33,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:25:33,189 INFO L87 Difference]: Start difference. First operand 20857 states and 62518 transitions. Second operand 7 states. [2019-12-18 21:25:34,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:34,794 INFO L93 Difference]: Finished difference Result 36855 states and 108107 transitions. [2019-12-18 21:25:34,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 21:25:34,795 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 21:25:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:34,846 INFO L225 Difference]: With dead ends: 36855 [2019-12-18 21:25:34,846 INFO L226 Difference]: Without dead ends: 36855 [2019-12-18 21:25:34,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:25:34,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36855 states. [2019-12-18 21:25:35,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36855 to 20079. [2019-12-18 21:25:35,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20079 states. [2019-12-18 21:25:35,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20079 states to 20079 states and 60181 transitions. [2019-12-18 21:25:35,253 INFO L78 Accepts]: Start accepts. Automaton has 20079 states and 60181 transitions. Word has length 34 [2019-12-18 21:25:35,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:35,254 INFO L462 AbstractCegarLoop]: Abstraction has 20079 states and 60181 transitions. [2019-12-18 21:25:35,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:25:35,254 INFO L276 IsEmpty]: Start isEmpty. Operand 20079 states and 60181 transitions. [2019-12-18 21:25:35,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 21:25:35,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:35,272 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] [2019-12-18 21:25:35,272 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:35,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:35,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1065822653, now seen corresponding path program 2 times [2019-12-18 21:25:35,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:35,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147582829] [2019-12-18 21:25:35,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:35,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:35,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147582829] [2019-12-18 21:25:35,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:35,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:25:35,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050006673] [2019-12-18 21:25:35,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 21:25:35,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:35,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 21:25:35,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:25:35,426 INFO L87 Difference]: Start difference. First operand 20079 states and 60181 transitions. Second operand 8 states. [2019-12-18 21:25:37,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:37,158 INFO L93 Difference]: Finished difference Result 39924 states and 116723 transitions. [2019-12-18 21:25:37,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 21:25:37,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-18 21:25:37,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:37,213 INFO L225 Difference]: With dead ends: 39924 [2019-12-18 21:25:37,213 INFO L226 Difference]: Without dead ends: 39924 [2019-12-18 21:25:37,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-12-18 21:25:37,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39924 states. [2019-12-18 21:25:37,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39924 to 19854. [2019-12-18 21:25:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19854 states. [2019-12-18 21:25:37,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19854 states to 19854 states and 59535 transitions. [2019-12-18 21:25:37,639 INFO L78 Accepts]: Start accepts. Automaton has 19854 states and 59535 transitions. Word has length 34 [2019-12-18 21:25:37,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:37,640 INFO L462 AbstractCegarLoop]: Abstraction has 19854 states and 59535 transitions. [2019-12-18 21:25:37,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 21:25:37,640 INFO L276 IsEmpty]: Start isEmpty. Operand 19854 states and 59535 transitions. [2019-12-18 21:25:37,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 21:25:37,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:37,662 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] [2019-12-18 21:25:37,663 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:37,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:37,663 INFO L82 PathProgramCache]: Analyzing trace with hash 172467434, now seen corresponding path program 1 times [2019-12-18 21:25:37,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:37,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638385625] [2019-12-18 21:25:37,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:37,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-18 21:25:37,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638385625] [2019-12-18 21:25:37,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:37,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:25:37,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054645807] [2019-12-18 21:25:37,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:25:37,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:37,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:25:37,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:25:37,772 INFO L87 Difference]: Start difference. First operand 19854 states and 59535 transitions. Second operand 7 states. [2019-12-18 21:25:38,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:38,944 INFO L93 Difference]: Finished difference Result 47593 states and 139511 transitions. [2019-12-18 21:25:38,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:25:38,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-12-18 21:25:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:39,025 INFO L225 Difference]: With dead ends: 47593 [2019-12-18 21:25:39,025 INFO L226 Difference]: Without dead ends: 47593 [2019-12-18 21:25:39,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:25:39,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47593 states. [2019-12-18 21:25:39,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47593 to 19331. [2019-12-18 21:25:39,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19331 states. [2019-12-18 21:25:39,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19331 states to 19331 states and 57999 transitions. [2019-12-18 21:25:39,501 INFO L78 Accepts]: Start accepts. Automaton has 19331 states and 57999 transitions. Word has length 37 [2019-12-18 21:25:39,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:39,502 INFO L462 AbstractCegarLoop]: Abstraction has 19331 states and 57999 transitions. [2019-12-18 21:25:39,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:25:39,502 INFO L276 IsEmpty]: Start isEmpty. Operand 19331 states and 57999 transitions. [2019-12-18 21:25:39,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:25:39,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:39,529 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:39,530 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:39,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:39,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1628928242, now seen corresponding path program 1 times [2019-12-18 21:25:39,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:39,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015934262] [2019-12-18 21:25:39,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:39,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015934262] [2019-12-18 21:25:39,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:39,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:25:39,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551247264] [2019-12-18 21:25:39,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:25:39,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:39,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:25:39,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:25:39,605 INFO L87 Difference]: Start difference. First operand 19331 states and 57999 transitions. Second operand 4 states. [2019-12-18 21:25:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:39,719 INFO L93 Difference]: Finished difference Result 32212 states and 96900 transitions. [2019-12-18 21:25:39,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:25:39,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-18 21:25:39,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:39,744 INFO L225 Difference]: With dead ends: 32212 [2019-12-18 21:25:39,744 INFO L226 Difference]: Without dead ends: 16293 [2019-12-18 21:25:39,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:25:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16293 states. [2019-12-18 21:25:39,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16293 to 16170. [2019-12-18 21:25:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16170 states. [2019-12-18 21:25:39,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16170 states to 16170 states and 47613 transitions. [2019-12-18 21:25:39,989 INFO L78 Accepts]: Start accepts. Automaton has 16170 states and 47613 transitions. Word has length 39 [2019-12-18 21:25:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:39,989 INFO L462 AbstractCegarLoop]: Abstraction has 16170 states and 47613 transitions. [2019-12-18 21:25:39,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:25:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand 16170 states and 47613 transitions. [2019-12-18 21:25:40,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:25:40,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:40,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:40,004 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:40,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:40,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2089566008, now seen corresponding path program 2 times [2019-12-18 21:25:40,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:40,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57763349] [2019-12-18 21:25:40,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:40,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:40,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57763349] [2019-12-18 21:25:40,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:40,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:25:40,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369143628] [2019-12-18 21:25:40,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:25:40,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:40,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:25:40,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:40,055 INFO L87 Difference]: Start difference. First operand 16170 states and 47613 transitions. Second operand 3 states. [2019-12-18 21:25:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:40,155 INFO L93 Difference]: Finished difference Result 24901 states and 73708 transitions. [2019-12-18 21:25:40,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:25:40,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 21:25:40,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:40,175 INFO L225 Difference]: With dead ends: 24901 [2019-12-18 21:25:40,175 INFO L226 Difference]: Without dead ends: 11215 [2019-12-18 21:25:40,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:40,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11215 states. [2019-12-18 21:25:40,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11215 to 11106. [2019-12-18 21:25:40,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11106 states. [2019-12-18 21:25:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11106 states to 11106 states and 31474 transitions. [2019-12-18 21:25:40,471 INFO L78 Accepts]: Start accepts. Automaton has 11106 states and 31474 transitions. Word has length 39 [2019-12-18 21:25:40,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:40,471 INFO L462 AbstractCegarLoop]: Abstraction has 11106 states and 31474 transitions. [2019-12-18 21:25:40,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:25:40,471 INFO L276 IsEmpty]: Start isEmpty. Operand 11106 states and 31474 transitions. [2019-12-18 21:25:40,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 21:25:40,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:40,481 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:40,481 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:40,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:40,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1423567527, now seen corresponding path program 1 times [2019-12-18 21:25:40,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:40,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016321156] [2019-12-18 21:25:40,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:40,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016321156] [2019-12-18 21:25:40,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:40,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:25:40,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557225393] [2019-12-18 21:25:40,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:25:40,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:40,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:25:40,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:25:40,554 INFO L87 Difference]: Start difference. First operand 11106 states and 31474 transitions. Second operand 5 states. [2019-12-18 21:25:41,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:41,090 INFO L93 Difference]: Finished difference Result 18303 states and 51611 transitions. [2019-12-18 21:25:41,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:25:41,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 21:25:41,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:41,115 INFO L225 Difference]: With dead ends: 18303 [2019-12-18 21:25:41,115 INFO L226 Difference]: Without dead ends: 18303 [2019-12-18 21:25:41,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:25:41,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18303 states. [2019-12-18 21:25:41,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18303 to 17140. [2019-12-18 21:25:41,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-18 21:25:41,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 48576 transitions. [2019-12-18 21:25:41,370 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 48576 transitions. Word has length 40 [2019-12-18 21:25:41,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:41,370 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 48576 transitions. [2019-12-18 21:25:41,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:25:41,370 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 48576 transitions. [2019-12-18 21:25:41,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 21:25:41,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:41,386 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:41,386 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:41,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:41,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1539619421, now seen corresponding path program 2 times [2019-12-18 21:25:41,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:41,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009854476] [2019-12-18 21:25:41,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:41,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-18 21:25:41,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009854476] [2019-12-18 21:25:41,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:41,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:25:41,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677772308] [2019-12-18 21:25:41,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:25:41,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:41,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:25:41,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:25:41,443 INFO L87 Difference]: Start difference. First operand 17140 states and 48576 transitions. Second operand 5 states. [2019-12-18 21:25:41,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:41,524 INFO L93 Difference]: Finished difference Result 16032 states and 46074 transitions. [2019-12-18 21:25:41,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:25:41,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 21:25:41,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:41,546 INFO L225 Difference]: With dead ends: 16032 [2019-12-18 21:25:41,546 INFO L226 Difference]: Without dead ends: 12149 [2019-12-18 21:25:41,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:25:41,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12149 states. [2019-12-18 21:25:41,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12149 to 11603. [2019-12-18 21:25:41,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11603 states. [2019-12-18 21:25:41,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11603 states to 11603 states and 36051 transitions. [2019-12-18 21:25:41,823 INFO L78 Accepts]: Start accepts. Automaton has 11603 states and 36051 transitions. Word has length 40 [2019-12-18 21:25:41,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:41,823 INFO L462 AbstractCegarLoop]: Abstraction has 11603 states and 36051 transitions. [2019-12-18 21:25:41,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:25:41,824 INFO L276 IsEmpty]: Start isEmpty. Operand 11603 states and 36051 transitions. [2019-12-18 21:25:41,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:25:41,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:41,845 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:41,845 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:41,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:41,846 INFO L82 PathProgramCache]: Analyzing trace with hash 987827026, now seen corresponding path program 1 times [2019-12-18 21:25:41,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:41,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671422126] [2019-12-18 21:25:41,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:41,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:41,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671422126] [2019-12-18 21:25:41,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:41,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:25:41,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359167585] [2019-12-18 21:25:41,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 21:25:41,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:41,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 21:25:41,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:25:41,946 INFO L87 Difference]: Start difference. First operand 11603 states and 36051 transitions. Second operand 8 states. [2019-12-18 21:25:42,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:42,764 INFO L93 Difference]: Finished difference Result 31587 states and 96004 transitions. [2019-12-18 21:25:42,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:25:42,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 21:25:42,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:42,795 INFO L225 Difference]: With dead ends: 31587 [2019-12-18 21:25:42,795 INFO L226 Difference]: Without dead ends: 22364 [2019-12-18 21:25:42,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-18 21:25:42,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22364 states. [2019-12-18 21:25:43,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22364 to 13002. [2019-12-18 21:25:43,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13002 states. [2019-12-18 21:25:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13002 states to 13002 states and 40180 transitions. [2019-12-18 21:25:43,060 INFO L78 Accepts]: Start accepts. Automaton has 13002 states and 40180 transitions. Word has length 64 [2019-12-18 21:25:43,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:43,061 INFO L462 AbstractCegarLoop]: Abstraction has 13002 states and 40180 transitions. [2019-12-18 21:25:43,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 21:25:43,061 INFO L276 IsEmpty]: Start isEmpty. Operand 13002 states and 40180 transitions. [2019-12-18 21:25:43,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:25:43,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:43,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:43,076 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:43,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:43,076 INFO L82 PathProgramCache]: Analyzing trace with hash -2017353844, now seen corresponding path program 2 times [2019-12-18 21:25:43,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:43,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014802663] [2019-12-18 21:25:43,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:43,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:43,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014802663] [2019-12-18 21:25:43,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:43,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:25:43,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107740381] [2019-12-18 21:25:43,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:25:43,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:43,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:25:43,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:25:43,162 INFO L87 Difference]: Start difference. First operand 13002 states and 40180 transitions. Second operand 7 states. [2019-12-18 21:25:43,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:43,589 INFO L93 Difference]: Finished difference Result 25517 states and 77689 transitions. [2019-12-18 21:25:43,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:25:43,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 21:25:43,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:43,615 INFO L225 Difference]: With dead ends: 25517 [2019-12-18 21:25:43,615 INFO L226 Difference]: Without dead ends: 18011 [2019-12-18 21:25:43,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:25:43,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18011 states. [2019-12-18 21:25:43,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18011 to 14998. [2019-12-18 21:25:43,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14998 states. [2019-12-18 21:25:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14998 states to 14998 states and 46106 transitions. [2019-12-18 21:25:43,859 INFO L78 Accepts]: Start accepts. Automaton has 14998 states and 46106 transitions. Word has length 64 [2019-12-18 21:25:43,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:43,860 INFO L462 AbstractCegarLoop]: Abstraction has 14998 states and 46106 transitions. [2019-12-18 21:25:43,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:25:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 14998 states and 46106 transitions. [2019-12-18 21:25:43,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:25:43,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:43,876 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:43,876 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:43,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:43,877 INFO L82 PathProgramCache]: Analyzing trace with hash -838064708, now seen corresponding path program 3 times [2019-12-18 21:25:43,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:43,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005322018] [2019-12-18 21:25:43,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:43,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-18 21:25:43,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005322018] [2019-12-18 21:25:43,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:43,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:25:43,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387787684] [2019-12-18 21:25:43,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:25:43,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:43,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:25:43,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:25:43,995 INFO L87 Difference]: Start difference. First operand 14998 states and 46106 transitions. Second operand 9 states. [2019-12-18 21:25:45,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:45,047 INFO L93 Difference]: Finished difference Result 47487 states and 143893 transitions. [2019-12-18 21:25:45,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 21:25:45,048 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 21:25:45,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:45,111 INFO L225 Difference]: With dead ends: 47487 [2019-12-18 21:25:45,111 INFO L226 Difference]: Without dead ends: 43783 [2019-12-18 21:25:45,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:25:45,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43783 states. [2019-12-18 21:25:45,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43783 to 15242. [2019-12-18 21:25:45,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15242 states. [2019-12-18 21:25:45,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15242 states to 15242 states and 46856 transitions. [2019-12-18 21:25:45,536 INFO L78 Accepts]: Start accepts. Automaton has 15242 states and 46856 transitions. Word has length 64 [2019-12-18 21:25:45,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:45,536 INFO L462 AbstractCegarLoop]: Abstraction has 15242 states and 46856 transitions. [2019-12-18 21:25:45,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:25:45,536 INFO L276 IsEmpty]: Start isEmpty. Operand 15242 states and 46856 transitions. [2019-12-18 21:25:45,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:25:45,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:45,553 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:45,553 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:45,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:45,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1593875220, now seen corresponding path program 4 times [2019-12-18 21:25:45,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:45,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124576875] [2019-12-18 21:25:45,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:45,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:45,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124576875] [2019-12-18 21:25:45,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:45,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:25:45,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57824902] [2019-12-18 21:25:45,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:25:45,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:45,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:25:45,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:25:45,677 INFO L87 Difference]: Start difference. First operand 15242 states and 46856 transitions. Second operand 9 states. [2019-12-18 21:25:46,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:46,693 INFO L93 Difference]: Finished difference Result 35308 states and 106791 transitions. [2019-12-18 21:25:46,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 21:25:46,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 21:25:46,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:46,737 INFO L225 Difference]: With dead ends: 35308 [2019-12-18 21:25:46,737 INFO L226 Difference]: Without dead ends: 32492 [2019-12-18 21:25:46,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-18 21:25:46,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32492 states. [2019-12-18 21:25:47,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32492 to 14995. [2019-12-18 21:25:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14995 states. [2019-12-18 21:25:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14995 states to 14995 states and 46188 transitions. [2019-12-18 21:25:47,219 INFO L78 Accepts]: Start accepts. Automaton has 14995 states and 46188 transitions. Word has length 64 [2019-12-18 21:25:47,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:47,220 INFO L462 AbstractCegarLoop]: Abstraction has 14995 states and 46188 transitions. [2019-12-18 21:25:47,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:25:47,220 INFO L276 IsEmpty]: Start isEmpty. Operand 14995 states and 46188 transitions. [2019-12-18 21:25:47,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:25:47,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:47,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:47,237 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:47,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:47,238 INFO L82 PathProgramCache]: Analyzing trace with hash -406759870, now seen corresponding path program 5 times [2019-12-18 21:25:47,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:47,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035664121] [2019-12-18 21:25:47,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:47,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035664121] [2019-12-18 21:25:47,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:47,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:25:47,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441712847] [2019-12-18 21:25:47,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:25:47,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:47,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:25:47,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:25:47,312 INFO L87 Difference]: Start difference. First operand 14995 states and 46188 transitions. Second operand 7 states. [2019-12-18 21:25:47,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:47,620 INFO L93 Difference]: Finished difference Result 25424 states and 76786 transitions. [2019-12-18 21:25:47,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:25:47,621 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 21:25:47,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:47,648 INFO L225 Difference]: With dead ends: 25424 [2019-12-18 21:25:47,648 INFO L226 Difference]: Without dead ends: 18543 [2019-12-18 21:25:47,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:25:47,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18543 states. [2019-12-18 21:25:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18543 to 15177. [2019-12-18 21:25:47,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15177 states. [2019-12-18 21:25:47,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15177 states to 15177 states and 46658 transitions. [2019-12-18 21:25:47,904 INFO L78 Accepts]: Start accepts. Automaton has 15177 states and 46658 transitions. Word has length 64 [2019-12-18 21:25:47,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:47,904 INFO L462 AbstractCegarLoop]: Abstraction has 15177 states and 46658 transitions. [2019-12-18 21:25:47,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:25:47,904 INFO L276 IsEmpty]: Start isEmpty. Operand 15177 states and 46658 transitions. [2019-12-18 21:25:47,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:25:47,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:47,921 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:47,921 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:47,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:47,921 INFO L82 PathProgramCache]: Analyzing trace with hash -2083011794, now seen corresponding path program 6 times [2019-12-18 21:25:47,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:47,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118825994] [2019-12-18 21:25:47,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:47,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118825994] [2019-12-18 21:25:47,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:47,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:25:47,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756685058] [2019-12-18 21:25:47,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:25:47,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:47,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:25:47,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:47,986 INFO L87 Difference]: Start difference. First operand 15177 states and 46658 transitions. Second operand 3 states. [2019-12-18 21:25:48,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:48,096 INFO L93 Difference]: Finished difference Result 17457 states and 53624 transitions. [2019-12-18 21:25:48,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:25:48,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 21:25:48,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:48,127 INFO L225 Difference]: With dead ends: 17457 [2019-12-18 21:25:48,127 INFO L226 Difference]: Without dead ends: 17457 [2019-12-18 21:25:48,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:48,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17457 states. [2019-12-18 21:25:48,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17457 to 15237. [2019-12-18 21:25:48,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15237 states. [2019-12-18 21:25:48,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15237 states to 15237 states and 47122 transitions. [2019-12-18 21:25:48,380 INFO L78 Accepts]: Start accepts. Automaton has 15237 states and 47122 transitions. Word has length 64 [2019-12-18 21:25:48,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:48,380 INFO L462 AbstractCegarLoop]: Abstraction has 15237 states and 47122 transitions. [2019-12-18 21:25:48,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:25:48,380 INFO L276 IsEmpty]: Start isEmpty. Operand 15237 states and 47122 transitions. [2019-12-18 21:25:48,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:25:48,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:48,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:48,396 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:48,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:48,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2130207003, now seen corresponding path program 1 times [2019-12-18 21:25:48,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:48,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627524706] [2019-12-18 21:25:48,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:48,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:48,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627524706] [2019-12-18 21:25:48,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:48,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:25:48,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910514780] [2019-12-18 21:25:48,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:25:48,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:48,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:25:48,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:25:48,453 INFO L87 Difference]: Start difference. First operand 15237 states and 47122 transitions. Second operand 4 states. [2019-12-18 21:25:48,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:48,637 INFO L93 Difference]: Finished difference Result 19409 states and 59663 transitions. [2019-12-18 21:25:48,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:25:48,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 21:25:48,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:48,665 INFO L225 Difference]: With dead ends: 19409 [2019-12-18 21:25:48,665 INFO L226 Difference]: Without dead ends: 19409 [2019-12-18 21:25:48,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:25:48,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19409 states. [2019-12-18 21:25:48,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19409 to 15786. [2019-12-18 21:25:48,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15786 states. [2019-12-18 21:25:48,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15786 states to 15786 states and 48839 transitions. [2019-12-18 21:25:48,953 INFO L78 Accepts]: Start accepts. Automaton has 15786 states and 48839 transitions. Word has length 65 [2019-12-18 21:25:48,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:48,953 INFO L462 AbstractCegarLoop]: Abstraction has 15786 states and 48839 transitions. [2019-12-18 21:25:48,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:25:48,953 INFO L276 IsEmpty]: Start isEmpty. Operand 15786 states and 48839 transitions. [2019-12-18 21:25:48,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:25:48,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:48,972 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:48,972 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:48,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:48,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1591994433, now seen corresponding path program 2 times [2019-12-18 21:25:48,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:48,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926379056] [2019-12-18 21:25:48,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:49,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:49,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926379056] [2019-12-18 21:25:49,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:49,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:25:49,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847514537] [2019-12-18 21:25:49,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:25:49,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:49,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:25:49,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:25:49,244 INFO L87 Difference]: Start difference. First operand 15786 states and 48839 transitions. Second operand 9 states. [2019-12-18 21:25:50,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:50,331 INFO L93 Difference]: Finished difference Result 40948 states and 123085 transitions. [2019-12-18 21:25:50,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 21:25:50,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 21:25:50,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:50,377 INFO L225 Difference]: With dead ends: 40948 [2019-12-18 21:25:50,377 INFO L226 Difference]: Without dead ends: 33408 [2019-12-18 21:25:50,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:25:50,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33408 states. [2019-12-18 21:25:50,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33408 to 15725. [2019-12-18 21:25:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15725 states. [2019-12-18 21:25:50,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15725 states to 15725 states and 48149 transitions. [2019-12-18 21:25:50,745 INFO L78 Accepts]: Start accepts. Automaton has 15725 states and 48149 transitions. Word has length 65 [2019-12-18 21:25:50,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:50,745 INFO L462 AbstractCegarLoop]: Abstraction has 15725 states and 48149 transitions. [2019-12-18 21:25:50,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:25:50,745 INFO L276 IsEmpty]: Start isEmpty. Operand 15725 states and 48149 transitions. [2019-12-18 21:25:50,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:25:50,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:50,761 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:50,761 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:50,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:50,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1318305515, now seen corresponding path program 3 times [2019-12-18 21:25:50,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:50,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440743328] [2019-12-18 21:25:50,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:50,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440743328] [2019-12-18 21:25:50,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:50,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:25:50,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202281286] [2019-12-18 21:25:50,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:25:50,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:50,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:25:50,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:25:50,897 INFO L87 Difference]: Start difference. First operand 15725 states and 48149 transitions. Second operand 9 states. [2019-12-18 21:25:51,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:51,866 INFO L93 Difference]: Finished difference Result 32159 states and 96609 transitions. [2019-12-18 21:25:51,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 21:25:51,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 21:25:51,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:51,918 INFO L225 Difference]: With dead ends: 32159 [2019-12-18 21:25:51,918 INFO L226 Difference]: Without dead ends: 28454 [2019-12-18 21:25:51,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-18 21:25:52,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28454 states. [2019-12-18 21:25:52,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28454 to 15211. [2019-12-18 21:25:52,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15211 states. [2019-12-18 21:25:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15211 states to 15211 states and 46602 transitions. [2019-12-18 21:25:52,246 INFO L78 Accepts]: Start accepts. Automaton has 15211 states and 46602 transitions. Word has length 65 [2019-12-18 21:25:52,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:52,246 INFO L462 AbstractCegarLoop]: Abstraction has 15211 states and 46602 transitions. [2019-12-18 21:25:52,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:25:52,246 INFO L276 IsEmpty]: Start isEmpty. Operand 15211 states and 46602 transitions. [2019-12-18 21:25:52,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:25:52,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:52,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:52,262 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:52,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:52,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2022119832, now seen corresponding path program 1 times [2019-12-18 21:25:52,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:52,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988394055] [2019-12-18 21:25:52,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:52,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:52,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988394055] [2019-12-18 21:25:52,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:52,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:25:52,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151391905] [2019-12-18 21:25:52,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:25:52,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:52,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:25:52,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:52,327 INFO L87 Difference]: Start difference. First operand 15211 states and 46602 transitions. Second operand 3 states. [2019-12-18 21:25:52,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:52,389 INFO L93 Difference]: Finished difference Result 15211 states and 46601 transitions. [2019-12-18 21:25:52,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:25:52,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 21:25:52,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:52,413 INFO L225 Difference]: With dead ends: 15211 [2019-12-18 21:25:52,413 INFO L226 Difference]: Without dead ends: 15211 [2019-12-18 21:25:52,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:52,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15211 states. [2019-12-18 21:25:52,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15211 to 14277. [2019-12-18 21:25:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14277 states. [2019-12-18 21:25:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14277 states to 14277 states and 44051 transitions. [2019-12-18 21:25:52,761 INFO L78 Accepts]: Start accepts. Automaton has 14277 states and 44051 transitions. Word has length 65 [2019-12-18 21:25:52,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:52,762 INFO L462 AbstractCegarLoop]: Abstraction has 14277 states and 44051 transitions. [2019-12-18 21:25:52,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:25:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 14277 states and 44051 transitions. [2019-12-18 21:25:52,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:25:52,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:52,780 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:52,780 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:52,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:52,780 INFO L82 PathProgramCache]: Analyzing trace with hash -665679131, now seen corresponding path program 1 times [2019-12-18 21:25:52,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:52,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837338003] [2019-12-18 21:25:52,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:52,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-18 21:25:52,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837338003] [2019-12-18 21:25:52,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:52,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:25:52,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170698102] [2019-12-18 21:25:52,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:25:52,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:52,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:25:52,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:52,830 INFO L87 Difference]: Start difference. First operand 14277 states and 44051 transitions. Second operand 3 states. [2019-12-18 21:25:52,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:52,890 INFO L93 Difference]: Finished difference Result 12651 states and 38448 transitions. [2019-12-18 21:25:52,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:25:52,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 21:25:52,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:52,913 INFO L225 Difference]: With dead ends: 12651 [2019-12-18 21:25:52,914 INFO L226 Difference]: Without dead ends: 12651 [2019-12-18 21:25:52,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:52,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12651 states. [2019-12-18 21:25:53,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12651 to 12398. [2019-12-18 21:25:53,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12398 states. [2019-12-18 21:25:53,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12398 states to 12398 states and 37729 transitions. [2019-12-18 21:25:53,121 INFO L78 Accepts]: Start accepts. Automaton has 12398 states and 37729 transitions. Word has length 66 [2019-12-18 21:25:53,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:53,121 INFO L462 AbstractCegarLoop]: Abstraction has 12398 states and 37729 transitions. [2019-12-18 21:25:53,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:25:53,121 INFO L276 IsEmpty]: Start isEmpty. Operand 12398 states and 37729 transitions. [2019-12-18 21:25:53,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:25:53,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:53,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:53,135 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:53,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:53,135 INFO L82 PathProgramCache]: Analyzing trace with hash -611821270, now seen corresponding path program 1 times [2019-12-18 21:25:53,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:53,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299616113] [2019-12-18 21:25:53,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:25:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:25:53,252 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:25:53,253 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:25:53,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= v_~x~0_11 0) (= 0 v_~a$mem_tmp~0_9) (= v_~a~0_26 0) (= v_~a$r_buff0_thd0~0_20 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= v_~y~0_14 0) (= v_~a$r_buff0_thd2~0_19 0) (= |v_#NULL.offset_6| 0) (= 0 v_~a$read_delayed~0_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t1105~0.base_23|) 0) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~a$r_buff1_thd1~0_19) (= 0 v_~z~0_6) (= 0 |v_ULTIMATE.start_main_~#t1105~0.offset_18|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1105~0.base_23| 4)) (< 0 |v_#StackHeapBarrier_19|) (= 0 v_~a$r_buff1_thd3~0_52) (= v_~a$r_buff0_thd3~0_77 0) (= v_~a$flush_delayed~0_12 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1105~0.base_23| 1) |v_#valid_63|) (= 0 v_~a$r_buff1_thd0~0_26) (= 0 v_~a$w_buff0~0_23) (= 0 v_~a$w_buff0_used~0_113) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~a$r_buff0_thd1~0_28 0) (= v_~__unbuffered_p2_EBX~0_15 0) (= 0 v_~__unbuffered_p0_EAX~0_17) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1105~0.base_23|) (= 0 v_~__unbuffered_p2_EAX~0_14) (= 0 v_~a$r_buff1_thd2~0_21) (= 0 v_~a$w_buff1~0_25) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1105~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1105~0.base_23|) |v_ULTIMATE.start_main_~#t1105~0.offset_18| 0)) |v_#memory_int_21|) (= 0 v_~a$w_buff1_used~0_76))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1107~0.offset=|v_ULTIMATE.start_main_~#t1107~0.offset_16|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_10|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_20, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_10|, ~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ULTIMATE.start_main_~#t1106~0.base=|v_ULTIMATE.start_main_~#t1106~0.base_21|, ULTIMATE.start_main_~#t1105~0.base=|v_ULTIMATE.start_main_~#t1105~0.base_23|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_113, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1105~0.offset=|v_ULTIMATE.start_main_~#t1105~0.offset_18|, ~a$w_buff0~0=v_~a$w_buff0~0_23, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_26, ULTIMATE.start_main_~#t1106~0.offset=|v_ULTIMATE.start_main_~#t1106~0.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_11, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ULTIMATE.start_main_~#t1107~0.base=|v_ULTIMATE.start_main_~#t1107~0.base_20|, ~a$mem_tmp~0=v_~a$mem_tmp~0_9, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_10|, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_77, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_6, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_76, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1107~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1106~0.base, ULTIMATE.start_main_~#t1105~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1105~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ULTIMATE.start_main_~#t1106~0.offset, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t1107~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 21:25:53,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L830-1-->L832: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1106~0.base_9| 1)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1106~0.base_9| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t1106~0.base_9|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1106~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1106~0.base_9|) |v_ULTIMATE.start_main_~#t1106~0.offset_7| 1))) (= |v_ULTIMATE.start_main_~#t1106~0.offset_7| 0) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1106~0.base_9|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1106~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1106~0.offset=|v_ULTIMATE.start_main_~#t1106~0.offset_7|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1106~0.base=|v_ULTIMATE.start_main_~#t1106~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1106~0.offset, #length, ULTIMATE.start_main_~#t1106~0.base] because there is no mapped edge [2019-12-18 21:25:53,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L832-1-->L834: Formula: (and (= |v_ULTIMATE.start_main_~#t1107~0.offset_8| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1107~0.base_9|)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1107~0.base_9|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1107~0.base_9|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1107~0.base_9| 4) |v_#length_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1107~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1107~0.base_9|) |v_ULTIMATE.start_main_~#t1107~0.offset_8| 2))) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1107~0.base_9| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1107~0.offset=|v_ULTIMATE.start_main_~#t1107~0.offset_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1107~0.base=|v_ULTIMATE.start_main_~#t1107~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1107~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1107~0.base] because there is no mapped edge [2019-12-18 21:25:53,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L4-->L748: Formula: (and (= ~a$r_buff1_thd3~0_Out-441524574 ~a$r_buff0_thd3~0_In-441524574) (= ~__unbuffered_p0_EAX~0_Out-441524574 ~x~0_In-441524574) (= ~a$r_buff0_thd1~0_In-441524574 ~a$r_buff1_thd1~0_Out-441524574) (= ~a$r_buff0_thd2~0_In-441524574 ~a$r_buff1_thd2~0_Out-441524574) (= ~a$r_buff1_thd0~0_Out-441524574 ~a$r_buff0_thd0~0_In-441524574) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-441524574)) (= ~a$r_buff0_thd1~0_Out-441524574 1)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-441524574, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-441524574, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-441524574, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-441524574, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-441524574, ~x~0=~x~0_In-441524574} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-441524574, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-441524574, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-441524574, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-441524574, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-441524574, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-441524574, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-441524574, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-441524574, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-441524574, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-441524574, ~x~0=~x~0_In-441524574} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:25:53,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out-376505691| |P1Thread1of1ForFork2_#t~ite10_Out-376505691|)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-376505691 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-376505691 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-376505691| ~a~0_In-376505691) .cse0 (or .cse1 .cse2)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-376505691| ~a$w_buff1~0_In-376505691) .cse0 (not .cse2) (not .cse1)))) InVars {~a~0=~a~0_In-376505691, ~a$w_buff1~0=~a$w_buff1~0_In-376505691, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-376505691, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-376505691} OutVars{~a~0=~a~0_In-376505691, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-376505691|, ~a$w_buff1~0=~a$w_buff1~0_In-376505691, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-376505691, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-376505691|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-376505691} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 21:25:53,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L796-->L796-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In635156757 256)))) (or (and (= ~a$w_buff0~0_In635156757 |P2Thread1of1ForFork0_#t~ite21_Out635156757|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In635156757| |P2Thread1of1ForFork0_#t~ite20_Out635156757|)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out635156757| |P2Thread1of1ForFork0_#t~ite21_Out635156757|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In635156757 256)))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In635156757 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In635156757 256)) (and .cse1 (= (mod ~a$w_buff1_used~0_In635156757 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite20_Out635156757| ~a$w_buff0~0_In635156757)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In635156757, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In635156757, ~a$w_buff0_used~0=~a$w_buff0_used~0_In635156757, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In635156757, ~a$w_buff1_used~0=~a$w_buff1_used~0_In635156757, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In635156757|, ~weak$$choice2~0=~weak$$choice2~0_In635156757} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out635156757|, ~a$w_buff0~0=~a$w_buff0~0_In635156757, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In635156757, ~a$w_buff0_used~0=~a$w_buff0_used~0_In635156757, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In635156757, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out635156757|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In635156757, ~weak$$choice2~0=~weak$$choice2~0_In635156757} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 21:25:53,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1593018110 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1593018110 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1593018110| ~a$w_buff0_used~0_In1593018110)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1593018110|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1593018110, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1593018110} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1593018110, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1593018110, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1593018110|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 21:25:53,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1493060747 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1493060747 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In1493060747 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In1493060747 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1493060747|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In1493060747 |P1Thread1of1ForFork2_#t~ite12_Out1493060747|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1493060747, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1493060747, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1493060747, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1493060747} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1493060747, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1493060747, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1493060747, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1493060747|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1493060747} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 21:25:53,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L797-->L797-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-600891876 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite24_Out-600891876| |P2Thread1of1ForFork0_#t~ite23_Out-600891876|) (= ~a$w_buff1~0_In-600891876 |P2Thread1of1ForFork0_#t~ite23_Out-600891876|) .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-600891876 256) 0))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In-600891876 256) 0)) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-600891876 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In-600891876 256))))) (and (= ~a$w_buff1~0_In-600891876 |P2Thread1of1ForFork0_#t~ite24_Out-600891876|) (= |P2Thread1of1ForFork0_#t~ite23_In-600891876| |P2Thread1of1ForFork0_#t~ite23_Out-600891876|) (not .cse0)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-600891876, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-600891876|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-600891876, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-600891876, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-600891876, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-600891876, ~weak$$choice2~0=~weak$$choice2~0_In-600891876} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-600891876, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-600891876|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-600891876|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-600891876, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-600891876, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-600891876, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-600891876, ~weak$$choice2~0=~weak$$choice2~0_In-600891876} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 21:25:53,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L798-->L798-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1780703445 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_Out1780703445| |P2Thread1of1ForFork0_#t~ite27_Out1780703445|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1780703445 256)))) (or (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1780703445 256))) (= 0 (mod ~a$w_buff0_used~0_In1780703445 256)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In1780703445 256))))) (= ~a$w_buff0_used~0_In1780703445 |P2Thread1of1ForFork0_#t~ite26_Out1780703445|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In1780703445| |P2Thread1of1ForFork0_#t~ite26_Out1780703445|) (= ~a$w_buff0_used~0_In1780703445 |P2Thread1of1ForFork0_#t~ite27_Out1780703445|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1780703445|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1780703445, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1780703445, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1780703445, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1780703445, ~weak$$choice2~0=~weak$$choice2~0_In1780703445} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1780703445|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1780703445|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1780703445, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1780703445, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1780703445, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1780703445, ~weak$$choice2~0=~weak$$choice2~0_In1780703445} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 21:25:53,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1800938152 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1800938152 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1800938152|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In-1800938152 |P1Thread1of1ForFork2_#t~ite13_Out-1800938152|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1800938152, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1800938152} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1800938152, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1800938152, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1800938152|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 21:25:53,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-2037736700 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-2037736700 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-2037736700 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-2037736700 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-2037736700|)) (and (or .cse0 .cse1) (= ~a$r_buff1_thd2~0_In-2037736700 |P1Thread1of1ForFork2_#t~ite14_Out-2037736700|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2037736700, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2037736700, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2037736700, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2037736700} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2037736700, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2037736700, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2037736700, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2037736700, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-2037736700|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 21:25:53,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L772-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_17) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 21:25:53,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_51 v_~a$r_buff0_thd3~0_50)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_50, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 21:25:53,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a~0_19 v_~a$mem_tmp~0_5) (= v_~a$flush_delayed~0_7 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_19, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 21:25:53,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In-537178692 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-537178692 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-537178692| ~a~0_In-537178692) (or .cse0 .cse1)) (and (= ~a$w_buff1~0_In-537178692 |P2Thread1of1ForFork0_#t~ite38_Out-537178692|) (not .cse1) (not .cse0)))) InVars {~a~0=~a~0_In-537178692, ~a$w_buff1~0=~a$w_buff1~0_In-537178692, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-537178692, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-537178692} OutVars{~a~0=~a~0_In-537178692, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-537178692|, ~a$w_buff1~0=~a$w_buff1~0_In-537178692, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-537178692, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-537178692} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 21:25:53,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_16 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_16, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 21:25:53,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-755884683 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In-755884683 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-755884683 |P2Thread1of1ForFork0_#t~ite40_Out-755884683|)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-755884683| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-755884683, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-755884683} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-755884683|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-755884683, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-755884683} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 21:25:53,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1854435438 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1854435438 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out1854435438| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In1854435438 |P0Thread1of1ForFork1_#t~ite5_Out1854435438|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1854435438, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1854435438} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1854435438|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1854435438, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1854435438} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 21:25:53,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-156677204 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-156677204 256))) (.cse1 (= (mod ~a$r_buff1_thd1~0_In-156677204 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-156677204 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out-156677204| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite6_Out-156677204| ~a$w_buff1_used~0_In-156677204) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-156677204, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-156677204, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-156677204, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-156677204} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-156677204|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-156677204, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-156677204, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-156677204, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-156677204} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 21:25:53,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-1136653629 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1136653629 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out-1136653629)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd1~0_In-1136653629 ~a$r_buff0_thd1~0_Out-1136653629)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1136653629, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1136653629} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1136653629|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1136653629, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1136653629} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:25:53,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In227333529 256))) (.cse1 (= (mod ~a$r_buff1_thd1~0_In227333529 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In227333529 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd1~0_In227333529 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out227333529| ~a$r_buff1_thd1~0_In227333529)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out227333529| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In227333529, ~a$w_buff0_used~0=~a$w_buff0_used~0_In227333529, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In227333529, ~a$w_buff1_used~0=~a$w_buff1_used~0_In227333529} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out227333529|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In227333529, ~a$w_buff0_used~0=~a$w_buff0_used~0_In227333529, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In227333529, ~a$w_buff1_used~0=~a$w_buff1_used~0_In227333529} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 21:25:53,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L752-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_15, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:25:53,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-267354685 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-267354685 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In-267354685 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In-267354685 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-267354685 |P2Thread1of1ForFork0_#t~ite41_Out-267354685|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-267354685|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-267354685, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-267354685, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-267354685, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-267354685} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-267354685, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-267354685, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-267354685, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-267354685, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-267354685|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 21:25:53,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-630647716 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-630647716 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-630647716|) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-630647716| ~a$r_buff0_thd3~0_In-630647716) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-630647716, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-630647716} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-630647716, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-630647716, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-630647716|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 21:25:53,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In854374781 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In854374781 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In854374781 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In854374781 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite43_Out854374781| ~a$r_buff1_thd3~0_In854374781)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork0_#t~ite43_Out854374781| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In854374781, ~a$w_buff0_used~0=~a$w_buff0_used~0_In854374781, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In854374781, ~a$w_buff1_used~0=~a$w_buff1_used~0_In854374781} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out854374781|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In854374781, ~a$w_buff0_used~0=~a$w_buff0_used~0_In854374781, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In854374781, ~a$w_buff1_used~0=~a$w_buff1_used~0_In854374781} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 21:25:53,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_43 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 21:25:53,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:25:53,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd0~0_In-731114007 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out-731114007| |ULTIMATE.start_main_#t~ite48_Out-731114007|)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-731114007 256)))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite47_Out-731114007| ~a~0_In-731114007)) (and (not .cse1) (= ~a$w_buff1~0_In-731114007 |ULTIMATE.start_main_#t~ite47_Out-731114007|) .cse2 (not .cse0)))) InVars {~a~0=~a~0_In-731114007, ~a$w_buff1~0=~a$w_buff1~0_In-731114007, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-731114007, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-731114007} OutVars{~a~0=~a~0_In-731114007, ~a$w_buff1~0=~a$w_buff1~0_In-731114007, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-731114007|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-731114007, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-731114007|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-731114007} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 21:25:53,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In858172812 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In858172812 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out858172812|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out858172812| ~a$w_buff0_used~0_In858172812) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In858172812, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In858172812} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In858172812, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out858172812|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In858172812} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 21:25:53,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd0~0_In1356183286 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1356183286 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1356183286 256))) (.cse2 (= (mod ~a$r_buff0_thd0~0_In1356183286 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out1356183286| ~a$w_buff1_used~0_In1356183286) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out1356183286| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1356183286, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1356183286, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1356183286, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1356183286} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1356183286|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1356183286, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1356183286, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1356183286, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1356183286} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 21:25:53,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1802257968 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In1802257968 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1802257968| 0)) (and (= ~a$r_buff0_thd0~0_In1802257968 |ULTIMATE.start_main_#t~ite51_Out1802257968|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1802257968, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1802257968} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1802257968|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1802257968, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1802257968} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 21:25:53,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-1575635864 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1575635864 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-1575635864 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1575635864 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-1575635864| ~a$r_buff1_thd0~0_In-1575635864) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out-1575635864| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1575635864, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1575635864, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1575635864, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1575635864} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1575635864|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1575635864, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1575635864, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1575635864, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1575635864} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 21:25:53,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_10 0) (= 2 v_~y~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= |v_ULTIMATE.start_main_#t~ite52_12| v_~a$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_p0_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_8, 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, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:25:53,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:25:53 BasicIcfg [2019-12-18 21:25:53,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:25:53,406 INFO L168 Benchmark]: Toolchain (without parser) took 91161.59 ms. Allocated memory was 143.7 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 98.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 21:25:53,407 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 143.7 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 21:25:53,408 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.53 ms. Allocated memory was 143.7 MB in the beginning and 201.9 MB in the end (delta: 58.2 MB). Free memory was 98.4 MB in the beginning and 154.7 MB in the end (delta: -56.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:25:53,408 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.82 ms. Allocated memory is still 201.9 MB. Free memory was 154.7 MB in the beginning and 152.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:25:53,408 INFO L168 Benchmark]: Boogie Preprocessor took 42.58 ms. Allocated memory is still 201.9 MB. Free memory was 152.7 MB in the beginning and 149.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:25:53,409 INFO L168 Benchmark]: RCFGBuilder took 827.16 ms. Allocated memory is still 201.9 MB. Free memory was 149.9 MB in the beginning and 99.1 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:25:53,409 INFO L168 Benchmark]: TraceAbstraction took 89402.48 ms. Allocated memory was 201.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 99.1 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 21:25:53,414 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.46 ms. Allocated memory is still 143.7 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 810.53 ms. Allocated memory was 143.7 MB in the beginning and 201.9 MB in the end (delta: 58.2 MB). Free memory was 98.4 MB in the beginning and 154.7 MB in the end (delta: -56.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.82 ms. Allocated memory is still 201.9 MB. Free memory was 154.7 MB in the beginning and 152.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.58 ms. Allocated memory is still 201.9 MB. Free memory was 152.7 MB in the beginning and 149.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 827.16 ms. Allocated memory is still 201.9 MB. Free memory was 149.9 MB in the beginning and 99.1 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89402.48 ms. Allocated memory was 201.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 99.1 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 177 ProgramPointsBefore, 93 ProgramPointsAfterwards, 214 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7189 VarBasedMoverChecksPositive, 222 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80962 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1105, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1106, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t1107, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L762] 2 x = 1 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L782] 3 y = 2 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 89.0s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 27.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6551 SDtfs, 9910 SDslu, 17617 SDs, 0 SdLazy, 11213 SolverSat, 555 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 355 GetRequests, 45 SyntacticMatches, 16 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141665occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 37.6s AutomataMinimizationTime, 30 MinimizatonAttempts, 294888 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1311 NumberOfCodeBlocks, 1311 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1214 ConstructedInterpolants, 0 QuantifiedInterpolants, 208931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...