/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:03:54,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:03:54,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:03:54,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:03:54,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:03:54,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:03:54,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:03:54,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:03:54,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:03:54,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:03:54,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:03:54,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:03:54,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:03:54,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:03:54,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:03:54,922 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:03:54,923 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:03:54,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:03:54,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:03:54,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:03:54,929 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:03:54,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:03:54,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:03:54,932 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:03:54,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:03:54,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:03:54,935 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:03:54,936 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:03:54,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:03:54,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:03:54,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:03:54,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:03:54,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:03:54,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:03:54,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:03:54,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:03:54,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:03:54,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:03:54,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:03:54,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:03:54,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:03:54,945 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 23:03:54,969 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:03:54,969 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:03:54,971 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:03:54,971 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:03:54,971 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:03:54,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:03:54,972 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:03:54,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:03:54,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:03:54,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:03:54,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:03:54,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:03:54,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:03:54,974 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:03:54,974 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:03:54,974 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:03:54,975 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:03:54,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:03:54,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:03:54,975 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:03:54,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:03:54,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:03:54,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:03:54,976 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:03:54,977 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:03:54,977 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:03:54,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:03:54,977 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 23:03:54,977 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:03:54,978 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:03:55,245 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:03:55,266 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:03:55,271 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:03:55,272 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:03:55,273 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:03:55,274 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc.i [2019-12-18 23:03:55,348 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9e5fbdc5/aaad7cc4a0854df0a70b183b5397ace1/FLAG8e95ccc65 [2019-12-18 23:03:55,950 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:03:55,950 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.oepc.i [2019-12-18 23:03:55,970 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9e5fbdc5/aaad7cc4a0854df0a70b183b5397ace1/FLAG8e95ccc65 [2019-12-18 23:03:56,228 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9e5fbdc5/aaad7cc4a0854df0a70b183b5397ace1 [2019-12-18 23:03:56,237 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:03:56,239 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:03:56,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:03:56,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:03:56,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:03:56,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:03:56" (1/1) ... [2019-12-18 23:03:56,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37a32c8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:56, skipping insertion in model container [2019-12-18 23:03:56,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:03:56" (1/1) ... [2019-12-18 23:03:56,255 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:03:56,313 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:03:56,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:03:56,848 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:03:56,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:03:56,999 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:03:57,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:57 WrapperNode [2019-12-18 23:03:57,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:03:57,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:03:57,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:03:57,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:03:57,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:57" (1/1) ... [2019-12-18 23:03:57,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:57" (1/1) ... [2019-12-18 23:03:57,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:03:57,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:03:57,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:03:57,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:03:57,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:57" (1/1) ... [2019-12-18 23:03:57,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:57" (1/1) ... [2019-12-18 23:03:57,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:57" (1/1) ... [2019-12-18 23:03:57,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:57" (1/1) ... [2019-12-18 23:03:57,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:57" (1/1) ... [2019-12-18 23:03:57,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:57" (1/1) ... [2019-12-18 23:03:57,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:57" (1/1) ... [2019-12-18 23:03:57,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:03:57,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:03:57,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:03:57,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:03:57,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:57" (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 23:03:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:03:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 23:03:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:03:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:03:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 23:03:57,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 23:03:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 23:03:57,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 23:03:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 23:03:57,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 23:03:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 23:03:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:03:57,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:03:57,196 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 23:03:57,948 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:03:57,948 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 23:03:57,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:03:57 BoogieIcfgContainer [2019-12-18 23:03:57,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:03:57,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:03:57,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:03:57,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:03:57,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:03:56" (1/3) ... [2019-12-18 23:03:57,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281c1ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:03:57, skipping insertion in model container [2019-12-18 23:03:57,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:57" (2/3) ... [2019-12-18 23:03:57,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281c1ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:03:57, skipping insertion in model container [2019-12-18 23:03:57,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:03:57" (3/3) ... [2019-12-18 23:03:57,958 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_power.oepc.i [2019-12-18 23:03:57,969 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:03:57,969 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:03:57,977 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 23:03:57,978 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:03:58,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,019 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,020 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,070 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,070 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,070 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,070 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,071 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,077 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,077 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,086 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,086 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,086 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,092 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,092 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,095 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,096 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:58,113 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 23:03:58,136 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:03:58,136 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:03:58,136 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:03:58,136 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:03:58,136 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:03:58,137 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:03:58,137 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:03:58,137 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:03:58,153 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-18 23:03:58,155 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 23:03:58,254 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 23:03:58,255 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:03:58,275 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 23:03:58,301 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 23:03:58,361 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 23:03:58,361 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:03:58,372 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 23:03:58,394 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 23:03:58,396 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:04:01,719 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 23:04:01,986 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 23:04:02,118 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 23:04:02,146 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75290 [2019-12-18 23:04:02,147 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 23:04:02,150 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 94 transitions [2019-12-18 23:04:16,258 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92134 states. [2019-12-18 23:04:16,261 INFO L276 IsEmpty]: Start isEmpty. Operand 92134 states. [2019-12-18 23:04:16,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 23:04:16,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:16,268 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 23:04:16,269 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:16,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:16,275 INFO L82 PathProgramCache]: Analyzing trace with hash 790879197, now seen corresponding path program 1 times [2019-12-18 23:04:16,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:16,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915574295] [2019-12-18 23:04:16,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:16,491 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 23:04:16,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915574295] [2019-12-18 23:04:16,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:16,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:04:16,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539847637] [2019-12-18 23:04:16,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:04:16,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:16,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:04:16,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:16,520 INFO L87 Difference]: Start difference. First operand 92134 states. Second operand 3 states. [2019-12-18 23:04:17,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:17,677 INFO L93 Difference]: Finished difference Result 90524 states and 389631 transitions. [2019-12-18 23:04:17,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:04:17,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 23:04:17,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:20,518 INFO L225 Difference]: With dead ends: 90524 [2019-12-18 23:04:20,518 INFO L226 Difference]: Without dead ends: 84882 [2019-12-18 23:04:20,521 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 23:04:23,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84882 states. [2019-12-18 23:04:25,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84882 to 84882. [2019-12-18 23:04:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84882 states. [2019-12-18 23:04:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84882 states to 84882 states and 364809 transitions. [2019-12-18 23:04:26,371 INFO L78 Accepts]: Start accepts. Automaton has 84882 states and 364809 transitions. Word has length 5 [2019-12-18 23:04:26,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:26,371 INFO L462 AbstractCegarLoop]: Abstraction has 84882 states and 364809 transitions. [2019-12-18 23:04:26,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 84882 states and 364809 transitions. [2019-12-18 23:04:26,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:04:26,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:26,380 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:26,380 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:26,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:26,380 INFO L82 PathProgramCache]: Analyzing trace with hash 2214746, now seen corresponding path program 1 times [2019-12-18 23:04:26,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:26,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414805537] [2019-12-18 23:04:26,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:26,514 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 23:04:26,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414805537] [2019-12-18 23:04:26,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:26,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:04:26,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168920222] [2019-12-18 23:04:26,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:04:26,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:26,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:04:26,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:04:26,518 INFO L87 Difference]: Start difference. First operand 84882 states and 364809 transitions. Second operand 4 states. [2019-12-18 23:04:30,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:30,857 INFO L93 Difference]: Finished difference Result 130108 states and 534106 transitions. [2019-12-18 23:04:30,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:04:30,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 23:04:30,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:31,506 INFO L225 Difference]: With dead ends: 130108 [2019-12-18 23:04:31,506 INFO L226 Difference]: Without dead ends: 129996 [2019-12-18 23:04:31,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 23:04:35,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129996 states. [2019-12-18 23:04:38,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129996 to 120798. [2019-12-18 23:04:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120798 states. [2019-12-18 23:04:39,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120798 states to 120798 states and 501253 transitions. [2019-12-18 23:04:39,333 INFO L78 Accepts]: Start accepts. Automaton has 120798 states and 501253 transitions. Word has length 13 [2019-12-18 23:04:39,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:39,334 INFO L462 AbstractCegarLoop]: Abstraction has 120798 states and 501253 transitions. [2019-12-18 23:04:39,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:04:39,335 INFO L276 IsEmpty]: Start isEmpty. Operand 120798 states and 501253 transitions. [2019-12-18 23:04:39,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:04:39,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:39,338 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:39,339 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:39,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:39,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1319615161, now seen corresponding path program 1 times [2019-12-18 23:04:39,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:39,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74927636] [2019-12-18 23:04:39,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:39,421 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 23:04:39,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74927636] [2019-12-18 23:04:39,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:39,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:04:39,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101742635] [2019-12-18 23:04:39,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:04:39,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:39,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:04:39,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:39,424 INFO L87 Difference]: Start difference. First operand 120798 states and 501253 transitions. Second operand 3 states. [2019-12-18 23:04:43,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:43,282 INFO L93 Difference]: Finished difference Result 29480 states and 98975 transitions. [2019-12-18 23:04:43,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:04:43,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 23:04:43,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:43,347 INFO L225 Difference]: With dead ends: 29480 [2019-12-18 23:04:43,347 INFO L226 Difference]: Without dead ends: 29480 [2019-12-18 23:04:43,347 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 23:04:43,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29480 states. [2019-12-18 23:04:43,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29480 to 29480. [2019-12-18 23:04:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29480 states. [2019-12-18 23:04:44,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29480 states to 29480 states and 98975 transitions. [2019-12-18 23:04:44,059 INFO L78 Accepts]: Start accepts. Automaton has 29480 states and 98975 transitions. Word has length 13 [2019-12-18 23:04:44,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:44,059 INFO L462 AbstractCegarLoop]: Abstraction has 29480 states and 98975 transitions. [2019-12-18 23:04:44,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 29480 states and 98975 transitions. [2019-12-18 23:04:44,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 23:04:44,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:44,061 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:44,062 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:44,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:44,062 INFO L82 PathProgramCache]: Analyzing trace with hash -856921002, now seen corresponding path program 1 times [2019-12-18 23:04:44,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:44,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288078011] [2019-12-18 23:04:44,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:44,174 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 23:04:44,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288078011] [2019-12-18 23:04:44,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:44,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:04:44,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012160413] [2019-12-18 23:04:44,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:04:44,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:44,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:04:44,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:04:44,180 INFO L87 Difference]: Start difference. First operand 29480 states and 98975 transitions. Second operand 5 states. [2019-12-18 23:04:44,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:44,637 INFO L93 Difference]: Finished difference Result 42246 states and 139417 transitions. [2019-12-18 23:04:44,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:04:44,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 23:04:44,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:44,710 INFO L225 Difference]: With dead ends: 42246 [2019-12-18 23:04:44,710 INFO L226 Difference]: Without dead ends: 42228 [2019-12-18 23:04:44,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:04:44,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42228 states. [2019-12-18 23:04:45,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42228 to 33417. [2019-12-18 23:04:45,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33417 states. [2019-12-18 23:04:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33417 states to 33417 states and 111616 transitions. [2019-12-18 23:04:45,710 INFO L78 Accepts]: Start accepts. Automaton has 33417 states and 111616 transitions. Word has length 14 [2019-12-18 23:04:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:45,711 INFO L462 AbstractCegarLoop]: Abstraction has 33417 states and 111616 transitions. [2019-12-18 23:04:45,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:04:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 33417 states and 111616 transitions. [2019-12-18 23:04:45,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:04:45,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:45,721 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 23:04:45,721 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:45,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:45,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1451441927, now seen corresponding path program 1 times [2019-12-18 23:04:45,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:45,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063563970] [2019-12-18 23:04:45,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:04:45,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063563970] [2019-12-18 23:04:45,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:45,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:04:45,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195603025] [2019-12-18 23:04:45,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:04:45,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:45,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:04:45,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:04:45,831 INFO L87 Difference]: Start difference. First operand 33417 states and 111616 transitions. Second operand 6 states. [2019-12-18 23:04:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:46,618 INFO L93 Difference]: Finished difference Result 52783 states and 172326 transitions. [2019-12-18 23:04:46,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 23:04:46,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 23:04:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:46,750 INFO L225 Difference]: With dead ends: 52783 [2019-12-18 23:04:46,751 INFO L226 Difference]: Without dead ends: 52753 [2019-12-18 23:04:46,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 23:04:47,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52753 states. [2019-12-18 23:04:47,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52753 to 36130. [2019-12-18 23:04:47,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36130 states. [2019-12-18 23:04:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36130 states to 36130 states and 119897 transitions. [2019-12-18 23:04:47,540 INFO L78 Accepts]: Start accepts. Automaton has 36130 states and 119897 transitions. Word has length 22 [2019-12-18 23:04:47,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:47,541 INFO L462 AbstractCegarLoop]: Abstraction has 36130 states and 119897 transitions. [2019-12-18 23:04:47,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:04:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand 36130 states and 119897 transitions. [2019-12-18 23:04:47,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:04:47,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:47,550 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 23:04:47,551 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:47,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:47,551 INFO L82 PathProgramCache]: Analyzing trace with hash -880932147, now seen corresponding path program 1 times [2019-12-18 23:04:47,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:47,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412640955] [2019-12-18 23:04:47,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:47,692 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 23:04:47,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412640955] [2019-12-18 23:04:47,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:47,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:04:47,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861684175] [2019-12-18 23:04:47,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:04:47,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:47,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:04:47,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:04:47,694 INFO L87 Difference]: Start difference. First operand 36130 states and 119897 transitions. Second operand 6 states. [2019-12-18 23:04:48,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:48,776 INFO L93 Difference]: Finished difference Result 61139 states and 197009 transitions. [2019-12-18 23:04:48,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 23:04:48,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 23:04:48,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:48,892 INFO L225 Difference]: With dead ends: 61139 [2019-12-18 23:04:48,892 INFO L226 Difference]: Without dead ends: 61109 [2019-12-18 23:04:48,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 23:04:49,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61109 states. [2019-12-18 23:04:49,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61109 to 41888. [2019-12-18 23:04:49,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41888 states. [2019-12-18 23:04:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41888 states to 41888 states and 137110 transitions. [2019-12-18 23:04:49,777 INFO L78 Accepts]: Start accepts. Automaton has 41888 states and 137110 transitions. Word has length 22 [2019-12-18 23:04:49,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:49,778 INFO L462 AbstractCegarLoop]: Abstraction has 41888 states and 137110 transitions. [2019-12-18 23:04:49,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:04:49,778 INFO L276 IsEmpty]: Start isEmpty. Operand 41888 states and 137110 transitions. [2019-12-18 23:04:49,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:04:49,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:49,787 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 23:04:49,787 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:49,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:49,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1606912493, now seen corresponding path program 2 times [2019-12-18 23:04:49,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:49,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098099066] [2019-12-18 23:04:49,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:49,865 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 23:04:49,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098099066] [2019-12-18 23:04:49,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:49,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:04:49,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034092275] [2019-12-18 23:04:49,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:04:49,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:49,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:04:49,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:04:49,868 INFO L87 Difference]: Start difference. First operand 41888 states and 137110 transitions. Second operand 6 states. [2019-12-18 23:04:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:50,828 INFO L93 Difference]: Finished difference Result 59558 states and 191538 transitions. [2019-12-18 23:04:50,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:04:50,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 23:04:50,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:50,977 INFO L225 Difference]: With dead ends: 59558 [2019-12-18 23:04:50,977 INFO L226 Difference]: Without dead ends: 59540 [2019-12-18 23:04:50,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:04:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59540 states. [2019-12-18 23:04:52,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59540 to 39834. [2019-12-18 23:04:52,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39834 states. [2019-12-18 23:04:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39834 states to 39834 states and 130144 transitions. [2019-12-18 23:04:52,352 INFO L78 Accepts]: Start accepts. Automaton has 39834 states and 130144 transitions. Word has length 22 [2019-12-18 23:04:52,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:52,352 INFO L462 AbstractCegarLoop]: Abstraction has 39834 states and 130144 transitions. [2019-12-18 23:04:52,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:04:52,353 INFO L276 IsEmpty]: Start isEmpty. Operand 39834 states and 130144 transitions. [2019-12-18 23:04:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:04:52,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:52,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] [2019-12-18 23:04:52,366 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:52,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:52,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1210888405, now seen corresponding path program 1 times [2019-12-18 23:04:52,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:52,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209073385] [2019-12-18 23:04:52,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:52,409 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 23:04:52,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209073385] [2019-12-18 23:04:52,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:52,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:04:52,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804323019] [2019-12-18 23:04:52,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:04:52,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:52,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:04:52,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:04:52,412 INFO L87 Difference]: Start difference. First operand 39834 states and 130144 transitions. Second operand 4 states. [2019-12-18 23:04:52,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:52,479 INFO L93 Difference]: Finished difference Result 15680 states and 47607 transitions. [2019-12-18 23:04:52,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:04:52,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 23:04:52,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:52,501 INFO L225 Difference]: With dead ends: 15680 [2019-12-18 23:04:52,501 INFO L226 Difference]: Without dead ends: 15680 [2019-12-18 23:04:52,501 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 23:04:52,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15680 states. [2019-12-18 23:04:52,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15680 to 15474. [2019-12-18 23:04:52,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15474 states. [2019-12-18 23:04:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15474 states to 15474 states and 47012 transitions. [2019-12-18 23:04:52,737 INFO L78 Accepts]: Start accepts. Automaton has 15474 states and 47012 transitions. Word has length 25 [2019-12-18 23:04:52,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:52,737 INFO L462 AbstractCegarLoop]: Abstraction has 15474 states and 47012 transitions. [2019-12-18 23:04:52,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:04:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 15474 states and 47012 transitions. [2019-12-18 23:04:52,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 23:04:52,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:52,760 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 23:04:52,760 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:52,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:52,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1136830823, now seen corresponding path program 1 times [2019-12-18 23:04:52,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:52,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547733039] [2019-12-18 23:04:52,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:52,832 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 23:04:52,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547733039] [2019-12-18 23:04:52,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:52,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:04:52,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755961007] [2019-12-18 23:04:52,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:04:52,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:52,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:04:52,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:52,836 INFO L87 Difference]: Start difference. First operand 15474 states and 47012 transitions. Second operand 3 states. [2019-12-18 23:04:52,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:52,931 INFO L93 Difference]: Finished difference Result 28148 states and 85452 transitions. [2019-12-18 23:04:52,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:04:52,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 23:04:52,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:52,955 INFO L225 Difference]: With dead ends: 28148 [2019-12-18 23:04:52,956 INFO L226 Difference]: Without dead ends: 15947 [2019-12-18 23:04:52,956 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 23:04:53,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15947 states. [2019-12-18 23:04:53,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15947 to 15806. [2019-12-18 23:04:53,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15806 states. [2019-12-18 23:04:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15806 states to 15806 states and 47065 transitions. [2019-12-18 23:04:53,192 INFO L78 Accepts]: Start accepts. Automaton has 15806 states and 47065 transitions. Word has length 39 [2019-12-18 23:04:53,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:53,193 INFO L462 AbstractCegarLoop]: Abstraction has 15806 states and 47065 transitions. [2019-12-18 23:04:53,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:53,193 INFO L276 IsEmpty]: Start isEmpty. Operand 15806 states and 47065 transitions. [2019-12-18 23:04:53,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 23:04:53,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:53,215 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 23:04:53,215 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:53,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:53,216 INFO L82 PathProgramCache]: Analyzing trace with hash -285407363, now seen corresponding path program 1 times [2019-12-18 23:04:53,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:53,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405698248] [2019-12-18 23:04:53,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:53,291 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 23:04:53,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405698248] [2019-12-18 23:04:53,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:53,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:04:53,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909000223] [2019-12-18 23:04:53,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:04:53,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:53,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:04:53,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:04:53,294 INFO L87 Difference]: Start difference. First operand 15806 states and 47065 transitions. Second operand 5 states. [2019-12-18 23:04:53,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:53,397 INFO L93 Difference]: Finished difference Result 14360 states and 43443 transitions. [2019-12-18 23:04:53,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:04:53,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 23:04:53,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:53,423 INFO L225 Difference]: With dead ends: 14360 [2019-12-18 23:04:53,424 INFO L226 Difference]: Without dead ends: 12352 [2019-12-18 23:04:53,424 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 23:04:53,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12352 states. [2019-12-18 23:04:53,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12352 to 11736. [2019-12-18 23:04:53,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11736 states. [2019-12-18 23:04:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11736 states to 11736 states and 36252 transitions. [2019-12-18 23:04:53,722 INFO L78 Accepts]: Start accepts. Automaton has 11736 states and 36252 transitions. Word has length 40 [2019-12-18 23:04:53,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:53,723 INFO L462 AbstractCegarLoop]: Abstraction has 11736 states and 36252 transitions. [2019-12-18 23:04:53,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:04:53,723 INFO L276 IsEmpty]: Start isEmpty. Operand 11736 states and 36252 transitions. [2019-12-18 23:04:53,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:04:53,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:53,752 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] [2019-12-18 23:04:53,752 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:53,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:53,752 INFO L82 PathProgramCache]: Analyzing trace with hash 72230609, now seen corresponding path program 1 times [2019-12-18 23:04:53,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:53,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441008397] [2019-12-18 23:04:53,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:53,817 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 23:04:53,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441008397] [2019-12-18 23:04:53,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:53,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:04:53,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919394249] [2019-12-18 23:04:53,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:04:53,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:53,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:04:53,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:53,821 INFO L87 Difference]: Start difference. First operand 11736 states and 36252 transitions. Second operand 3 states. [2019-12-18 23:04:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:54,037 INFO L93 Difference]: Finished difference Result 15466 states and 47136 transitions. [2019-12-18 23:04:54,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:04:54,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 23:04:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:54,057 INFO L225 Difference]: With dead ends: 15466 [2019-12-18 23:04:54,058 INFO L226 Difference]: Without dead ends: 15466 [2019-12-18 23:04:54,058 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 23:04:54,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15466 states. [2019-12-18 23:04:54,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15466 to 12452. [2019-12-18 23:04:54,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12452 states. [2019-12-18 23:04:54,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12452 states to 12452 states and 38494 transitions. [2019-12-18 23:04:54,272 INFO L78 Accepts]: Start accepts. Automaton has 12452 states and 38494 transitions. Word has length 54 [2019-12-18 23:04:54,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:54,273 INFO L462 AbstractCegarLoop]: Abstraction has 12452 states and 38494 transitions. [2019-12-18 23:04:54,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:54,273 INFO L276 IsEmpty]: Start isEmpty. Operand 12452 states and 38494 transitions. [2019-12-18 23:04:54,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:04:54,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:54,291 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] [2019-12-18 23:04:54,291 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:54,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:54,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1591694771, now seen corresponding path program 1 times [2019-12-18 23:04:54,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:54,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953497296] [2019-12-18 23:04:54,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:54,370 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 23:04:54,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953497296] [2019-12-18 23:04:54,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:54,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:04:54,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482962131] [2019-12-18 23:04:54,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:04:54,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:54,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:04:54,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:04:54,372 INFO L87 Difference]: Start difference. First operand 12452 states and 38494 transitions. Second operand 6 states. [2019-12-18 23:04:54,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:54,808 INFO L93 Difference]: Finished difference Result 37107 states and 113202 transitions. [2019-12-18 23:04:54,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 23:04:54,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-18 23:04:54,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:54,867 INFO L225 Difference]: With dead ends: 37107 [2019-12-18 23:04:54,868 INFO L226 Difference]: Without dead ends: 26417 [2019-12-18 23:04:54,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 23:04:55,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26417 states. [2019-12-18 23:04:55,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26417 to 15311. [2019-12-18 23:04:55,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-18 23:04:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 47554 transitions. [2019-12-18 23:04:55,253 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 47554 transitions. Word has length 54 [2019-12-18 23:04:55,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:55,254 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 47554 transitions. [2019-12-18 23:04:55,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:04:55,254 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 47554 transitions. [2019-12-18 23:04:55,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:04:55,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:55,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:55,272 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:55,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:55,273 INFO L82 PathProgramCache]: Analyzing trace with hash 944548917, now seen corresponding path program 2 times [2019-12-18 23:04:55,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:55,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804249466] [2019-12-18 23:04:55,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:55,362 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 23:04:55,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804249466] [2019-12-18 23:04:55,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:55,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:04:55,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674911033] [2019-12-18 23:04:55,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:04:55,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:55,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:04:55,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:04:55,366 INFO L87 Difference]: Start difference. First operand 15311 states and 47554 transitions. Second operand 7 states. [2019-12-18 23:04:55,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:55,816 INFO L93 Difference]: Finished difference Result 36247 states and 110845 transitions. [2019-12-18 23:04:55,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:04:55,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 23:04:55,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:55,864 INFO L225 Difference]: With dead ends: 36247 [2019-12-18 23:04:55,864 INFO L226 Difference]: Without dead ends: 28238 [2019-12-18 23:04:55,864 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 23:04:55,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28238 states. [2019-12-18 23:04:56,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28238 to 18156. [2019-12-18 23:04:56,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18156 states. [2019-12-18 23:04:56,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18156 states to 18156 states and 56517 transitions. [2019-12-18 23:04:56,237 INFO L78 Accepts]: Start accepts. Automaton has 18156 states and 56517 transitions. Word has length 54 [2019-12-18 23:04:56,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:56,237 INFO L462 AbstractCegarLoop]: Abstraction has 18156 states and 56517 transitions. [2019-12-18 23:04:56,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:04:56,237 INFO L276 IsEmpty]: Start isEmpty. Operand 18156 states and 56517 transitions. [2019-12-18 23:04:56,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:04:56,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:56,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:56,262 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:56,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:56,262 INFO L82 PathProgramCache]: Analyzing trace with hash -472146899, now seen corresponding path program 3 times [2019-12-18 23:04:56,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:56,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568178998] [2019-12-18 23:04:56,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:56,341 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 23:04:56,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568178998] [2019-12-18 23:04:56,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:56,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:04:56,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941668091] [2019-12-18 23:04:56,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:04:56,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:56,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:04:56,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:04:56,343 INFO L87 Difference]: Start difference. First operand 18156 states and 56517 transitions. Second operand 7 states. [2019-12-18 23:04:56,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:56,737 INFO L93 Difference]: Finished difference Result 32612 states and 98652 transitions. [2019-12-18 23:04:56,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 23:04:56,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 23:04:56,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:56,781 INFO L225 Difference]: With dead ends: 32612 [2019-12-18 23:04:56,781 INFO L226 Difference]: Without dead ends: 30521 [2019-12-18 23:04:56,781 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 23:04:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30521 states. [2019-12-18 23:04:57,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30521 to 18238. [2019-12-18 23:04:57,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18238 states. [2019-12-18 23:04:57,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18238 states to 18238 states and 56811 transitions. [2019-12-18 23:04:57,351 INFO L78 Accepts]: Start accepts. Automaton has 18238 states and 56811 transitions. Word has length 54 [2019-12-18 23:04:57,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:57,351 INFO L462 AbstractCegarLoop]: Abstraction has 18238 states and 56811 transitions. [2019-12-18 23:04:57,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:04:57,351 INFO L276 IsEmpty]: Start isEmpty. Operand 18238 states and 56811 transitions. [2019-12-18 23:04:57,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:04:57,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:57,380 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] [2019-12-18 23:04:57,380 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:57,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:57,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1266055375, now seen corresponding path program 1 times [2019-12-18 23:04:57,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:57,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696163782] [2019-12-18 23:04:57,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:57,426 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 23:04:57,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696163782] [2019-12-18 23:04:57,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:57,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:04:57,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453148695] [2019-12-18 23:04:57,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:04:57,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:57,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:04:57,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:57,428 INFO L87 Difference]: Start difference. First operand 18238 states and 56811 transitions. Second operand 3 states. [2019-12-18 23:04:57,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:57,541 INFO L93 Difference]: Finished difference Result 20067 states and 60827 transitions. [2019-12-18 23:04:57,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:04:57,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 23:04:57,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:57,578 INFO L225 Difference]: With dead ends: 20067 [2019-12-18 23:04:57,579 INFO L226 Difference]: Without dead ends: 20067 [2019-12-18 23:04:57,579 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 23:04:57,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20067 states. [2019-12-18 23:04:58,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20067 to 16362. [2019-12-18 23:04:58,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16362 states. [2019-12-18 23:04:58,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16362 states to 16362 states and 50310 transitions. [2019-12-18 23:04:58,050 INFO L78 Accepts]: Start accepts. Automaton has 16362 states and 50310 transitions. Word has length 54 [2019-12-18 23:04:58,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:58,050 INFO L462 AbstractCegarLoop]: Abstraction has 16362 states and 50310 transitions. [2019-12-18 23:04:58,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:58,050 INFO L276 IsEmpty]: Start isEmpty. Operand 16362 states and 50310 transitions. [2019-12-18 23:04:58,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:04:58,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:58,078 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] [2019-12-18 23:04:58,078 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:58,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:58,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1033313199, now seen corresponding path program 4 times [2019-12-18 23:04:58,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:58,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951784225] [2019-12-18 23:04:58,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:58,176 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 23:04:58,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951784225] [2019-12-18 23:04:58,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:58,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:04:58,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19640390] [2019-12-18 23:04:58,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:04:58,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:58,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:04:58,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:04:58,180 INFO L87 Difference]: Start difference. First operand 16362 states and 50310 transitions. Second operand 7 states. [2019-12-18 23:04:58,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:58,535 INFO L93 Difference]: Finished difference Result 32735 states and 97743 transitions. [2019-12-18 23:04:58,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 23:04:58,536 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 23:04:58,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:58,573 INFO L225 Difference]: With dead ends: 32735 [2019-12-18 23:04:58,573 INFO L226 Difference]: Without dead ends: 27615 [2019-12-18 23:04:58,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:04:58,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27615 states. [2019-12-18 23:04:58,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27615 to 16518. [2019-12-18 23:04:58,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16518 states. [2019-12-18 23:04:58,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16518 states to 16518 states and 50740 transitions. [2019-12-18 23:04:58,932 INFO L78 Accepts]: Start accepts. Automaton has 16518 states and 50740 transitions. Word has length 54 [2019-12-18 23:04:58,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:58,933 INFO L462 AbstractCegarLoop]: Abstraction has 16518 states and 50740 transitions. [2019-12-18 23:04:58,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:04:58,933 INFO L276 IsEmpty]: Start isEmpty. Operand 16518 states and 50740 transitions. [2019-12-18 23:04:58,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:04:58,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:58,951 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] [2019-12-18 23:04:58,951 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:58,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:58,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1310665995, now seen corresponding path program 5 times [2019-12-18 23:04:58,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:58,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760148876] [2019-12-18 23:04:58,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:04:59,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760148876] [2019-12-18 23:04:59,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:59,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:04:59,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973271940] [2019-12-18 23:04:59,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:04:59,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:59,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:04:59,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:04:59,037 INFO L87 Difference]: Start difference. First operand 16518 states and 50740 transitions. Second operand 5 states. [2019-12-18 23:04:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:59,731 INFO L93 Difference]: Finished difference Result 25110 states and 74778 transitions. [2019-12-18 23:04:59,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:04:59,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-12-18 23:04:59,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:59,788 INFO L225 Difference]: With dead ends: 25110 [2019-12-18 23:04:59,788 INFO L226 Difference]: Without dead ends: 25026 [2019-12-18 23:04:59,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:04:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25026 states. [2019-12-18 23:05:00,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25026 to 19101. [2019-12-18 23:05:00,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19101 states. [2019-12-18 23:05:00,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19101 states to 19101 states and 58187 transitions. [2019-12-18 23:05:00,260 INFO L78 Accepts]: Start accepts. Automaton has 19101 states and 58187 transitions. Word has length 54 [2019-12-18 23:05:00,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:00,261 INFO L462 AbstractCegarLoop]: Abstraction has 19101 states and 58187 transitions. [2019-12-18 23:05:00,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:05:00,261 INFO L276 IsEmpty]: Start isEmpty. Operand 19101 states and 58187 transitions. [2019-12-18 23:05:00,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:05:00,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:00,281 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:05:00,281 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:00,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:00,281 INFO L82 PathProgramCache]: Analyzing trace with hash 454744557, now seen corresponding path program 6 times [2019-12-18 23:05:00,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:00,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121905081] [2019-12-18 23:05:00,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:00,371 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 23:05:00,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121905081] [2019-12-18 23:05:00,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:00,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:05:00,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428429704] [2019-12-18 23:05:00,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:05:00,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:00,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:05:00,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:05:00,373 INFO L87 Difference]: Start difference. First operand 19101 states and 58187 transitions. Second operand 7 states. [2019-12-18 23:05:01,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:01,656 INFO L93 Difference]: Finished difference Result 25883 states and 76771 transitions. [2019-12-18 23:05:01,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:05:01,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 23:05:01,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:01,691 INFO L225 Difference]: With dead ends: 25883 [2019-12-18 23:05:01,692 INFO L226 Difference]: Without dead ends: 25883 [2019-12-18 23:05:01,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:05:01,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25883 states. [2019-12-18 23:05:01,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25883 to 17612. [2019-12-18 23:05:01,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17612 states. [2019-12-18 23:05:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17612 states to 17612 states and 53903 transitions. [2019-12-18 23:05:02,023 INFO L78 Accepts]: Start accepts. Automaton has 17612 states and 53903 transitions. Word has length 54 [2019-12-18 23:05:02,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:02,023 INFO L462 AbstractCegarLoop]: Abstraction has 17612 states and 53903 transitions. [2019-12-18 23:05:02,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:05:02,024 INFO L276 IsEmpty]: Start isEmpty. Operand 17612 states and 53903 transitions. [2019-12-18 23:05:02,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:05:02,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:02,042 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] [2019-12-18 23:05:02,042 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:02,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:02,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1507078609, now seen corresponding path program 7 times [2019-12-18 23:05:02,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:02,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823807567] [2019-12-18 23:05:02,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:02,177 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 23:05:02,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823807567] [2019-12-18 23:05:02,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:02,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 23:05:02,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516975143] [2019-12-18 23:05:02,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:05:02,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:02,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:05:02,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:05:02,179 INFO L87 Difference]: Start difference. First operand 17612 states and 53903 transitions. Second operand 9 states. [2019-12-18 23:05:03,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:03,950 INFO L93 Difference]: Finished difference Result 26122 states and 77334 transitions. [2019-12-18 23:05:03,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 23:05:03,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 23:05:03,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:03,998 INFO L225 Difference]: With dead ends: 26122 [2019-12-18 23:05:03,998 INFO L226 Difference]: Without dead ends: 25996 [2019-12-18 23:05:03,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:05:04,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25996 states. [2019-12-18 23:05:04,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25996 to 18690. [2019-12-18 23:05:04,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18690 states. [2019-12-18 23:05:04,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18690 states to 18690 states and 56851 transitions. [2019-12-18 23:05:04,360 INFO L78 Accepts]: Start accepts. Automaton has 18690 states and 56851 transitions. Word has length 54 [2019-12-18 23:05:04,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:04,360 INFO L462 AbstractCegarLoop]: Abstraction has 18690 states and 56851 transitions. [2019-12-18 23:05:04,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:05:04,361 INFO L276 IsEmpty]: Start isEmpty. Operand 18690 states and 56851 transitions. [2019-12-18 23:05:04,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:05:04,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:04,380 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] [2019-12-18 23:05:04,380 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:04,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:04,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1799112527, now seen corresponding path program 8 times [2019-12-18 23:05:04,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:04,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623053284] [2019-12-18 23:05:04,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:04,515 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 23:05:04,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623053284] [2019-12-18 23:05:04,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:04,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 23:05:04,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103314128] [2019-12-18 23:05:04,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:05:04,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:04,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:05:04,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:05:04,517 INFO L87 Difference]: Start difference. First operand 18690 states and 56851 transitions. Second operand 9 states. [2019-12-18 23:05:05,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:05,722 INFO L93 Difference]: Finished difference Result 32212 states and 94517 transitions. [2019-12-18 23:05:05,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:05:05,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 23:05:05,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:05,767 INFO L225 Difference]: With dead ends: 32212 [2019-12-18 23:05:05,768 INFO L226 Difference]: Without dead ends: 31990 [2019-12-18 23:05:05,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:05:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31990 states. [2019-12-18 23:05:06,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31990 to 22271. [2019-12-18 23:05:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22271 states. [2019-12-18 23:05:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22271 states to 22271 states and 66596 transitions. [2019-12-18 23:05:06,405 INFO L78 Accepts]: Start accepts. Automaton has 22271 states and 66596 transitions. Word has length 54 [2019-12-18 23:05:06,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:06,405 INFO L462 AbstractCegarLoop]: Abstraction has 22271 states and 66596 transitions. [2019-12-18 23:05:06,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:05:06,406 INFO L276 IsEmpty]: Start isEmpty. Operand 22271 states and 66596 transitions. [2019-12-18 23:05:06,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:05:06,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:06,430 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] [2019-12-18 23:05:06,430 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:06,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:06,431 INFO L82 PathProgramCache]: Analyzing trace with hash 83564179, now seen corresponding path program 9 times [2019-12-18 23:05:06,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:06,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318486169] [2019-12-18 23:05:06,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:06,543 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 23:05:06,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318486169] [2019-12-18 23:05:06,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:06,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 23:05:06,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32393873] [2019-12-18 23:05:06,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 23:05:06,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:06,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 23:05:06,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 23:05:06,545 INFO L87 Difference]: Start difference. First operand 22271 states and 66596 transitions. Second operand 8 states. [2019-12-18 23:05:07,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:07,895 INFO L93 Difference]: Finished difference Result 43546 states and 128389 transitions. [2019-12-18 23:05:07,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:05:07,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-18 23:05:07,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:07,958 INFO L225 Difference]: With dead ends: 43546 [2019-12-18 23:05:07,958 INFO L226 Difference]: Without dead ends: 43322 [2019-12-18 23:05:07,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-12-18 23:05:08,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43322 states. [2019-12-18 23:05:08,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43322 to 22306. [2019-12-18 23:05:08,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22306 states. [2019-12-18 23:05:08,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22306 states to 22306 states and 66857 transitions. [2019-12-18 23:05:08,475 INFO L78 Accepts]: Start accepts. Automaton has 22306 states and 66857 transitions. Word has length 54 [2019-12-18 23:05:08,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:08,475 INFO L462 AbstractCegarLoop]: Abstraction has 22306 states and 66857 transitions. [2019-12-18 23:05:08,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 23:05:08,475 INFO L276 IsEmpty]: Start isEmpty. Operand 22306 states and 66857 transitions. [2019-12-18 23:05:08,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:05:08,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:08,502 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] [2019-12-18 23:05:08,502 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:08,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:08,503 INFO L82 PathProgramCache]: Analyzing trace with hash 367149589, now seen corresponding path program 10 times [2019-12-18 23:05:08,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:08,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874760705] [2019-12-18 23:05:08,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:08,563 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 23:05:08,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874760705] [2019-12-18 23:05:08,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:08,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:05:08,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9904744] [2019-12-18 23:05:08,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:05:08,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:08,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:05:08,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:05:08,565 INFO L87 Difference]: Start difference. First operand 22306 states and 66857 transitions. Second operand 3 states. [2019-12-18 23:05:08,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:08,642 INFO L93 Difference]: Finished difference Result 16924 states and 50316 transitions. [2019-12-18 23:05:08,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:05:08,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 23:05:08,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:08,667 INFO L225 Difference]: With dead ends: 16924 [2019-12-18 23:05:08,667 INFO L226 Difference]: Without dead ends: 16924 [2019-12-18 23:05:08,667 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 23:05:08,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16924 states. [2019-12-18 23:05:08,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16924 to 16458. [2019-12-18 23:05:08,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16458 states. [2019-12-18 23:05:08,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16458 states to 16458 states and 48904 transitions. [2019-12-18 23:05:08,923 INFO L78 Accepts]: Start accepts. Automaton has 16458 states and 48904 transitions. Word has length 54 [2019-12-18 23:05:08,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:08,923 INFO L462 AbstractCegarLoop]: Abstraction has 16458 states and 48904 transitions. [2019-12-18 23:05:08,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:05:08,924 INFO L276 IsEmpty]: Start isEmpty. Operand 16458 states and 48904 transitions. [2019-12-18 23:05:08,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 23:05:08,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:08,941 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] [2019-12-18 23:05:08,941 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:08,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:08,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1136893718, now seen corresponding path program 1 times [2019-12-18 23:05:08,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:08,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416129506] [2019-12-18 23:05:08,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:09,226 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 23:05:09,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416129506] [2019-12-18 23:05:09,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:09,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:05:09,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059138633] [2019-12-18 23:05:09,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 23:05:09,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:09,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 23:05:09,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:05:09,228 INFO L87 Difference]: Start difference. First operand 16458 states and 48904 transitions. Second operand 12 states. [2019-12-18 23:05:12,176 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2019-12-18 23:05:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:13,324 INFO L93 Difference]: Finished difference Result 41085 states and 118847 transitions. [2019-12-18 23:05:13,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 23:05:13,325 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-18 23:05:13,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:13,379 INFO L225 Difference]: With dead ends: 41085 [2019-12-18 23:05:13,379 INFO L226 Difference]: Without dead ends: 41085 [2019-12-18 23:05:13,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=449, Invalid=1807, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 23:05:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41085 states. [2019-12-18 23:05:13,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41085 to 17684. [2019-12-18 23:05:13,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17684 states. [2019-12-18 23:05:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17684 states to 17684 states and 53017 transitions. [2019-12-18 23:05:13,831 INFO L78 Accepts]: Start accepts. Automaton has 17684 states and 53017 transitions. Word has length 55 [2019-12-18 23:05:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:13,831 INFO L462 AbstractCegarLoop]: Abstraction has 17684 states and 53017 transitions. [2019-12-18 23:05:13,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 23:05:13,832 INFO L276 IsEmpty]: Start isEmpty. Operand 17684 states and 53017 transitions. [2019-12-18 23:05:13,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 23:05:13,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:13,851 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] [2019-12-18 23:05:13,851 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:13,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:13,852 INFO L82 PathProgramCache]: Analyzing trace with hash -344613730, now seen corresponding path program 2 times [2019-12-18 23:05:13,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:13,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876052400] [2019-12-18 23:05:13,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:14,055 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 23:05:14,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876052400] [2019-12-18 23:05:14,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:14,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 23:05:14,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189693077] [2019-12-18 23:05:14,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 23:05:14,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:14,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 23:05:14,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 23:05:14,057 INFO L87 Difference]: Start difference. First operand 17684 states and 53017 transitions. Second operand 10 states. [2019-12-18 23:05:16,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:16,140 INFO L93 Difference]: Finished difference Result 32943 states and 97046 transitions. [2019-12-18 23:05:16,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:05:16,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-18 23:05:16,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:16,186 INFO L225 Difference]: With dead ends: 32943 [2019-12-18 23:05:16,187 INFO L226 Difference]: Without dead ends: 32859 [2019-12-18 23:05:16,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-18 23:05:16,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32859 states. [2019-12-18 23:05:16,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32859 to 19836. [2019-12-18 23:05:16,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19836 states. [2019-12-18 23:05:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19836 states to 19836 states and 59626 transitions. [2019-12-18 23:05:16,594 INFO L78 Accepts]: Start accepts. Automaton has 19836 states and 59626 transitions. Word has length 55 [2019-12-18 23:05:16,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:16,594 INFO L462 AbstractCegarLoop]: Abstraction has 19836 states and 59626 transitions. [2019-12-18 23:05:16,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 23:05:16,594 INFO L276 IsEmpty]: Start isEmpty. Operand 19836 states and 59626 transitions. [2019-12-18 23:05:16,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 23:05:16,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:16,617 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] [2019-12-18 23:05:16,617 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:16,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:16,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1616219252, now seen corresponding path program 3 times [2019-12-18 23:05:16,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:16,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94615229] [2019-12-18 23:05:16,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:05:16,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94615229] [2019-12-18 23:05:16,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:16,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:05:16,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55826625] [2019-12-18 23:05:16,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:05:16,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:16,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:05:16,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:05:16,682 INFO L87 Difference]: Start difference. First operand 19836 states and 59626 transitions. Second operand 3 states. [2019-12-18 23:05:16,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:16,773 INFO L93 Difference]: Finished difference Result 19836 states and 59624 transitions. [2019-12-18 23:05:16,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:05:16,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 23:05:16,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:16,822 INFO L225 Difference]: With dead ends: 19836 [2019-12-18 23:05:16,822 INFO L226 Difference]: Without dead ends: 19836 [2019-12-18 23:05:16,823 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 23:05:16,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19836 states. [2019-12-18 23:05:17,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19836 to 15989. [2019-12-18 23:05:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15989 states. [2019-12-18 23:05:17,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15989 states to 15989 states and 48612 transitions. [2019-12-18 23:05:17,376 INFO L78 Accepts]: Start accepts. Automaton has 15989 states and 48612 transitions. Word has length 55 [2019-12-18 23:05:17,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:17,377 INFO L462 AbstractCegarLoop]: Abstraction has 15989 states and 48612 transitions. [2019-12-18 23:05:17,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:05:17,377 INFO L276 IsEmpty]: Start isEmpty. Operand 15989 states and 48612 transitions. [2019-12-18 23:05:17,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 23:05:17,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:17,411 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] [2019-12-18 23:05:17,412 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:17,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:17,412 INFO L82 PathProgramCache]: Analyzing trace with hash -51181904, now seen corresponding path program 1 times [2019-12-18 23:05:17,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:17,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145742106] [2019-12-18 23:05:17,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:05:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:05:17,605 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:05:17,605 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:05:17,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~x$r_buff1_thd1~0_43 0) (= v_~main$tmp_guard1~0_18 0) (= 0 v_~weak$$choice0~0_8) (= v_~y~0_18 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2513~0.base_19|) (= 0 v_~x$w_buff0_used~0_106) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t2513~0.base_19| 1)) (= 0 v_~x$w_buff1~0_26) (= 0 v_~x$r_buff0_thd0~0_21) (= 0 |v_ULTIMATE.start_main_~#t2513~0.offset_16|) (= |v_#NULL.offset_3| 0) (= 0 v_~__unbuffered_p0_EAX~0_18) (= v_~x~0_26 0) (= 0 v_~__unbuffered_cnt~0_21) (= v_~x$flush_delayed~0_13 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2513~0.base_19|)) (< 0 |v_#StackHeapBarrier_16|) (= v_~x$r_buff1_thd0~0_26 0) (= 0 v_~x$w_buff0~0_26) (= v_~x$w_buff1_used~0_67 0) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2513~0.base_19| 4)) (= 0 v_~x$read_delayed~0_6) (= 0 v_~weak$$choice2~0_33) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$r_buff0_thd1~0_71) (= 0 v_~x$r_buff0_thd3~0_20) (= v_~x$r_buff1_thd3~0_18 0) (= 0 |v_#NULL.base_3|) (= 0 v_~x$r_buff0_thd2~0_28) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~z~0_17 0) (= v_~x$r_buff1_thd2~0_20 0) (= v_~main$tmp_guard0~0_11 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2513~0.base_19| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2513~0.base_19|) |v_ULTIMATE.start_main_~#t2513~0.offset_16| 0)) |v_#memory_int_23|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_26, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, ULTIMATE.start_main_~#t2513~0.base=|v_ULTIMATE.start_main_~#t2513~0.base_19|, ULTIMATE.start_main_~#t2513~0.offset=|v_ULTIMATE.start_main_~#t2513~0.offset_16|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, ULTIMATE.start_main_~#t2515~0.base=|v_ULTIMATE.start_main_~#t2515~0.base_21|, #length=|v_#length_25|, ~y~0=v_~y~0_18, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_21, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ULTIMATE.start_main_~#t2514~0.offset=|v_ULTIMATE.start_main_~#t2514~0.offset_17|, ~x$w_buff1~0=v_~x$w_buff1~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_26, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t2515~0.offset=|v_ULTIMATE.start_main_~#t2515~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_17, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_26, ULTIMATE.start_main_~#t2514~0.base=|v_ULTIMATE.start_main_~#t2514~0.base_21|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t2513~0.base, ULTIMATE.start_main_~#t2513~0.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2515~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2514~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2515~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t2514~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 23:05:17,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L816-1-->L818: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2514~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t2514~0.offset_11|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2514~0.base_13|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2514~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t2514~0.base_13| 0)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2514~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2514~0.base_13|) |v_ULTIMATE.start_main_~#t2514~0.offset_11| 1))) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2514~0.base_13| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2514~0.offset=|v_ULTIMATE.start_main_~#t2514~0.offset_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2514~0.base=|v_ULTIMATE.start_main_~#t2514~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2514~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2514~0.base] because there is no mapped edge [2019-12-18 23:05:17,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L5-->L773: Formula: (and (= v_~x$r_buff1_thd3~0_11 v_~x$r_buff0_thd3~0_15) (= 1 v_~x$r_buff0_thd2~0_17) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_35) (= 1 v_~y~0_6) (= v_~x$r_buff1_thd2~0_11 v_~x$r_buff0_thd2~0_18) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_11, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 23:05:17,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L818-1-->L820: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2515~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2515~0.base_13|) |v_ULTIMATE.start_main_~#t2515~0.offset_11| 2)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2515~0.base_13|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2515~0.base_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2515~0.base_13| 4)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2515~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t2515~0.offset_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2515~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t2515~0.offset=|v_ULTIMATE.start_main_~#t2515~0.offset_11|, ULTIMATE.start_main_~#t2515~0.base=|v_ULTIMATE.start_main_~#t2515~0.base_13|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2515~0.offset, ULTIMATE.start_main_~#t2515~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 23:05:17,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L793-2-->L793-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In131638617 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In131638617 256) 0))) (or (and (= ~x~0_In131638617 |P2Thread1of1ForFork1_#t~ite32_Out131638617|) (or .cse0 .cse1)) (and (not .cse0) (= ~x$w_buff1~0_In131638617 |P2Thread1of1ForFork1_#t~ite32_Out131638617|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In131638617, ~x$w_buff1_used~0=~x$w_buff1_used~0_In131638617, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In131638617, ~x~0=~x~0_In131638617} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out131638617|, ~x$w_buff1~0=~x$w_buff1~0_In131638617, ~x$w_buff1_used~0=~x$w_buff1_used~0_In131638617, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In131638617, ~x~0=~x~0_In131638617} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 23:05:17,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L793-4-->L794: Formula: (= v_~x~0_19 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 23:05:17,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L794-->L794-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-871560536 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-871560536 256) 0))) (or (and (= ~x$w_buff0_used~0_In-871560536 |P2Thread1of1ForFork1_#t~ite34_Out-871560536|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite34_Out-871560536| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-871560536, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-871560536} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-871560536|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-871560536, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-871560536} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 23:05:17,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-->L795-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-2145899992 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-2145899992 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-2145899992 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-2145899992 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite35_Out-2145899992| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite35_Out-2145899992| ~x$w_buff1_used~0_In-2145899992) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2145899992, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2145899992, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2145899992, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2145899992} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-2145899992|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2145899992, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2145899992, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2145899992, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2145899992} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 23:05:17,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1165040031 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1165040031 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-1165040031|)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd3~0_In-1165040031 |P2Thread1of1ForFork1_#t~ite36_Out-1165040031|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1165040031, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1165040031} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1165040031|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1165040031, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1165040031} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 23:05:17,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1926087897 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In1926087897 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1926087897 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1926087897 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out1926087897|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite37_Out1926087897| ~x$r_buff1_thd3~0_In1926087897)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1926087897, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1926087897, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1926087897, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1926087897} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1926087897|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1926087897, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1926087897, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1926087897, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1926087897} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 23:05:17,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L797-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_13 |v_P2Thread1of1ForFork1_#t~ite37_8|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 23:05:17,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L739-->L739-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1623091272 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In-1623091272| |P0Thread1of1ForFork2_#t~ite11_Out-1623091272|) (= |P0Thread1of1ForFork2_#t~ite12_Out-1623091272| ~x$w_buff1~0_In-1623091272)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite11_Out-1623091272| ~x$w_buff1~0_In-1623091272) (= |P0Thread1of1ForFork2_#t~ite12_Out-1623091272| |P0Thread1of1ForFork2_#t~ite11_Out-1623091272|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1623091272 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-1623091272 256) 0) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1623091272 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1623091272 256)))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1623091272, ~x$w_buff1~0=~x$w_buff1~0_In-1623091272, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1623091272, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1623091272, ~weak$$choice2~0=~weak$$choice2~0_In-1623091272, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1623091272|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1623091272} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1623091272, ~x$w_buff1~0=~x$w_buff1~0_In-1623091272, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1623091272, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1623091272, ~weak$$choice2~0=~weak$$choice2~0_In-1623091272, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1623091272|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1623091272|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1623091272} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 23:05:17,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L740-->L740-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1469560877 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1469560877 256)))) (or (= (mod ~x$w_buff0_used~0_In1469560877 256) 0) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In1469560877 256))) (and (= 0 (mod ~x$r_buff1_thd1~0_In1469560877 256)) .cse0))) (= ~x$w_buff0_used~0_In1469560877 |P0Thread1of1ForFork2_#t~ite14_Out1469560877|) (= |P0Thread1of1ForFork2_#t~ite14_Out1469560877| |P0Thread1of1ForFork2_#t~ite15_Out1469560877|) .cse1) (and (= ~x$w_buff0_used~0_In1469560877 |P0Thread1of1ForFork2_#t~ite15_Out1469560877|) (= |P0Thread1of1ForFork2_#t~ite14_In1469560877| |P0Thread1of1ForFork2_#t~ite14_Out1469560877|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1469560877, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1469560877, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1469560877, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1469560877|, ~weak$$choice2~0=~weak$$choice2~0_In1469560877, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1469560877} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1469560877, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1469560877, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1469560877|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1469560877, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1469560877|, ~weak$$choice2~0=~weak$$choice2~0_In1469560877, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1469560877} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 23:05:17,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L742-->L743: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_50)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_21, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 23:05:17,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In393633429 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite24_Out393633429| |P0Thread1of1ForFork2_#t~ite23_Out393633429|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In393633429 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In393633429 256)) .cse0) (and .cse0 (= (mod ~x$r_buff1_thd1~0_In393633429 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In393633429 256)))) (= ~x$r_buff1_thd1~0_In393633429 |P0Thread1of1ForFork2_#t~ite23_Out393633429|) .cse1) (and (= ~x$r_buff1_thd1~0_In393633429 |P0Thread1of1ForFork2_#t~ite24_Out393633429|) (= |P0Thread1of1ForFork2_#t~ite23_In393633429| |P0Thread1of1ForFork2_#t~ite23_Out393633429|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In393633429, ~x$w_buff1_used~0=~x$w_buff1_used~0_In393633429, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In393633429, ~weak$$choice2~0=~weak$$choice2~0_In393633429, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In393633429|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In393633429} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In393633429, ~x$w_buff1_used~0=~x$w_buff1_used~0_In393633429, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In393633429, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out393633429|, ~weak$$choice2~0=~weak$$choice2~0_In393633429, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out393633429|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In393633429} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 23:05:17,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= v_~x$mem_tmp~0_5 v_~x~0_15) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 23:05:17,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-4095517 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-4095517 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-4095517| ~x$w_buff0_used~0_In-4095517) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-4095517| 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-4095517, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-4095517} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-4095517, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-4095517|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-4095517} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 23:05:17,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L775-->L775-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In1193104825 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1193104825 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1193104825 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1193104825 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out1193104825| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite29_Out1193104825| ~x$w_buff1_used~0_In1193104825) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1193104825, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1193104825, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1193104825, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1193104825} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1193104825, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1193104825, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1193104825, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1193104825|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1193104825} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 23:05:17,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L776-->L777: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In606255388 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In606255388 256)))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out606255388) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In606255388 ~x$r_buff0_thd2~0_Out606255388) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In606255388, ~x$w_buff0_used~0=~x$w_buff0_used~0_In606255388} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out606255388|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out606255388, ~x$w_buff0_used~0=~x$w_buff0_used~0_In606255388} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 23:05:17,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In850362448 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In850362448 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In850362448 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In850362448 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In850362448 |P1Thread1of1ForFork0_#t~ite31_Out850362448|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out850362448|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In850362448, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In850362448, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In850362448, ~x$w_buff0_used~0=~x$w_buff0_used~0_In850362448} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out850362448|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In850362448, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In850362448, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In850362448, ~x$w_buff0_used~0=~x$w_buff0_used~0_In850362448} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 23:05:17,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L777-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= v_~x$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 23:05:17,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= 3 v_~__unbuffered_cnt~0_11)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 23:05:17,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L826-2-->L826-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite42_Out642110563| |ULTIMATE.start_main_#t~ite41_Out642110563|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In642110563 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In642110563 256) 0))) (or (and (= ~x$w_buff1~0_In642110563 |ULTIMATE.start_main_#t~ite41_Out642110563|) .cse0 (not .cse1) (not .cse2)) (and .cse0 (= ~x~0_In642110563 |ULTIMATE.start_main_#t~ite41_Out642110563|) (or .cse1 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In642110563, ~x$w_buff1_used~0=~x$w_buff1_used~0_In642110563, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In642110563, ~x~0=~x~0_In642110563} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out642110563|, ~x$w_buff1~0=~x$w_buff1~0_In642110563, ~x$w_buff1_used~0=~x$w_buff1_used~0_In642110563, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In642110563, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out642110563|, ~x~0=~x~0_In642110563} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 23:05:17,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In682031452 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In682031452 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out682031452| ~x$w_buff0_used~0_In682031452)) (and (= |ULTIMATE.start_main_#t~ite43_Out682031452| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In682031452, ~x$w_buff0_used~0=~x$w_buff0_used~0_In682031452} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In682031452, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out682031452|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In682031452} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 23:05:17,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L828-->L828-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In2119514464 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In2119514464 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In2119514464 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In2119514464 256)))) (or (and (= ~x$w_buff1_used~0_In2119514464 |ULTIMATE.start_main_#t~ite44_Out2119514464|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite44_Out2119514464| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2119514464, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2119514464, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2119514464, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2119514464} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2119514464, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2119514464, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2119514464, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2119514464|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2119514464} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 23:05:17,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In2128435325 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In2128435325 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out2128435325| ~x$r_buff0_thd0~0_In2128435325) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out2128435325|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2128435325, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2128435325} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2128435325, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2128435325|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2128435325} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 23:05:17,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L830-->L830-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In-1554763370 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1554763370 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1554763370 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1554763370 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1554763370| ~x$r_buff1_thd0~0_In-1554763370) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite46_Out-1554763370| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1554763370, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1554763370, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1554763370, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1554763370} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1554763370, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1554763370|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1554763370, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1554763370, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1554763370} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 23:05:17,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x$r_buff1_thd0~0_19 |v_ULTIMATE.start_main_#t~ite46_13|) (= 2 v_~z~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_10 0) (= v_~y~0_10 2) (= 0 v_~__unbuffered_p0_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~z~0=v_~z~0_9, ~y~0=v_~y~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~z~0=v_~z~0_9, ~y~0=v_~y~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 23:05:17,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:05:17 BasicIcfg [2019-12-18 23:05:17,967 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:05:17,974 INFO L168 Benchmark]: Toolchain (without parser) took 81736.21 ms. Allocated memory was 146.3 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 101.1 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-18 23:05:17,977 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 23:05:17,977 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.59 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 100.7 MB in the beginning and 155.6 MB in the end (delta: -54.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 23:05:17,978 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.77 ms. Allocated memory is still 202.9 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 23:05:17,978 INFO L168 Benchmark]: Boogie Preprocessor took 37.80 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 150.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 23:05:17,979 INFO L168 Benchmark]: RCFGBuilder took 838.40 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 104.4 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2019-12-18 23:05:17,980 INFO L168 Benchmark]: TraceAbstraction took 80016.07 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 103.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 23:05:17,986 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.55 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 760.59 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 100.7 MB in the beginning and 155.6 MB in the end (delta: -54.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.77 ms. Allocated memory is still 202.9 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.80 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 150.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 838.40 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 104.4 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 80016.07 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 103.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 162 ProgramPointsBefore, 85 ProgramPointsAfterwards, 193 TransitionsBefore, 94 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 6364 VarBasedMoverChecksPositive, 203 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75290 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t2513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L820] FCALL, FORK 0 pthread_create(&t2515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L787] 3 y = 2 [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L728] 1 z = 2 [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L738] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L740] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L741] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L775] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 79.4s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 32.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5332 SDtfs, 5873 SDslu, 15030 SDs, 0 SdLazy, 11744 SolverSat, 399 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 63 SyntacticMatches, 21 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120798occurred 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: 25.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 218783 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1084 NumberOfCodeBlocks, 1084 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1003 ConstructedInterpolants, 0 QuantifiedInterpolants, 194122 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...