/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix003_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:02:55,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:02:55,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:02:55,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:02:55,975 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:02:55,977 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:02:55,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:02:55,988 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:02:55,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:02:55,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:02:55,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:02:55,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:02:55,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:02:56,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:02:56,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:02:56,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:02:56,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:02:56,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:02:56,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:02:56,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:02:56,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:02:56,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:02:56,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:02:56,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:02:56,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:02:56,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:02:56,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:02:56,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:02:56,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:02:56,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:02:56,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:02:56,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:02:56,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:02:56,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:02:56,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:02:56,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:02:56,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:02:56,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:02:56,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:02:56,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:02:56,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:02:56,037 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:02:56,066 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:02:56,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:02:56,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:02:56,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:02:56,069 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:02:56,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:02:56,069 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:02:56,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:02:56,070 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:02:56,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:02:56,070 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:02:56,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:02:56,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:02:56,071 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:02:56,071 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:02:56,071 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:02:56,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:02:56,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:02:56,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:02:56,072 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:02:56,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:02:56,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:02:56,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:02:56,076 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:02:56,076 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:02:56,077 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:02:56,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:02:56,077 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:02:56,077 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:02:56,353 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:02:56,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:02:56,375 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:02:56,376 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:02:56,376 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:02:56,377 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_power.oepc.i [2019-12-18 16:02:56,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9efedb317/3fd6189ddc2f40d18ad3dee6552cf8a8/FLAGe64b3986d [2019-12-18 16:02:56,994 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:02:56,995 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.oepc.i [2019-12-18 16:02:57,021 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9efedb317/3fd6189ddc2f40d18ad3dee6552cf8a8/FLAGe64b3986d [2019-12-18 16:02:57,273 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9efedb317/3fd6189ddc2f40d18ad3dee6552cf8a8 [2019-12-18 16:02:57,281 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:02:57,282 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:02:57,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:02:57,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:02:57,287 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:02:57,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:02:57" (1/1) ... [2019-12-18 16:02:57,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e76b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:02:57, skipping insertion in model container [2019-12-18 16:02:57,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:02:57" (1/1) ... [2019-12-18 16:02:57,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:02:57,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:02:57,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:02:57,865 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:02:57,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:02:58,003 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:02:58,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:02:58 WrapperNode [2019-12-18 16:02:58,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:02:58,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:02:58,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:02:58,005 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:02:58,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:02:58" (1/1) ... [2019-12-18 16:02:58,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:02:58" (1/1) ... [2019-12-18 16:02:58,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:02:58,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:02:58,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:02:58,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:02:58,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:02:58" (1/1) ... [2019-12-18 16:02:58,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:02:58" (1/1) ... [2019-12-18 16:02:58,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:02:58" (1/1) ... [2019-12-18 16:02:58,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:02:58" (1/1) ... [2019-12-18 16:02:58,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:02:58" (1/1) ... [2019-12-18 16:02:58,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:02:58" (1/1) ... [2019-12-18 16:02:58,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:02:58" (1/1) ... [2019-12-18 16:02:58,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:02:58,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:02:58,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:02:58,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:02:58,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:02:58" (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 16:02:58,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:02:58,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:02:58,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:02:58,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:02:58,198 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:02:58,198 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:02:58,199 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:02:58,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:02:58,200 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:02:58,200 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:02:58,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:02:58,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:02:58,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:02:58,205 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 16:02:58,924 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:02:58,925 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:02:58,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:02:58 BoogieIcfgContainer [2019-12-18 16:02:58,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:02:58,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:02:58,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:02:58,931 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:02:58,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:02:57" (1/3) ... [2019-12-18 16:02:58,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6abfc37b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:02:58, skipping insertion in model container [2019-12-18 16:02:58,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:02:58" (2/3) ... [2019-12-18 16:02:58,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6abfc37b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:02:58, skipping insertion in model container [2019-12-18 16:02:58,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:02:58" (3/3) ... [2019-12-18 16:02:58,935 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_power.oepc.i [2019-12-18 16:02:58,945 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:02:58,946 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:02:58,954 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:02:58,955 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:02:59,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,014 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,014 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,014 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,015 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,015 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,022 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,022 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,030 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,030 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,057 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,060 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,068 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,068 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,069 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,074 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,075 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:02:59,093 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 16:02:59,113 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:02:59,114 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:02:59,114 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:02:59,114 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:02:59,114 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:02:59,114 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:02:59,114 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:02:59,115 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:02:59,132 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-18 16:02:59,134 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 16:02:59,239 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 16:02:59,240 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:02:59,264 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 16:02:59,288 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 16:02:59,348 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 16:02:59,348 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:02:59,358 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 16:02:59,384 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 16:02:59,385 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:03:04,784 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 16:03:04,942 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 16:03:05,310 INFO L206 etLargeBlockEncoding]: Checked pairs total: 132619 [2019-12-18 16:03:05,311 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-18 16:03:05,315 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-18 16:03:25,632 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-18 16:03:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-18 16:03:25,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 16:03:25,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:03:25,640 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 16:03:25,641 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 16:03:25,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:03:25,647 INFO L82 PathProgramCache]: Analyzing trace with hash 919842, now seen corresponding path program 1 times [2019-12-18 16:03:25,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:03:25,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487369379] [2019-12-18 16:03:25,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:03:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:03:25,876 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 16:03:25,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487369379] [2019-12-18 16:03:25,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:03:25,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:03:25,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534599427] [2019-12-18 16:03:25,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:03:25,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:03:25,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:03:25,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:03:25,899 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-18 16:03:29,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:03:29,787 INFO L93 Difference]: Finished difference Result 119613 states and 515253 transitions. [2019-12-18 16:03:29,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:03:29,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 16:03:29,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:03:30,479 INFO L225 Difference]: With dead ends: 119613 [2019-12-18 16:03:30,479 INFO L226 Difference]: Without dead ends: 105755 [2019-12-18 16:03:30,481 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 16:03:34,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105755 states. [2019-12-18 16:03:37,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105755 to 105755. [2019-12-18 16:03:37,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105755 states. [2019-12-18 16:03:42,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105755 states to 105755 states and 454361 transitions. [2019-12-18 16:03:42,736 INFO L78 Accepts]: Start accepts. Automaton has 105755 states and 454361 transitions. Word has length 3 [2019-12-18 16:03:42,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:03:42,737 INFO L462 AbstractCegarLoop]: Abstraction has 105755 states and 454361 transitions. [2019-12-18 16:03:42,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:03:42,737 INFO L276 IsEmpty]: Start isEmpty. Operand 105755 states and 454361 transitions. [2019-12-18 16:03:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 16:03:42,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:03:42,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:03:42,742 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 16:03:42,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:03:42,742 INFO L82 PathProgramCache]: Analyzing trace with hash 474732739, now seen corresponding path program 1 times [2019-12-18 16:03:42,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:03:42,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166332929] [2019-12-18 16:03:42,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:03:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:03:42,838 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 16:03:42,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166332929] [2019-12-18 16:03:42,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:03:42,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:03:42,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526068635] [2019-12-18 16:03:42,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:03:42,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:03:42,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:03:42,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:03:42,842 INFO L87 Difference]: Start difference. First operand 105755 states and 454361 transitions. Second operand 4 states. [2019-12-18 16:03:49,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:03:49,056 INFO L93 Difference]: Finished difference Result 168845 states and 694815 transitions. [2019-12-18 16:03:49,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:03:49,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 16:03:49,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:03:49,606 INFO L225 Difference]: With dead ends: 168845 [2019-12-18 16:03:49,607 INFO L226 Difference]: Without dead ends: 168747 [2019-12-18 16:03:49,608 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 16:03:54,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168747 states. [2019-12-18 16:03:58,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168747 to 153153. [2019-12-18 16:03:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153153 states. [2019-12-18 16:03:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153153 states to 153153 states and 639357 transitions. [2019-12-18 16:03:58,816 INFO L78 Accepts]: Start accepts. Automaton has 153153 states and 639357 transitions. Word has length 11 [2019-12-18 16:03:58,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:03:58,821 INFO L462 AbstractCegarLoop]: Abstraction has 153153 states and 639357 transitions. [2019-12-18 16:03:58,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:03:58,821 INFO L276 IsEmpty]: Start isEmpty. Operand 153153 states and 639357 transitions. [2019-12-18 16:03:58,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:03:58,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:03:58,828 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:03:58,829 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 16:03:58,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:03:58,829 INFO L82 PathProgramCache]: Analyzing trace with hash -512415605, now seen corresponding path program 1 times [2019-12-18 16:03:58,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:03:58,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484835055] [2019-12-18 16:03:58,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:03:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:03:58,889 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 16:03:58,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484835055] [2019-12-18 16:03:58,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:03:58,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:03:58,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846317633] [2019-12-18 16:03:58,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:03:58,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:03:58,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:03:58,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:03:58,892 INFO L87 Difference]: Start difference. First operand 153153 states and 639357 transitions. Second operand 3 states. [2019-12-18 16:03:59,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:03:59,023 INFO L93 Difference]: Finished difference Result 33476 states and 109893 transitions. [2019-12-18 16:03:59,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:03:59,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 16:03:59,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:03:59,152 INFO L225 Difference]: With dead ends: 33476 [2019-12-18 16:03:59,153 INFO L226 Difference]: Without dead ends: 33476 [2019-12-18 16:03:59,153 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 16:03:59,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33476 states. [2019-12-18 16:04:04,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33476 to 33476. [2019-12-18 16:04:04,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33476 states. [2019-12-18 16:04:04,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33476 states to 33476 states and 109893 transitions. [2019-12-18 16:04:04,835 INFO L78 Accepts]: Start accepts. Automaton has 33476 states and 109893 transitions. Word has length 13 [2019-12-18 16:04:04,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:04,835 INFO L462 AbstractCegarLoop]: Abstraction has 33476 states and 109893 transitions. [2019-12-18 16:04:04,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:04:04,836 INFO L276 IsEmpty]: Start isEmpty. Operand 33476 states and 109893 transitions. [2019-12-18 16:04:04,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:04:04,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:04,839 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:04:04,839 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 16:04:04,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:04,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1719969010, now seen corresponding path program 1 times [2019-12-18 16:04:04,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:04,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982585056] [2019-12-18 16:04:04,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:04,966 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 16:04:04,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982585056] [2019-12-18 16:04:04,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:04,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:04:04,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596100628] [2019-12-18 16:04:04,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:04:04,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:04,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:04:04,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:04:04,972 INFO L87 Difference]: Start difference. First operand 33476 states and 109893 transitions. Second operand 4 states. [2019-12-18 16:04:05,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:05,319 INFO L93 Difference]: Finished difference Result 41508 states and 134890 transitions. [2019-12-18 16:04:05,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:04:05,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 16:04:05,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:05,421 INFO L225 Difference]: With dead ends: 41508 [2019-12-18 16:04:05,421 INFO L226 Difference]: Without dead ends: 41508 [2019-12-18 16:04:05,422 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 16:04:05,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41508 states. [2019-12-18 16:04:06,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41508 to 37458. [2019-12-18 16:04:06,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37458 states. [2019-12-18 16:04:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37458 states to 37458 states and 122375 transitions. [2019-12-18 16:04:06,164 INFO L78 Accepts]: Start accepts. Automaton has 37458 states and 122375 transitions. Word has length 16 [2019-12-18 16:04:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:06,166 INFO L462 AbstractCegarLoop]: Abstraction has 37458 states and 122375 transitions. [2019-12-18 16:04:06,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:04:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 37458 states and 122375 transitions. [2019-12-18 16:04:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:04:06,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:06,169 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:04:06,169 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 16:04:06,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:06,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1720071868, now seen corresponding path program 1 times [2019-12-18 16:04:06,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:06,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031489946] [2019-12-18 16:04:06,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:06,223 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 16:04:06,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031489946] [2019-12-18 16:04:06,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:06,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:04:06,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297753666] [2019-12-18 16:04:06,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:04:06,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:06,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:04:06,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:04:06,226 INFO L87 Difference]: Start difference. First operand 37458 states and 122375 transitions. Second operand 3 states. [2019-12-18 16:04:06,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:06,445 INFO L93 Difference]: Finished difference Result 54855 states and 178352 transitions. [2019-12-18 16:04:06,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:04:06,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 16:04:06,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:06,918 INFO L225 Difference]: With dead ends: 54855 [2019-12-18 16:04:06,918 INFO L226 Difference]: Without dead ends: 54855 [2019-12-18 16:04:06,918 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 16:04:07,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54855 states. [2019-12-18 16:04:07,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54855 to 41888. [2019-12-18 16:04:07,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41888 states. [2019-12-18 16:04:07,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41888 states to 41888 states and 137861 transitions. [2019-12-18 16:04:07,681 INFO L78 Accepts]: Start accepts. Automaton has 41888 states and 137861 transitions. Word has length 16 [2019-12-18 16:04:07,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:07,681 INFO L462 AbstractCegarLoop]: Abstraction has 41888 states and 137861 transitions. [2019-12-18 16:04:07,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:04:07,682 INFO L276 IsEmpty]: Start isEmpty. Operand 41888 states and 137861 transitions. [2019-12-18 16:04:07,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:04:07,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:07,685 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:04:07,685 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 16:04:07,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:07,685 INFO L82 PathProgramCache]: Analyzing trace with hash 759335912, now seen corresponding path program 1 times [2019-12-18 16:04:07,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:07,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575755652] [2019-12-18 16:04:07,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:07,775 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 16:04:07,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575755652] [2019-12-18 16:04:07,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:07,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:04:07,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187331030] [2019-12-18 16:04:07,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:04:07,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:07,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:04:07,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:04:07,779 INFO L87 Difference]: Start difference. First operand 41888 states and 137861 transitions. Second operand 4 states. [2019-12-18 16:04:08,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:08,146 INFO L93 Difference]: Finished difference Result 49903 states and 162773 transitions. [2019-12-18 16:04:08,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:04:08,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 16:04:08,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:08,265 INFO L225 Difference]: With dead ends: 49903 [2019-12-18 16:04:08,265 INFO L226 Difference]: Without dead ends: 49903 [2019-12-18 16:04:08,266 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 16:04:08,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49903 states. [2019-12-18 16:04:09,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49903 to 43402. [2019-12-18 16:04:09,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43402 states. [2019-12-18 16:04:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43402 states to 43402 states and 142861 transitions. [2019-12-18 16:04:09,410 INFO L78 Accepts]: Start accepts. Automaton has 43402 states and 142861 transitions. Word has length 16 [2019-12-18 16:04:09,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:09,411 INFO L462 AbstractCegarLoop]: Abstraction has 43402 states and 142861 transitions. [2019-12-18 16:04:09,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:04:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 43402 states and 142861 transitions. [2019-12-18 16:04:09,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:04:09,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:09,420 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 16:04:09,420 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 16:04:09,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:09,421 INFO L82 PathProgramCache]: Analyzing trace with hash -390431288, now seen corresponding path program 1 times [2019-12-18 16:04:09,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:09,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687698444] [2019-12-18 16:04:09,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:09,512 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 16:04:09,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687698444] [2019-12-18 16:04:09,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:09,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:04:09,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146166789] [2019-12-18 16:04:09,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:04:09,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:09,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:04:09,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:04:09,514 INFO L87 Difference]: Start difference. First operand 43402 states and 142861 transitions. Second operand 5 states. [2019-12-18 16:04:10,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:10,234 INFO L93 Difference]: Finished difference Result 59763 states and 191505 transitions. [2019-12-18 16:04:10,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:04:10,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:04:10,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:10,337 INFO L225 Difference]: With dead ends: 59763 [2019-12-18 16:04:10,337 INFO L226 Difference]: Without dead ends: 59749 [2019-12-18 16:04:10,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:04:10,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59749 states. [2019-12-18 16:04:11,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59749 to 44536. [2019-12-18 16:04:11,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44536 states. [2019-12-18 16:04:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44536 states to 44536 states and 146317 transitions. [2019-12-18 16:04:11,575 INFO L78 Accepts]: Start accepts. Automaton has 44536 states and 146317 transitions. Word has length 22 [2019-12-18 16:04:11,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:11,575 INFO L462 AbstractCegarLoop]: Abstraction has 44536 states and 146317 transitions. [2019-12-18 16:04:11,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:04:11,576 INFO L276 IsEmpty]: Start isEmpty. Operand 44536 states and 146317 transitions. [2019-12-18 16:04:11,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:04:11,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:11,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:04:11,583 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 16:04:11,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:11,583 INFO L82 PathProgramCache]: Analyzing trace with hash 2088873634, now seen corresponding path program 1 times [2019-12-18 16:04:11,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:11,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519985842] [2019-12-18 16:04:11,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:11,655 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 16:04:11,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519985842] [2019-12-18 16:04:11,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:11,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:04:11,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769471314] [2019-12-18 16:04:11,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:04:11,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:11,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:04:11,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:04:11,657 INFO L87 Difference]: Start difference. First operand 44536 states and 146317 transitions. Second operand 5 states. [2019-12-18 16:04:12,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:12,270 INFO L93 Difference]: Finished difference Result 62779 states and 200555 transitions. [2019-12-18 16:04:12,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:04:12,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:04:12,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:12,373 INFO L225 Difference]: With dead ends: 62779 [2019-12-18 16:04:12,374 INFO L226 Difference]: Without dead ends: 62765 [2019-12-18 16:04:12,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:04:12,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62765 states. [2019-12-18 16:04:13,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62765 to 43009. [2019-12-18 16:04:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43009 states. [2019-12-18 16:04:13,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43009 states to 43009 states and 141377 transitions. [2019-12-18 16:04:13,801 INFO L78 Accepts]: Start accepts. Automaton has 43009 states and 141377 transitions. Word has length 22 [2019-12-18 16:04:13,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:13,802 INFO L462 AbstractCegarLoop]: Abstraction has 43009 states and 141377 transitions. [2019-12-18 16:04:13,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:04:13,802 INFO L276 IsEmpty]: Start isEmpty. Operand 43009 states and 141377 transitions. [2019-12-18 16:04:13,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 16:04:13,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:13,813 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 16:04:13,813 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 16:04:13,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:13,813 INFO L82 PathProgramCache]: Analyzing trace with hash -697105977, now seen corresponding path program 1 times [2019-12-18 16:04:13,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:13,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737137097] [2019-12-18 16:04:13,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:13,876 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 16:04:13,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737137097] [2019-12-18 16:04:13,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:13,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:04:13,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079949411] [2019-12-18 16:04:13,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:04:13,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:13,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:04:13,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:04:13,879 INFO L87 Difference]: Start difference. First operand 43009 states and 141377 transitions. Second operand 4 states. [2019-12-18 16:04:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:13,961 INFO L93 Difference]: Finished difference Result 17503 states and 54477 transitions. [2019-12-18 16:04:13,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:04:13,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 16:04:13,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:13,988 INFO L225 Difference]: With dead ends: 17503 [2019-12-18 16:04:13,988 INFO L226 Difference]: Without dead ends: 17503 [2019-12-18 16:04:13,989 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 16:04:14,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17503 states. [2019-12-18 16:04:14,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17503 to 17140. [2019-12-18 16:04:14,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-18 16:04:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 53441 transitions. [2019-12-18 16:04:14,249 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 53441 transitions. Word has length 25 [2019-12-18 16:04:14,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:14,250 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 53441 transitions. [2019-12-18 16:04:14,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:04:14,250 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 53441 transitions. [2019-12-18 16:04:14,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 16:04:14,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:14,264 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 16:04:14,264 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 16:04:14,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:14,265 INFO L82 PathProgramCache]: Analyzing trace with hash 967503752, now seen corresponding path program 1 times [2019-12-18 16:04:14,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:14,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471804393] [2019-12-18 16:04:14,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:14,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 16:04:14,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471804393] [2019-12-18 16:04:14,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:14,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:04:14,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786108903] [2019-12-18 16:04:14,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:04:14,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:14,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:04:14,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:04:14,311 INFO L87 Difference]: Start difference. First operand 17140 states and 53441 transitions. Second operand 3 states. [2019-12-18 16:04:14,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:14,439 INFO L93 Difference]: Finished difference Result 22571 states and 66756 transitions. [2019-12-18 16:04:14,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:04:14,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 16:04:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:14,480 INFO L225 Difference]: With dead ends: 22571 [2019-12-18 16:04:14,481 INFO L226 Difference]: Without dead ends: 22571 [2019-12-18 16:04:14,481 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 16:04:14,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22571 states. [2019-12-18 16:04:14,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22571 to 17140. [2019-12-18 16:04:14,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-18 16:04:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 51063 transitions. [2019-12-18 16:04:14,779 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 51063 transitions. Word has length 27 [2019-12-18 16:04:14,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:14,779 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 51063 transitions. [2019-12-18 16:04:14,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:04:14,779 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 51063 transitions. [2019-12-18 16:04:14,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 16:04:14,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:14,791 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 16:04:14,791 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 16:04:14,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:14,791 INFO L82 PathProgramCache]: Analyzing trace with hash 196927527, now seen corresponding path program 1 times [2019-12-18 16:04:14,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:14,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952349108] [2019-12-18 16:04:14,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:14,859 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 16:04:14,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952349108] [2019-12-18 16:04:14,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:14,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:04:14,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028611585] [2019-12-18 16:04:14,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:04:14,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:14,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:04:14,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:04:14,861 INFO L87 Difference]: Start difference. First operand 17140 states and 51063 transitions. Second operand 5 states. [2019-12-18 16:04:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:15,276 INFO L93 Difference]: Finished difference Result 21146 states and 62188 transitions. [2019-12-18 16:04:15,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:04:15,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 16:04:15,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:15,315 INFO L225 Difference]: With dead ends: 21146 [2019-12-18 16:04:15,315 INFO L226 Difference]: Without dead ends: 21146 [2019-12-18 16:04:15,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:04:15,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21146 states. [2019-12-18 16:04:15,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21146 to 19815. [2019-12-18 16:04:15,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19815 states. [2019-12-18 16:04:15,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19815 states to 19815 states and 58833 transitions. [2019-12-18 16:04:15,624 INFO L78 Accepts]: Start accepts. Automaton has 19815 states and 58833 transitions. Word has length 27 [2019-12-18 16:04:15,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:15,624 INFO L462 AbstractCegarLoop]: Abstraction has 19815 states and 58833 transitions. [2019-12-18 16:04:15,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:04:15,624 INFO L276 IsEmpty]: Start isEmpty. Operand 19815 states and 58833 transitions. [2019-12-18 16:04:15,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 16:04:15,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:15,639 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 16:04:15,640 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 16:04:15,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:15,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1188103809, now seen corresponding path program 1 times [2019-12-18 16:04:15,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:15,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618002031] [2019-12-18 16:04:15,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:15,705 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 16:04:15,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618002031] [2019-12-18 16:04:15,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:15,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:04:15,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656427581] [2019-12-18 16:04:15,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:04:15,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:15,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:04:15,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:04:15,707 INFO L87 Difference]: Start difference. First operand 19815 states and 58833 transitions. Second operand 5 states. [2019-12-18 16:04:16,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:16,043 INFO L93 Difference]: Finished difference Result 23192 states and 68046 transitions. [2019-12-18 16:04:16,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:04:16,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 16:04:16,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:16,083 INFO L225 Difference]: With dead ends: 23192 [2019-12-18 16:04:16,084 INFO L226 Difference]: Without dead ends: 23192 [2019-12-18 16:04:16,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:04:16,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23192 states. [2019-12-18 16:04:16,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23192 to 19826. [2019-12-18 16:04:16,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19826 states. [2019-12-18 16:04:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19826 states to 19826 states and 58720 transitions. [2019-12-18 16:04:16,935 INFO L78 Accepts]: Start accepts. Automaton has 19826 states and 58720 transitions. Word has length 28 [2019-12-18 16:04:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:16,936 INFO L462 AbstractCegarLoop]: Abstraction has 19826 states and 58720 transitions. [2019-12-18 16:04:16,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:04:16,936 INFO L276 IsEmpty]: Start isEmpty. Operand 19826 states and 58720 transitions. [2019-12-18 16:04:16,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 16:04:16,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:16,968 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 16:04:16,968 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 16:04:16,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:16,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1042720045, now seen corresponding path program 1 times [2019-12-18 16:04:16,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:16,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116033912] [2019-12-18 16:04:16,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:17,063 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 16:04:17,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116033912] [2019-12-18 16:04:17,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:17,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:04:17,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506955510] [2019-12-18 16:04:17,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:04:17,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:17,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:04:17,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:04:17,065 INFO L87 Difference]: Start difference. First operand 19826 states and 58720 transitions. Second operand 6 states. [2019-12-18 16:04:17,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:17,775 INFO L93 Difference]: Finished difference Result 26785 states and 78213 transitions. [2019-12-18 16:04:17,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:04:17,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 16:04:17,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:17,813 INFO L225 Difference]: With dead ends: 26785 [2019-12-18 16:04:17,813 INFO L226 Difference]: Without dead ends: 26785 [2019-12-18 16:04:17,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:04:17,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26785 states. [2019-12-18 16:04:18,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26785 to 20969. [2019-12-18 16:04:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20969 states. [2019-12-18 16:04:18,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20969 states to 20969 states and 62212 transitions. [2019-12-18 16:04:18,189 INFO L78 Accepts]: Start accepts. Automaton has 20969 states and 62212 transitions. Word has length 33 [2019-12-18 16:04:18,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:18,189 INFO L462 AbstractCegarLoop]: Abstraction has 20969 states and 62212 transitions. [2019-12-18 16:04:18,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:04:18,189 INFO L276 IsEmpty]: Start isEmpty. Operand 20969 states and 62212 transitions. [2019-12-18 16:04:18,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 16:04:18,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:18,212 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 16:04:18,212 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 16:04:18,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:18,212 INFO L82 PathProgramCache]: Analyzing trace with hash -738339527, now seen corresponding path program 1 times [2019-12-18 16:04:18,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:18,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956768970] [2019-12-18 16:04:18,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:18,298 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 16:04:18,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956768970] [2019-12-18 16:04:18,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:18,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:04:18,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230337478] [2019-12-18 16:04:18,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:04:18,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:18,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:04:18,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:04:18,300 INFO L87 Difference]: Start difference. First operand 20969 states and 62212 transitions. Second operand 6 states. [2019-12-18 16:04:18,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:18,973 INFO L93 Difference]: Finished difference Result 25915 states and 75815 transitions. [2019-12-18 16:04:18,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:04:18,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 16:04:18,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:19,012 INFO L225 Difference]: With dead ends: 25915 [2019-12-18 16:04:19,012 INFO L226 Difference]: Without dead ends: 25915 [2019-12-18 16:04:19,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:04:19,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25915 states. [2019-12-18 16:04:19,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25915 to 17954. [2019-12-18 16:04:19,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17954 states. [2019-12-18 16:04:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17954 states to 17954 states and 53419 transitions. [2019-12-18 16:04:19,323 INFO L78 Accepts]: Start accepts. Automaton has 17954 states and 53419 transitions. Word has length 34 [2019-12-18 16:04:19,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:19,324 INFO L462 AbstractCegarLoop]: Abstraction has 17954 states and 53419 transitions. [2019-12-18 16:04:19,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:04:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 17954 states and 53419 transitions. [2019-12-18 16:04:19,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 16:04:19,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:19,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:04:19,342 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 16:04:19,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:19,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1814402429, now seen corresponding path program 1 times [2019-12-18 16:04:19,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:19,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225795735] [2019-12-18 16:04:19,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:19,405 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 16:04:19,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225795735] [2019-12-18 16:04:19,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:19,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:04:19,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342480059] [2019-12-18 16:04:19,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:04:19,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:19,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:04:19,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:04:19,407 INFO L87 Difference]: Start difference. First operand 17954 states and 53419 transitions. Second operand 3 states. [2019-12-18 16:04:19,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:19,476 INFO L93 Difference]: Finished difference Result 17953 states and 53417 transitions. [2019-12-18 16:04:19,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:04:19,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 16:04:19,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:19,509 INFO L225 Difference]: With dead ends: 17953 [2019-12-18 16:04:19,509 INFO L226 Difference]: Without dead ends: 17953 [2019-12-18 16:04:19,509 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 16:04:19,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17953 states. [2019-12-18 16:04:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17953 to 17953. [2019-12-18 16:04:19,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17953 states. [2019-12-18 16:04:19,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17953 states to 17953 states and 53417 transitions. [2019-12-18 16:04:19,939 INFO L78 Accepts]: Start accepts. Automaton has 17953 states and 53417 transitions. Word has length 39 [2019-12-18 16:04:19,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:19,940 INFO L462 AbstractCegarLoop]: Abstraction has 17953 states and 53417 transitions. [2019-12-18 16:04:19,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:04:19,940 INFO L276 IsEmpty]: Start isEmpty. Operand 17953 states and 53417 transitions. [2019-12-18 16:04:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:04:19,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:19,957 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 16:04:19,957 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 16:04:19,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:19,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1557699484, now seen corresponding path program 1 times [2019-12-18 16:04:19,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:19,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380138287] [2019-12-18 16:04:19,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:20,021 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 16:04:20,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380138287] [2019-12-18 16:04:20,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:20,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:04:20,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402465952] [2019-12-18 16:04:20,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:04:20,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:20,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:04:20,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:04:20,023 INFO L87 Difference]: Start difference. First operand 17953 states and 53417 transitions. Second operand 5 states. [2019-12-18 16:04:20,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:20,107 INFO L93 Difference]: Finished difference Result 16745 states and 50707 transitions. [2019-12-18 16:04:20,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:04:20,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 16:04:20,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:20,136 INFO L225 Difference]: With dead ends: 16745 [2019-12-18 16:04:20,137 INFO L226 Difference]: Without dead ends: 16745 [2019-12-18 16:04:20,137 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 16:04:20,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16745 states. [2019-12-18 16:04:20,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16745 to 16164. [2019-12-18 16:04:20,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16164 states. [2019-12-18 16:04:20,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16164 states to 16164 states and 49138 transitions. [2019-12-18 16:04:20,507 INFO L78 Accepts]: Start accepts. Automaton has 16164 states and 49138 transitions. Word has length 40 [2019-12-18 16:04:20,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:20,508 INFO L462 AbstractCegarLoop]: Abstraction has 16164 states and 49138 transitions. [2019-12-18 16:04:20,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:04:20,508 INFO L276 IsEmpty]: Start isEmpty. Operand 16164 states and 49138 transitions. [2019-12-18 16:04:20,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:04:20,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:20,528 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 16:04:20,528 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 16:04:20,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:20,529 INFO L82 PathProgramCache]: Analyzing trace with hash -707354115, now seen corresponding path program 1 times [2019-12-18 16:04:20,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:20,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755455913] [2019-12-18 16:04:20,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:20,615 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 16:04:20,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755455913] [2019-12-18 16:04:20,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:20,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:04:20,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886850834] [2019-12-18 16:04:20,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:04:20,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:20,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:04:20,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:04:20,617 INFO L87 Difference]: Start difference. First operand 16164 states and 49138 transitions. Second operand 7 states. [2019-12-18 16:04:21,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:21,098 INFO L93 Difference]: Finished difference Result 47597 states and 143647 transitions. [2019-12-18 16:04:21,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:04:21,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 16:04:21,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:21,147 INFO L225 Difference]: With dead ends: 47597 [2019-12-18 16:04:21,147 INFO L226 Difference]: Without dead ends: 36910 [2019-12-18 16:04:21,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:04:21,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36910 states. [2019-12-18 16:04:21,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36910 to 19812. [2019-12-18 16:04:21,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19812 states. [2019-12-18 16:04:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19812 states to 19812 states and 60413 transitions. [2019-12-18 16:04:21,588 INFO L78 Accepts]: Start accepts. Automaton has 19812 states and 60413 transitions. Word has length 64 [2019-12-18 16:04:21,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:21,589 INFO L462 AbstractCegarLoop]: Abstraction has 19812 states and 60413 transitions. [2019-12-18 16:04:21,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:04:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 19812 states and 60413 transitions. [2019-12-18 16:04:21,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:04:21,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:21,616 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 16:04:21,616 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 16:04:21,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:21,616 INFO L82 PathProgramCache]: Analyzing trace with hash -919693373, now seen corresponding path program 2 times [2019-12-18 16:04:21,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:21,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27278634] [2019-12-18 16:04:21,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:21,703 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 16:04:21,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27278634] [2019-12-18 16:04:21,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:21,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:04:21,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743744314] [2019-12-18 16:04:21,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:04:21,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:21,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:04:21,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:04:21,710 INFO L87 Difference]: Start difference. First operand 19812 states and 60413 transitions. Second operand 7 states. [2019-12-18 16:04:22,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:22,192 INFO L93 Difference]: Finished difference Result 54647 states and 162905 transitions. [2019-12-18 16:04:22,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:04:22,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 16:04:22,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:22,248 INFO L225 Difference]: With dead ends: 54647 [2019-12-18 16:04:22,248 INFO L226 Difference]: Without dead ends: 39740 [2019-12-18 16:04:22,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:04:22,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39740 states. [2019-12-18 16:04:22,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39740 to 23243. [2019-12-18 16:04:22,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23243 states. [2019-12-18 16:04:22,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23243 states to 23243 states and 70535 transitions. [2019-12-18 16:04:22,982 INFO L78 Accepts]: Start accepts. Automaton has 23243 states and 70535 transitions. Word has length 64 [2019-12-18 16:04:22,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:22,983 INFO L462 AbstractCegarLoop]: Abstraction has 23243 states and 70535 transitions. [2019-12-18 16:04:22,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:04:22,983 INFO L276 IsEmpty]: Start isEmpty. Operand 23243 states and 70535 transitions. [2019-12-18 16:04:23,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:04:23,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:23,010 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 16:04:23,011 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 16:04:23,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:23,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1837972597, now seen corresponding path program 3 times [2019-12-18 16:04:23,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:23,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752874597] [2019-12-18 16:04:23,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:23,098 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 16:04:23,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752874597] [2019-12-18 16:04:23,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:23,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:04:23,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137481139] [2019-12-18 16:04:23,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:04:23,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:23,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:04:23,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:04:23,101 INFO L87 Difference]: Start difference. First operand 23243 states and 70535 transitions. Second operand 7 states. [2019-12-18 16:04:23,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:23,721 INFO L93 Difference]: Finished difference Result 45600 states and 136196 transitions. [2019-12-18 16:04:23,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 16:04:23,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 16:04:23,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:23,801 INFO L225 Difference]: With dead ends: 45600 [2019-12-18 16:04:23,801 INFO L226 Difference]: Without dead ends: 42889 [2019-12-18 16:04:23,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:04:23,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42889 states. [2019-12-18 16:04:24,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42889 to 23339. [2019-12-18 16:04:24,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23339 states. [2019-12-18 16:04:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23339 states to 23339 states and 70879 transitions. [2019-12-18 16:04:24,319 INFO L78 Accepts]: Start accepts. Automaton has 23339 states and 70879 transitions. Word has length 64 [2019-12-18 16:04:24,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:24,320 INFO L462 AbstractCegarLoop]: Abstraction has 23339 states and 70879 transitions. [2019-12-18 16:04:24,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:04:24,320 INFO L276 IsEmpty]: Start isEmpty. Operand 23339 states and 70879 transitions. [2019-12-18 16:04:24,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:04:24,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:24,343 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 16:04:24,344 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 16:04:24,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:24,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1711686189, now seen corresponding path program 4 times [2019-12-18 16:04:24,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:24,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048615397] [2019-12-18 16:04:24,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:24,404 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 16:04:24,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048615397] [2019-12-18 16:04:24,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:24,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:04:24,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740456278] [2019-12-18 16:04:24,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:04:24,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:24,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:04:24,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:04:24,406 INFO L87 Difference]: Start difference. First operand 23339 states and 70879 transitions. Second operand 3 states. [2019-12-18 16:04:24,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:24,559 INFO L93 Difference]: Finished difference Result 27355 states and 83042 transitions. [2019-12-18 16:04:24,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:04:24,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 16:04:24,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:24,600 INFO L225 Difference]: With dead ends: 27355 [2019-12-18 16:04:24,600 INFO L226 Difference]: Without dead ends: 27355 [2019-12-18 16:04:24,600 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 16:04:24,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27355 states. [2019-12-18 16:04:24,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27355 to 24236. [2019-12-18 16:04:24,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24236 states. [2019-12-18 16:04:24,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24236 states to 24236 states and 73842 transitions. [2019-12-18 16:04:24,987 INFO L78 Accepts]: Start accepts. Automaton has 24236 states and 73842 transitions. Word has length 64 [2019-12-18 16:04:24,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:24,988 INFO L462 AbstractCegarLoop]: Abstraction has 24236 states and 73842 transitions. [2019-12-18 16:04:24,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:04:24,988 INFO L276 IsEmpty]: Start isEmpty. Operand 24236 states and 73842 transitions. [2019-12-18 16:04:25,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:04:25,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:25,289 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 16:04:25,289 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 16:04:25,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:25,289 INFO L82 PathProgramCache]: Analyzing trace with hash 904135165, now seen corresponding path program 1 times [2019-12-18 16:04:25,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:25,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479146899] [2019-12-18 16:04:25,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:04:25,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479146899] [2019-12-18 16:04:25,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:25,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:04:25,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709875266] [2019-12-18 16:04:25,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:04:25,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:25,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:04:25,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:04:25,385 INFO L87 Difference]: Start difference. First operand 24236 states and 73842 transitions. Second operand 7 states. [2019-12-18 16:04:26,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:26,004 INFO L93 Difference]: Finished difference Result 50352 states and 152486 transitions. [2019-12-18 16:04:26,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 16:04:26,004 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 16:04:26,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:26,094 INFO L225 Difference]: With dead ends: 50352 [2019-12-18 16:04:26,094 INFO L226 Difference]: Without dead ends: 47107 [2019-12-18 16:04:26,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:04:26,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47107 states. [2019-12-18 16:04:26,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47107 to 24368. [2019-12-18 16:04:26,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24368 states. [2019-12-18 16:04:26,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24368 states to 24368 states and 74354 transitions. [2019-12-18 16:04:26,709 INFO L78 Accepts]: Start accepts. Automaton has 24368 states and 74354 transitions. Word has length 65 [2019-12-18 16:04:26,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:26,710 INFO L462 AbstractCegarLoop]: Abstraction has 24368 states and 74354 transitions. [2019-12-18 16:04:26,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:04:26,710 INFO L276 IsEmpty]: Start isEmpty. Operand 24368 states and 74354 transitions. [2019-12-18 16:04:26,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:04:26,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:26,747 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 16:04:26,747 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 16:04:26,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:26,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1662440961, now seen corresponding path program 2 times [2019-12-18 16:04:26,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:26,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975223061] [2019-12-18 16:04:26,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:26,818 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 16:04:26,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975223061] [2019-12-18 16:04:26,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:26,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:04:26,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934775116] [2019-12-18 16:04:26,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:04:26,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:26,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:04:26,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:04:26,820 INFO L87 Difference]: Start difference. First operand 24368 states and 74354 transitions. Second operand 4 states. [2019-12-18 16:04:26,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:26,972 INFO L93 Difference]: Finished difference Result 24095 states and 73373 transitions. [2019-12-18 16:04:26,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:04:26,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 16:04:26,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:27,004 INFO L225 Difference]: With dead ends: 24095 [2019-12-18 16:04:27,004 INFO L226 Difference]: Without dead ends: 24095 [2019-12-18 16:04:27,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 16:04:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24095 states. [2019-12-18 16:04:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24095 to 23198. [2019-12-18 16:04:27,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23198 states. [2019-12-18 16:04:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23198 states to 23198 states and 70410 transitions. [2019-12-18 16:04:27,374 INFO L78 Accepts]: Start accepts. Automaton has 23198 states and 70410 transitions. Word has length 65 [2019-12-18 16:04:27,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:27,375 INFO L462 AbstractCegarLoop]: Abstraction has 23198 states and 70410 transitions. [2019-12-18 16:04:27,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:04:27,375 INFO L276 IsEmpty]: Start isEmpty. Operand 23198 states and 70410 transitions. [2019-12-18 16:04:27,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:04:27,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:27,399 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 16:04:27,399 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 16:04:27,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:27,400 INFO L82 PathProgramCache]: Analyzing trace with hash 651721355, now seen corresponding path program 1 times [2019-12-18 16:04:27,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:27,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6790406] [2019-12-18 16:04:27,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:27,694 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 16:04:27,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6790406] [2019-12-18 16:04:27,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:27,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 16:04:27,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374898261] [2019-12-18 16:04:27,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 16:04:27,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:27,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 16:04:27,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:04:27,696 INFO L87 Difference]: Start difference. First operand 23198 states and 70410 transitions. Second operand 13 states. [2019-12-18 16:04:30,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:30,768 INFO L93 Difference]: Finished difference Result 47424 states and 141844 transitions. [2019-12-18 16:04:30,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 16:04:30,769 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-18 16:04:30,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:30,831 INFO L225 Difference]: With dead ends: 47424 [2019-12-18 16:04:30,831 INFO L226 Difference]: Without dead ends: 47116 [2019-12-18 16:04:30,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=1085, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 16:04:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47116 states. [2019-12-18 16:04:31,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47116 to 30869. [2019-12-18 16:04:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30869 states. [2019-12-18 16:04:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30869 states to 30869 states and 92900 transitions. [2019-12-18 16:04:31,444 INFO L78 Accepts]: Start accepts. Automaton has 30869 states and 92900 transitions. Word has length 65 [2019-12-18 16:04:31,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:31,444 INFO L462 AbstractCegarLoop]: Abstraction has 30869 states and 92900 transitions. [2019-12-18 16:04:31,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 16:04:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 30869 states and 92900 transitions. [2019-12-18 16:04:31,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:04:31,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:31,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:04:31,479 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 16:04:31,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:31,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1809660109, now seen corresponding path program 2 times [2019-12-18 16:04:31,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:31,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858416178] [2019-12-18 16:04:31,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:31,590 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 16:04:31,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858416178] [2019-12-18 16:04:31,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:31,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:04:31,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040104116] [2019-12-18 16:04:31,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:04:31,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:31,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:04:31,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:04:31,592 INFO L87 Difference]: Start difference. First operand 30869 states and 92900 transitions. Second operand 7 states. [2019-12-18 16:04:32,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:32,709 INFO L93 Difference]: Finished difference Result 48739 states and 146446 transitions. [2019-12-18 16:04:32,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 16:04:32,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 16:04:32,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:32,777 INFO L225 Difference]: With dead ends: 48739 [2019-12-18 16:04:32,777 INFO L226 Difference]: Without dead ends: 48739 [2019-12-18 16:04:32,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:04:32,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48739 states. [2019-12-18 16:04:33,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48739 to 33585. [2019-12-18 16:04:33,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33585 states. [2019-12-18 16:04:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33585 states to 33585 states and 100558 transitions. [2019-12-18 16:04:33,820 INFO L78 Accepts]: Start accepts. Automaton has 33585 states and 100558 transitions. Word has length 65 [2019-12-18 16:04:33,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:33,821 INFO L462 AbstractCegarLoop]: Abstraction has 33585 states and 100558 transitions. [2019-12-18 16:04:33,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:04:33,821 INFO L276 IsEmpty]: Start isEmpty. Operand 33585 states and 100558 transitions. [2019-12-18 16:04:33,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:04:33,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:33,855 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 16:04:33,855 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 16:04:33,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:33,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1821543445, now seen corresponding path program 3 times [2019-12-18 16:04:33,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:33,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868879124] [2019-12-18 16:04:33,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:33,962 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 16:04:33,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868879124] [2019-12-18 16:04:33,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:33,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:04:33,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116326344] [2019-12-18 16:04:33,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:04:33,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:33,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:04:33,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:04:33,964 INFO L87 Difference]: Start difference. First operand 33585 states and 100558 transitions. Second operand 8 states. [2019-12-18 16:04:35,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:35,712 INFO L93 Difference]: Finished difference Result 47518 states and 142693 transitions. [2019-12-18 16:04:35,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 16:04:35,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 16:04:35,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:35,779 INFO L225 Difference]: With dead ends: 47518 [2019-12-18 16:04:35,780 INFO L226 Difference]: Without dead ends: 47518 [2019-12-18 16:04:35,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2019-12-18 16:04:35,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47518 states. [2019-12-18 16:04:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47518 to 32426. [2019-12-18 16:04:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32426 states. [2019-12-18 16:04:36,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32426 states to 32426 states and 97219 transitions. [2019-12-18 16:04:36,382 INFO L78 Accepts]: Start accepts. Automaton has 32426 states and 97219 transitions. Word has length 65 [2019-12-18 16:04:36,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:36,382 INFO L462 AbstractCegarLoop]: Abstraction has 32426 states and 97219 transitions. [2019-12-18 16:04:36,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:04:36,382 INFO L276 IsEmpty]: Start isEmpty. Operand 32426 states and 97219 transitions. [2019-12-18 16:04:36,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:04:36,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:36,415 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 16:04:36,415 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 16:04:36,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:36,416 INFO L82 PathProgramCache]: Analyzing trace with hash -418578259, now seen corresponding path program 4 times [2019-12-18 16:04:36,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:36,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312595651] [2019-12-18 16:04:36,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:36,586 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 16:04:36,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312595651] [2019-12-18 16:04:36,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:36,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 16:04:36,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807023616] [2019-12-18 16:04:36,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:04:36,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:36,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:04:36,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:04:36,590 INFO L87 Difference]: Start difference. First operand 32426 states and 97219 transitions. Second operand 11 states. [2019-12-18 16:04:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:39,254 INFO L93 Difference]: Finished difference Result 47025 states and 141144 transitions. [2019-12-18 16:04:39,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 16:04:39,254 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 16:04:39,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:39,321 INFO L225 Difference]: With dead ends: 47025 [2019-12-18 16:04:39,321 INFO L226 Difference]: Without dead ends: 47025 [2019-12-18 16:04:39,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=993, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 16:04:39,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47025 states. [2019-12-18 16:04:40,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47025 to 29540. [2019-12-18 16:04:40,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29540 states. [2019-12-18 16:04:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29540 states to 29540 states and 88716 transitions. [2019-12-18 16:04:40,185 INFO L78 Accepts]: Start accepts. Automaton has 29540 states and 88716 transitions. Word has length 65 [2019-12-18 16:04:40,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:40,186 INFO L462 AbstractCegarLoop]: Abstraction has 29540 states and 88716 transitions. [2019-12-18 16:04:40,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:04:40,186 INFO L276 IsEmpty]: Start isEmpty. Operand 29540 states and 88716 transitions. [2019-12-18 16:04:40,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:04:40,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:40,220 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 16:04:40,220 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 16:04:40,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:40,221 INFO L82 PathProgramCache]: Analyzing trace with hash -362903197, now seen corresponding path program 5 times [2019-12-18 16:04:40,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:40,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128737395] [2019-12-18 16:04:40,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:40,346 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 16:04:40,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128737395] [2019-12-18 16:04:40,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:40,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:04:40,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525428110] [2019-12-18 16:04:40,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:04:40,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:40,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:04:40,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:04:40,349 INFO L87 Difference]: Start difference. First operand 29540 states and 88716 transitions. Second operand 8 states. [2019-12-18 16:04:41,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:41,689 INFO L93 Difference]: Finished difference Result 43162 states and 127132 transitions. [2019-12-18 16:04:41,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 16:04:41,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 16:04:41,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:41,748 INFO L225 Difference]: With dead ends: 43162 [2019-12-18 16:04:41,748 INFO L226 Difference]: Without dead ends: 42918 [2019-12-18 16:04:41,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-18 16:04:41,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42918 states. [2019-12-18 16:04:42,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42918 to 34111. [2019-12-18 16:04:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34111 states. [2019-12-18 16:04:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34111 states to 34111 states and 101893 transitions. [2019-12-18 16:04:42,330 INFO L78 Accepts]: Start accepts. Automaton has 34111 states and 101893 transitions. Word has length 65 [2019-12-18 16:04:42,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:42,331 INFO L462 AbstractCegarLoop]: Abstraction has 34111 states and 101893 transitions. [2019-12-18 16:04:42,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:04:42,331 INFO L276 IsEmpty]: Start isEmpty. Operand 34111 states and 101893 transitions. [2019-12-18 16:04:42,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:04:42,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:42,366 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 16:04:42,366 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 16:04:42,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:42,366 INFO L82 PathProgramCache]: Analyzing trace with hash 727172643, now seen corresponding path program 6 times [2019-12-18 16:04:42,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:42,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606577967] [2019-12-18 16:04:42,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:42,427 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 16:04:42,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606577967] [2019-12-18 16:04:42,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:42,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:04:42,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767138051] [2019-12-18 16:04:42,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:04:42,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:42,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:04:42,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:04:42,429 INFO L87 Difference]: Start difference. First operand 34111 states and 101893 transitions. Second operand 3 states. [2019-12-18 16:04:42,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:42,586 INFO L93 Difference]: Finished difference Result 34111 states and 101892 transitions. [2019-12-18 16:04:42,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:04:42,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 16:04:42,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:42,662 INFO L225 Difference]: With dead ends: 34111 [2019-12-18 16:04:42,662 INFO L226 Difference]: Without dead ends: 34111 [2019-12-18 16:04:42,663 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 16:04:42,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34111 states. [2019-12-18 16:04:43,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34111 to 25242. [2019-12-18 16:04:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25242 states. [2019-12-18 16:04:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25242 states to 25242 states and 77343 transitions. [2019-12-18 16:04:43,809 INFO L78 Accepts]: Start accepts. Automaton has 25242 states and 77343 transitions. Word has length 65 [2019-12-18 16:04:43,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:43,809 INFO L462 AbstractCegarLoop]: Abstraction has 25242 states and 77343 transitions. [2019-12-18 16:04:43,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:04:43,809 INFO L276 IsEmpty]: Start isEmpty. Operand 25242 states and 77343 transitions. [2019-12-18 16:04:43,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:04:43,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:43,852 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 16:04:43,853 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 16:04:43,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:43,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1162997979, now seen corresponding path program 1 times [2019-12-18 16:04:43,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:43,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273799802] [2019-12-18 16:04:43,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:43,914 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 16:04:43,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273799802] [2019-12-18 16:04:43,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:43,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:04:43,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680380275] [2019-12-18 16:04:43,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:04:43,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:43,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:04:43,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:04:43,916 INFO L87 Difference]: Start difference. First operand 25242 states and 77343 transitions. Second operand 3 states. [2019-12-18 16:04:44,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:44,002 INFO L93 Difference]: Finished difference Result 20152 states and 60644 transitions. [2019-12-18 16:04:44,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:04:44,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 16:04:44,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:44,029 INFO L225 Difference]: With dead ends: 20152 [2019-12-18 16:04:44,029 INFO L226 Difference]: Without dead ends: 20152 [2019-12-18 16:04:44,029 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 16:04:44,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20152 states. [2019-12-18 16:04:44,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20152 to 17822. [2019-12-18 16:04:44,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17822 states. [2019-12-18 16:04:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17822 states to 17822 states and 53598 transitions. [2019-12-18 16:04:44,309 INFO L78 Accepts]: Start accepts. Automaton has 17822 states and 53598 transitions. Word has length 66 [2019-12-18 16:04:44,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:44,310 INFO L462 AbstractCegarLoop]: Abstraction has 17822 states and 53598 transitions. [2019-12-18 16:04:44,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:04:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand 17822 states and 53598 transitions. [2019-12-18 16:04:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:04:44,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:44,329 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 16:04:44,329 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 16:04:44,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:44,329 INFO L82 PathProgramCache]: Analyzing trace with hash -543525966, now seen corresponding path program 1 times [2019-12-18 16:04:44,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:44,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895860431] [2019-12-18 16:04:44,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:44,486 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 16:04:44,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895860431] [2019-12-18 16:04:44,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:44,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:04:44,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883442556] [2019-12-18 16:04:44,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 16:04:44,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:44,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 16:04:44,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:04:44,490 INFO L87 Difference]: Start difference. First operand 17822 states and 53598 transitions. Second operand 10 states. [2019-12-18 16:04:45,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:45,729 INFO L93 Difference]: Finished difference Result 26444 states and 79089 transitions. [2019-12-18 16:04:45,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 16:04:45,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 16:04:45,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:45,759 INFO L225 Difference]: With dead ends: 26444 [2019-12-18 16:04:45,759 INFO L226 Difference]: Without dead ends: 21962 [2019-12-18 16:04:45,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-18 16:04:45,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21962 states. [2019-12-18 16:04:46,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21962 to 18252. [2019-12-18 16:04:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18252 states. [2019-12-18 16:04:46,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18252 states to 18252 states and 54752 transitions. [2019-12-18 16:04:46,052 INFO L78 Accepts]: Start accepts. Automaton has 18252 states and 54752 transitions. Word has length 67 [2019-12-18 16:04:46,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:46,052 INFO L462 AbstractCegarLoop]: Abstraction has 18252 states and 54752 transitions. [2019-12-18 16:04:46,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 16:04:46,052 INFO L276 IsEmpty]: Start isEmpty. Operand 18252 states and 54752 transitions. [2019-12-18 16:04:46,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:04:46,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:46,072 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 16:04:46,072 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 16:04:46,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:46,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1737332378, now seen corresponding path program 2 times [2019-12-18 16:04:46,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:46,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459637986] [2019-12-18 16:04:46,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:04:46,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459637986] [2019-12-18 16:04:46,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:46,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:04:46,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552170877] [2019-12-18 16:04:46,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:04:46,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:46,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:04:46,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:04:46,248 INFO L87 Difference]: Start difference. First operand 18252 states and 54752 transitions. Second operand 11 states. [2019-12-18 16:04:47,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:47,612 INFO L93 Difference]: Finished difference Result 24716 states and 73512 transitions. [2019-12-18 16:04:47,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 16:04:47,613 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 16:04:47,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:47,644 INFO L225 Difference]: With dead ends: 24716 [2019-12-18 16:04:47,644 INFO L226 Difference]: Without dead ends: 21548 [2019-12-18 16:04:47,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-18 16:04:47,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21548 states. [2019-12-18 16:04:47,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21548 to 18142. [2019-12-18 16:04:47,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18142 states. [2019-12-18 16:04:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18142 states to 18142 states and 54430 transitions. [2019-12-18 16:04:47,959 INFO L78 Accepts]: Start accepts. Automaton has 18142 states and 54430 transitions. Word has length 67 [2019-12-18 16:04:47,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:47,959 INFO L462 AbstractCegarLoop]: Abstraction has 18142 states and 54430 transitions. [2019-12-18 16:04:47,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:04:47,960 INFO L276 IsEmpty]: Start isEmpty. Operand 18142 states and 54430 transitions. [2019-12-18 16:04:47,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:04:47,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:47,981 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 16:04:47,981 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:04:47,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:47,981 INFO L82 PathProgramCache]: Analyzing trace with hash 202288426, now seen corresponding path program 3 times [2019-12-18 16:04:47,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:47,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541979295] [2019-12-18 16:04:47,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:48,191 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 16:04:48,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541979295] [2019-12-18 16:04:48,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:48,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:04:48,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627208836] [2019-12-18 16:04:48,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 16:04:48,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:48,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 16:04:48,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:04:48,193 INFO L87 Difference]: Start difference. First operand 18142 states and 54430 transitions. Second operand 10 states. [2019-12-18 16:04:49,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:49,499 INFO L93 Difference]: Finished difference Result 26783 states and 79350 transitions. [2019-12-18 16:04:49,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 16:04:49,499 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 16:04:49,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:49,537 INFO L225 Difference]: With dead ends: 26783 [2019-12-18 16:04:49,538 INFO L226 Difference]: Without dead ends: 23216 [2019-12-18 16:04:49,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:04:49,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23216 states. [2019-12-18 16:04:49,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23216 to 18588. [2019-12-18 16:04:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18588 states. [2019-12-18 16:04:50,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18588 states to 18588 states and 55516 transitions. [2019-12-18 16:04:50,022 INFO L78 Accepts]: Start accepts. Automaton has 18588 states and 55516 transitions. Word has length 67 [2019-12-18 16:04:50,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:50,023 INFO L462 AbstractCegarLoop]: Abstraction has 18588 states and 55516 transitions. [2019-12-18 16:04:50,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 16:04:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 18588 states and 55516 transitions. [2019-12-18 16:04:50,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:04:50,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:50,041 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:04:50,042 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:04:50,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:50,042 INFO L82 PathProgramCache]: Analyzing trace with hash -917850962, now seen corresponding path program 4 times [2019-12-18 16:04:50,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:50,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309801114] [2019-12-18 16:04:50,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:50,184 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 16:04:50,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309801114] [2019-12-18 16:04:50,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:50,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:04:50,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812154249] [2019-12-18 16:04:50,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:04:50,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:50,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:04:50,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:04:50,186 INFO L87 Difference]: Start difference. First operand 18588 states and 55516 transitions. Second operand 11 states. [2019-12-18 16:04:51,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:51,725 INFO L93 Difference]: Finished difference Result 25727 states and 76124 transitions. [2019-12-18 16:04:51,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 16:04:51,725 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 16:04:51,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:51,763 INFO L225 Difference]: With dead ends: 25727 [2019-12-18 16:04:51,763 INFO L226 Difference]: Without dead ends: 22791 [2019-12-18 16:04:51,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-18 16:04:51,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22791 states. [2019-12-18 16:04:52,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22791 to 18248. [2019-12-18 16:04:52,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18248 states. [2019-12-18 16:04:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18248 states to 18248 states and 54521 transitions. [2019-12-18 16:04:52,076 INFO L78 Accepts]: Start accepts. Automaton has 18248 states and 54521 transitions. Word has length 67 [2019-12-18 16:04:52,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:52,077 INFO L462 AbstractCegarLoop]: Abstraction has 18248 states and 54521 transitions. [2019-12-18 16:04:52,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:04:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 18248 states and 54521 transitions. [2019-12-18 16:04:52,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:04:52,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:52,096 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 16:04:52,096 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:04:52,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:52,096 INFO L82 PathProgramCache]: Analyzing trace with hash 668274002, now seen corresponding path program 5 times [2019-12-18 16:04:52,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:52,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691960461] [2019-12-18 16:04:52,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:52,254 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 16:04:52,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691960461] [2019-12-18 16:04:52,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:52,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:04:52,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882839799] [2019-12-18 16:04:52,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:04:52,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:52,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:04:52,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:04:52,256 INFO L87 Difference]: Start difference. First operand 18248 states and 54521 transitions. Second operand 11 states. [2019-12-18 16:04:53,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:53,470 INFO L93 Difference]: Finished difference Result 37124 states and 109768 transitions. [2019-12-18 16:04:53,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 16:04:53,470 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 16:04:53,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:53,510 INFO L225 Difference]: With dead ends: 37124 [2019-12-18 16:04:53,510 INFO L226 Difference]: Without dead ends: 29536 [2019-12-18 16:04:53,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 16:04:53,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29536 states. [2019-12-18 16:04:53,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29536 to 17296. [2019-12-18 16:04:53,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17296 states. [2019-12-18 16:04:53,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17296 states to 17296 states and 51604 transitions. [2019-12-18 16:04:53,856 INFO L78 Accepts]: Start accepts. Automaton has 17296 states and 51604 transitions. Word has length 67 [2019-12-18 16:04:53,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:53,856 INFO L462 AbstractCegarLoop]: Abstraction has 17296 states and 51604 transitions. [2019-12-18 16:04:53,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:04:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 17296 states and 51604 transitions. [2019-12-18 16:04:53,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:04:53,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:53,874 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 16:04:53,874 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:04:53,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:53,875 INFO L82 PathProgramCache]: Analyzing trace with hash -222673432, now seen corresponding path program 6 times [2019-12-18 16:04:53,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:53,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216999160] [2019-12-18 16:04:53,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:54,566 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-12-18 16:04:54,755 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 16:04:54,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216999160] [2019-12-18 16:04:54,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:54,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 16:04:54,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604242745] [2019-12-18 16:04:54,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 16:04:54,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:54,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 16:04:54,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-12-18 16:04:54,757 INFO L87 Difference]: Start difference. First operand 17296 states and 51604 transitions. Second operand 21 states. [2019-12-18 16:04:57,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:57,214 INFO L93 Difference]: Finished difference Result 18253 states and 53728 transitions. [2019-12-18 16:04:57,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 16:04:57,215 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-18 16:04:57,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:57,240 INFO L225 Difference]: With dead ends: 18253 [2019-12-18 16:04:57,240 INFO L226 Difference]: Without dead ends: 18085 [2019-12-18 16:04:57,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=212, Invalid=1348, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 16:04:57,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18085 states. [2019-12-18 16:04:57,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18085 to 17272. [2019-12-18 16:04:57,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17272 states. [2019-12-18 16:04:57,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17272 states to 17272 states and 51311 transitions. [2019-12-18 16:04:57,488 INFO L78 Accepts]: Start accepts. Automaton has 17272 states and 51311 transitions. Word has length 67 [2019-12-18 16:04:57,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:57,488 INFO L462 AbstractCegarLoop]: Abstraction has 17272 states and 51311 transitions. [2019-12-18 16:04:57,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 16:04:57,488 INFO L276 IsEmpty]: Start isEmpty. Operand 17272 states and 51311 transitions. [2019-12-18 16:04:57,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:04:57,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:57,505 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 16:04:57,505 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:04:57,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:57,505 INFO L82 PathProgramCache]: Analyzing trace with hash 460338692, now seen corresponding path program 7 times [2019-12-18 16:04:57,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:57,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328733297] [2019-12-18 16:04:57,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:04:57,711 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 16:04:57,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328733297] [2019-12-18 16:04:57,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:04:57,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:04:57,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429310436] [2019-12-18 16:04:57,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:04:57,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:04:57,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:04:57,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:04:57,712 INFO L87 Difference]: Start difference. First operand 17272 states and 51311 transitions. Second operand 12 states. [2019-12-18 16:04:58,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:04:58,715 INFO L93 Difference]: Finished difference Result 29428 states and 86954 transitions. [2019-12-18 16:04:58,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 16:04:58,716 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 16:04:58,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:04:58,754 INFO L225 Difference]: With dead ends: 29428 [2019-12-18 16:04:58,754 INFO L226 Difference]: Without dead ends: 29173 [2019-12-18 16:04:58,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 16:04:58,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29173 states. [2019-12-18 16:04:59,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29173 to 17016. [2019-12-18 16:04:59,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17016 states. [2019-12-18 16:04:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17016 states to 17016 states and 50643 transitions. [2019-12-18 16:04:59,076 INFO L78 Accepts]: Start accepts. Automaton has 17016 states and 50643 transitions. Word has length 67 [2019-12-18 16:04:59,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:04:59,077 INFO L462 AbstractCegarLoop]: Abstraction has 17016 states and 50643 transitions. [2019-12-18 16:04:59,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:04:59,077 INFO L276 IsEmpty]: Start isEmpty. Operand 17016 states and 50643 transitions. [2019-12-18 16:04:59,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:04:59,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:04:59,096 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 16:04:59,096 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:04:59,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:04:59,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1210625396, now seen corresponding path program 8 times [2019-12-18 16:04:59,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:04:59,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186890673] [2019-12-18 16:04:59,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:04:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:04:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:04:59,206 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:04:59,206 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:04:59,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~z$r_buff0_thd2~0_185 0) (= 0 v_~x~0_134) (= v_~z$w_buff0_used~0_784 0) (= v_~__unbuffered_p1_EBX~0_36 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t62~0.base_32|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t62~0.base_32| 4) |v_#length_23|) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$w_buff1_used~0_442 0) (= |v_#NULL.offset_7| 0) (= v_~z~0_178 0) (= v_~z$r_buff1_thd0~0_195 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= 0 |v_ULTIMATE.start_main_~#t62~0.offset_23|) (= v_~z$read_delayed~0_6 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t62~0.base_32|) 0) (= v_~y~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~__unbuffered_p2_EBX~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~__unbuffered_cnt~0_87) (= v_~weak$$choice2~0_133 0) (= v_~z$r_buff0_thd1~0_306 0) (= 0 v_~z$flush_delayed~0_26) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff0_thd3~0_400) (= v_~z$w_buff1~0_222 0) (= 0 v_~__unbuffered_p0_EAX~0_142) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~z$r_buff1_thd3~0_306) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= v_~z$r_buff1_thd1~0_175 0) (= v_~z$r_buff1_thd2~0_185 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t62~0.base_32| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t62~0.base_32|) |v_ULTIMATE.start_main_~#t62~0.offset_23| 0)) |v_#memory_int_21|) (= v_~z$w_buff0~0_312 0) (= v_~z$r_buff0_thd0~0_204 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t62~0.base_32| 1) |v_#valid_70|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t62~0.offset=|v_ULTIMATE.start_main_~#t62~0.offset_23|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_42|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_54|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_34|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_204, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_142, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ULTIMATE.start_main_~#t64~0.base=|v_ULTIMATE.start_main_~#t64~0.base_16|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_442, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_175, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_400, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~x~0=v_~x~0_134, ULTIMATE.start_main_~#t63~0.base=|v_ULTIMATE.start_main_~#t63~0.base_29|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_222, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_62|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_48|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_195, ~y~0=v_~y~0_24, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_185, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_36, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_24|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_784, ~z$w_buff0~0=v_~z$w_buff0~0_312, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ULTIMATE.start_main_~#t64~0.offset=|v_ULTIMATE.start_main_~#t64~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t63~0.offset=|v_ULTIMATE.start_main_~#t63~0.offset_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ULTIMATE.start_main_~#t62~0.base=|v_ULTIMATE.start_main_~#t62~0.base_32|, ~weak$$choice2~0=v_~weak$$choice2~0_133, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_306} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t62~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t64~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t63~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t64~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t63~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t62~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:04:59,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L750: Formula: (and (= ~z$r_buff1_thd2~0_Out-1000607800 ~z$r_buff0_thd2~0_In-1000607800) (= ~x~0_In-1000607800 ~__unbuffered_p0_EAX~0_Out-1000607800) (= 1 ~z$r_buff0_thd1~0_Out-1000607800) (= ~z$r_buff0_thd3~0_In-1000607800 ~z$r_buff1_thd3~0_Out-1000607800) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1000607800)) (= ~z$r_buff1_thd1~0_Out-1000607800 ~z$r_buff0_thd1~0_In-1000607800) (= ~z$r_buff0_thd0~0_In-1000607800 ~z$r_buff1_thd0~0_Out-1000607800)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1000607800, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1000607800, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1000607800, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1000607800, ~x~0=~x~0_In-1000607800, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1000607800} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1000607800, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1000607800, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1000607800, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1000607800, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1000607800, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1000607800, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1000607800, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1000607800, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1000607800, ~x~0=~x~0_In-1000607800, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1000607800} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:04:59,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-1-->L834: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t63~0.offset_10|) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t63~0.base_11|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t63~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t63~0.base_11|) |v_ULTIMATE.start_main_~#t63~0.offset_10| 1)) |v_#memory_int_15|) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t63~0.base_11| 1) |v_#valid_39|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t63~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t63~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t63~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t63~0.base=|v_ULTIMATE.start_main_~#t63~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t63~0.offset=|v_ULTIMATE.start_main_~#t63~0.offset_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t63~0.base, ULTIMATE.start_main_~#t63~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 16:04:59,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L773-2-->L773-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1358493813 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1358493813 256))) (.cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out1358493813| |P1Thread1of1ForFork2_#t~ite10_Out1358493813|))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1358493813| ~z$w_buff1~0_In1358493813) .cse0 (not .cse1) (not .cse2)) (and (or .cse2 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out1358493813| ~z~0_In1358493813) .cse0))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1358493813, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1358493813, ~z$w_buff1~0=~z$w_buff1~0_In1358493813, ~z~0=~z~0_In1358493813} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1358493813|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1358493813, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1358493813|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1358493813, ~z$w_buff1~0=~z$w_buff1~0_In1358493813, ~z~0=~z~0_In1358493813} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 16:04:59,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-2078758206 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2078758206 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-2078758206|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-2078758206 |P1Thread1of1ForFork2_#t~ite11_Out-2078758206|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2078758206, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2078758206} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2078758206, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-2078758206|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2078758206} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 16:04:59,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L834-1-->L836: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t64~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t64~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t64~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t64~0.base_11|) |v_ULTIMATE.start_main_~#t64~0.offset_10| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t64~0.base_11| 0)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t64~0.base_11|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t64~0.base_11|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t64~0.base_11| 1) |v_#valid_31|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t64~0.base=|v_ULTIMATE.start_main_~#t64~0.base_11|, ULTIMATE.start_main_~#t64~0.offset=|v_ULTIMATE.start_main_~#t64~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t64~0.base, ULTIMATE.start_main_~#t64~0.offset, #length] because there is no mapped edge [2019-12-18 16:04:59,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In664070211 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In664070211 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out664070211| ~z$w_buff0_used~0_In664070211) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out664070211| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In664070211, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In664070211} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out664070211|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In664070211, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In664070211} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 16:04:59,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd1~0_In2147448704 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In2147448704 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In2147448704 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In2147448704 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out2147448704|)) (and (= ~z$w_buff1_used~0_In2147448704 |P0Thread1of1ForFork1_#t~ite6_Out2147448704|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2147448704, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2147448704, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2147448704, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2147448704} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2147448704, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out2147448704|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2147448704, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2147448704, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2147448704} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 16:04:59,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L753-->L754: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In645657460 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In645657460 256) 0))) (or (and (= ~z$r_buff0_thd1~0_In645657460 ~z$r_buff0_thd1~0_Out645657460) (or .cse0 .cse1)) (and (not .cse1) (= ~z$r_buff0_thd1~0_Out645657460 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In645657460, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In645657460} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In645657460, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out645657460|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out645657460} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:04:59,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-1166115743 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1166115743 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1166115743 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1166115743 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1166115743| ~z$r_buff1_thd1~0_In-1166115743) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1166115743| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1166115743, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1166115743, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1166115743, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1166115743} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1166115743|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1166115743, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1166115743, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1166115743, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1166115743} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 16:04:59,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L754-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_78 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_78, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 16:04:59,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1467066351 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1467066351 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In1467066351 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1467066351 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out1467066351| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out1467066351| ~z$w_buff1_used~0_In1467066351) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1467066351, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1467066351, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1467066351, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1467066351} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1467066351, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1467066351, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1467066351, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1467066351|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1467066351} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 16:04:59,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-857417826 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-857417826 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In-857417826 |P1Thread1of1ForFork2_#t~ite13_Out-857417826|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-857417826|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-857417826, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-857417826} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-857417826, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-857417826|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-857417826} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 16:04:59,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-617652764 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-617652764 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-617652764 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-617652764 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-617652764| 0)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-617652764| ~z$r_buff1_thd2~0_In-617652764) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-617652764, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-617652764, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-617652764, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-617652764} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-617652764, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-617652764, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-617652764, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-617652764|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-617652764} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 16:04:59,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L777-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~z$r_buff1_thd2~0_132 |v_P1Thread1of1ForFork2_#t~ite14_36|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_36|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_132, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_35|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 16:04:59,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L801-->L801-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2078263379 256)))) (or (and (= ~z$w_buff1_used~0_In2078263379 |P2Thread1of1ForFork0_#t~ite30_Out2078263379|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite29_In2078263379| |P2Thread1of1ForFork0_#t~ite29_Out2078263379|)) (and (= ~z$w_buff1_used~0_In2078263379 |P2Thread1of1ForFork0_#t~ite29_Out2078263379|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In2078263379 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In2078263379 256)) (and (= 0 (mod ~z$w_buff1_used~0_In2078263379 256)) .cse1) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In2078263379 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite30_Out2078263379| |P2Thread1of1ForFork0_#t~ite29_Out2078263379|) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2078263379, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2078263379, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2078263379, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2078263379, ~weak$$choice2~0=~weak$$choice2~0_In2078263379, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In2078263379|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2078263379, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2078263379, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2078263379, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2078263379, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out2078263379|, ~weak$$choice2~0=~weak$$choice2~0_In2078263379, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out2078263379|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 16:04:59,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~z$r_buff0_thd3~0_58 v_~z$r_buff0_thd3~0_59)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 16:04:59,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L805-->L809: Formula: (and (= v_~z~0_56 v_~z$mem_tmp~0_5) (= 0 v_~z$flush_delayed~0_11) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 16:04:59,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-2-->L809-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-491384244 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-491384244 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-491384244| ~z$w_buff1~0_In-491384244)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-491384244| ~z~0_In-491384244) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-491384244, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-491384244, ~z$w_buff1~0=~z$w_buff1~0_In-491384244, ~z~0=~z~0_In-491384244} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-491384244|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-491384244, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-491384244, ~z$w_buff1~0=~z$w_buff1~0_In-491384244, ~z~0=~z~0_In-491384244} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 16:04:59,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-4-->L810: Formula: (= v_~z~0_38 |v_P2Thread1of1ForFork0_#t~ite38_14|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_14|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-18 16:04:59,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1949730776 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1949730776 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-1949730776| ~z$w_buff0_used~0_In-1949730776)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-1949730776| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1949730776, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1949730776} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1949730776, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1949730776|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1949730776} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 16:04:59,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1111974748 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1111974748 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1111974748 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In1111974748 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1111974748|)) (and (= ~z$w_buff1_used~0_In1111974748 |P2Thread1of1ForFork0_#t~ite41_Out1111974748|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1111974748, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1111974748, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1111974748, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1111974748} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1111974748, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1111974748, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1111974748, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1111974748, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1111974748|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 16:04:59,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-500748477 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-500748477 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-500748477|) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In-500748477 |P2Thread1of1ForFork0_#t~ite42_Out-500748477|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-500748477, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-500748477} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-500748477, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-500748477, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-500748477|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 16:04:59,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-750140976 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-750140976 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-750140976 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-750140976 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In-750140976 |P2Thread1of1ForFork0_#t~ite43_Out-750140976|)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out-750140976| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-750140976, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-750140976, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-750140976, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-750140976} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-750140976|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-750140976, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-750140976, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-750140976, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-750140976} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 16:04:59,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= v_~z$r_buff1_thd3~0_188 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_188, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 16:04:59,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 16:04:59,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L842-2-->L842-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-1222343390| |ULTIMATE.start_main_#t~ite47_Out-1222343390|)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1222343390 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1222343390 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In-1222343390 |ULTIMATE.start_main_#t~ite47_Out-1222343390|)) (and .cse0 (not .cse2) (= ~z$w_buff1~0_In-1222343390 |ULTIMATE.start_main_#t~ite47_Out-1222343390|) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1222343390, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1222343390, ~z$w_buff1~0=~z$w_buff1~0_In-1222343390, ~z~0=~z~0_In-1222343390} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1222343390, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1222343390|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1222343390, ~z$w_buff1~0=~z$w_buff1~0_In-1222343390, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1222343390|, ~z~0=~z~0_In-1222343390} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 16:04:59,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1704766843 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1704766843 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-1704766843| ~z$w_buff0_used~0_In-1704766843) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1704766843| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1704766843, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1704766843} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1704766843, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1704766843, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1704766843|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 16:04:59,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1408362519 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1408362519 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1408362519 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1408362519 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-1408362519|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1408362519 |ULTIMATE.start_main_#t~ite50_Out-1408362519|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1408362519, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1408362519, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1408362519, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1408362519} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1408362519|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1408362519, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1408362519, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1408362519, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1408362519} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 16:04:59,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L845-->L845-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-15958351 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-15958351 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-15958351|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-15958351 |ULTIMATE.start_main_#t~ite51_Out-15958351|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-15958351, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-15958351} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-15958351, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-15958351|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-15958351} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 16:04:59,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L846-->L846-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1961562402 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1961562402 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1961562402 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1961562402 256)))) (or (and (= ~z$r_buff1_thd0~0_In1961562402 |ULTIMATE.start_main_#t~ite52_Out1961562402|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out1961562402|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1961562402, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1961562402, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1961562402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1961562402} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1961562402|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1961562402, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1961562402, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1961562402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1961562402} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 16:04:59,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~z$r_buff1_thd0~0_155 |v_ULTIMATE.start_main_#t~ite52_46|) (= 0 v_~__unbuffered_p0_EAX~0_114) (= 1 v_~__unbuffered_p1_EAX~0_23) (= v_~__unbuffered_p1_EBX~0_22 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_46|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_45|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_155, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:04:59,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:04:59 BasicIcfg [2019-12-18 16:04:59,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:04:59,342 INFO L168 Benchmark]: Toolchain (without parser) took 122060.72 ms. Allocated memory was 146.3 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 102.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-18 16:04:59,343 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 16:04:59,343 INFO L168 Benchmark]: CACSL2BoogieTranslator took 721.22 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.9 MB in the beginning and 155.2 MB in the end (delta: -53.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:04:59,344 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.06 ms. Allocated memory is still 203.9 MB. Free memory was 155.2 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:04:59,345 INFO L168 Benchmark]: Boogie Preprocessor took 38.73 ms. Allocated memory is still 203.9 MB. Free memory was 152.6 MB in the beginning and 149.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:04:59,345 INFO L168 Benchmark]: RCFGBuilder took 821.41 ms. Allocated memory is still 203.9 MB. Free memory was 149.9 MB in the beginning and 99.7 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-18 16:04:59,345 INFO L168 Benchmark]: TraceAbstraction took 120413.41 ms. Allocated memory was 203.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 99.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-18 16:04:59,348 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.44 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 721.22 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.9 MB in the beginning and 155.2 MB in the end (delta: -53.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.06 ms. Allocated memory is still 203.9 MB. Free memory was 155.2 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.73 ms. Allocated memory is still 203.9 MB. Free memory was 152.6 MB in the beginning and 149.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 821.41 ms. Allocated memory is still 203.9 MB. Free memory was 149.9 MB in the beginning and 99.7 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 120413.41 ms. Allocated memory was 203.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 99.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 178 ProgramPointsBefore, 95 ProgramPointsAfterwards, 215 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 35 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 29 ChoiceCompositions, 7593 VarBasedMoverChecksPositive, 373 VarBasedMoverChecksNegative, 200 SemBasedMoverChecksPositive, 268 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 132619 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t62, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 z$w_buff1 = z$w_buff0 [L736] 1 z$w_buff0 = 1 [L737] 1 z$w_buff1_used = z$w_buff0_used [L738] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t63, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = x [L770] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L773] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L836] FCALL, FORK 0 pthread_create(&t64, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 y = 1 [L790] 3 __unbuffered_p2_EAX = y [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L775] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L798] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 120.0s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 41.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9094 SDtfs, 9891 SDslu, 33099 SDs, 0 SdLazy, 20885 SolverSat, 423 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 503 GetRequests, 78 SyntacticMatches, 29 SemanticMatches, 396 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1497 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153153occurred 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: 46.1s AutomataMinimizationTime, 36 MinimizatonAttempts, 304311 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1750 NumberOfCodeBlocks, 1750 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1647 ConstructedInterpolants, 0 QuantifiedInterpolants, 405421 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...