/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-98196c323137eee61a7c1131837b356358d783d4-98196c3 [2021-06-16 15:43:29,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-16 15:43:29,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-16 15:43:29,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-16 15:43:29,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-16 15:43:29,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-16 15:43:29,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-16 15:43:29,824 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-16 15:43:29,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-16 15:43:29,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-16 15:43:29,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-16 15:43:29,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-16 15:43:29,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-16 15:43:29,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-16 15:43:29,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-16 15:43:29,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-16 15:43:29,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-16 15:43:29,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-16 15:43:29,843 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-16 15:43:29,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-16 15:43:29,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-16 15:43:29,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-16 15:43:29,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-16 15:43:29,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-16 15:43:29,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-16 15:43:29,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-16 15:43:29,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-16 15:43:29,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-16 15:43:29,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-16 15:43:29,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-16 15:43:29,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-16 15:43:29,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-16 15:43:29,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-16 15:43:29,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-16 15:43:29,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-16 15:43:29,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-16 15:43:29,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-16 15:43:29,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-16 15:43:29,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-16 15:43:29,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-16 15:43:29,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-16 15:43:29,861 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-NoLbe-Delay.epf [2021-06-16 15:43:29,891 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-16 15:43:29,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-16 15:43:29,892 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-16 15:43:29,892 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-16 15:43:29,893 INFO L138 SettingsManager]: * Use SBE=true [2021-06-16 15:43:29,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-16 15:43:29,893 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-16 15:43:29,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-16 15:43:29,893 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-16 15:43:29,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-16 15:43:29,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-16 15:43:29,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-16 15:43:29,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-16 15:43:29,893 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-16 15:43:29,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-16 15:43:29,894 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-16 15:43:29,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-16 15:43:29,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-16 15:43:29,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-16 15:43:29,894 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-16 15:43:29,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-16 15:43:29,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-16 15:43:29,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-16 15:43:29,894 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-16 15:43:29,895 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-16 15:43:29,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-16 15:43:29,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-16 15:43:29,895 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-16 15:43:29,895 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-16 15:43:29,895 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-06-16 15:43:29,895 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-16 15:43:30,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-16 15:43:30,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-16 15:43:30,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-16 15:43:30,144 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-16 15:43:30,145 INFO L275 PluginConnector]: CDTParser initialized [2021-06-16 15:43:30,145 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2021-06-16 15:43:30,196 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64ca633a4/b232b867ca6147409a95bc91997f95f4/FLAG117f133b6 [2021-06-16 15:43:30,585 INFO L306 CDTParser]: Found 1 translation units. [2021-06-16 15:43:30,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2021-06-16 15:43:30,599 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64ca633a4/b232b867ca6147409a95bc91997f95f4/FLAG117f133b6 [2021-06-16 15:43:30,613 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64ca633a4/b232b867ca6147409a95bc91997f95f4 [2021-06-16 15:43:30,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-16 15:43:30,617 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-16 15:43:30,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-16 15:43:30,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-16 15:43:30,621 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-16 15:43:30,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.06 03:43:30" (1/1) ... [2021-06-16 15:43:30,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@346a2a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:43:30, skipping insertion in model container [2021-06-16 15:43:30,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.06 03:43:30" (1/1) ... [2021-06-16 15:43:30,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-16 15:43:30,667 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-16 15:43:30,803 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i[948,961] [2021-06-16 15:43:30,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-16 15:43:30,992 INFO L203 MainTranslator]: Completed pre-run [2021-06-16 15:43:30,999 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i[948,961] [2021-06-16 15:43:31,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-16 15:43:31,064 INFO L208 MainTranslator]: Completed translation [2021-06-16 15:43:31,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:43:31 WrapperNode [2021-06-16 15:43:31,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-16 15:43:31,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-16 15:43:31,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-16 15:43:31,069 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-16 15:43:31,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:43:31" (1/1) ... [2021-06-16 15:43:31,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:43:31" (1/1) ... [2021-06-16 15:43:31,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-16 15:43:31,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-16 15:43:31,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-16 15:43:31,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-16 15:43:31,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:43:31" (1/1) ... [2021-06-16 15:43:31,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:43:31" (1/1) ... [2021-06-16 15:43:31,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:43:31" (1/1) ... [2021-06-16 15:43:31,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:43:31" (1/1) ... [2021-06-16 15:43:31,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:43:31" (1/1) ... [2021-06-16 15:43:31,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:43:31" (1/1) ... [2021-06-16 15:43:31,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:43:31" (1/1) ... [2021-06-16 15:43:31,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-16 15:43:31,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-16 15:43:31,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-16 15:43:31,162 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-16 15:43:31,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:43:31" (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 [2021-06-16 15:43:31,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-16 15:43:31,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-16 15:43:31,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-16 15:43:31,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-16 15:43:31,223 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-16 15:43:31,223 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-16 15:43:31,223 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-16 15:43:31,223 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-16 15:43:31,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-16 15:43:31,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-16 15:43:31,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-16 15:43:31,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-16 15:43:31,225 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-16 15:43:32,593 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-16 15:43:32,593 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-16 15:43:32,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.06 03:43:32 BoogieIcfgContainer [2021-06-16 15:43:32,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-16 15:43:32,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-16 15:43:32,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-16 15:43:32,598 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-16 15:43:32,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.06 03:43:30" (1/3) ... [2021-06-16 15:43:32,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac278f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.06 03:43:32, skipping insertion in model container [2021-06-16 15:43:32,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:43:31" (2/3) ... [2021-06-16 15:43:32,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac278f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.06 03:43:32, skipping insertion in model container [2021-06-16 15:43:32,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.06 03:43:32" (3/3) ... [2021-06-16 15:43:32,599 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi000_pso.opt.i [2021-06-16 15:43:32,603 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-16 15:43:32,603 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-16 15:43:32,603 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-16 15:43:32,603 INFO L470 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-16 15:43:32,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,622 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,622 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,622 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,622 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,625 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,625 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,625 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,625 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,626 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,626 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,626 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,626 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,632 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,632 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,633 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,633 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,633 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,633 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,633 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,633 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,633 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,633 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,633 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,633 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,634 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,634 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,634 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,634 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,634 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,634 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,636 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,636 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,636 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,640 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,640 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:43:32,641 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-16 15:43:32,654 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-16 15:43:32,672 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 15:43:32,672 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 15:43:32,672 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 15:43:32,672 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 15:43:32,672 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 15:43:32,672 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 15:43:32,672 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 15:43:32,673 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1======== [2021-06-16 15:43:33,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 2293 states, 2051 states have (on average 2.1555338859093127) internal successors, (4421), 2292 states have internal predecessors, (4421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:33,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-16 15:43:33,143 INFO L301 ceAbstractionStarter]: Result for error location P1 was SAFE (1/3) [2021-06-16 15:43:33,144 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-16 15:43:33,146 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 15:43:33,146 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 15:43:33,146 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 15:43:33,146 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 15:43:33,146 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 15:43:33,146 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 15:43:33,146 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 15:43:33,146 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1Thread1of1ForFork0======== [2021-06-16 15:43:33,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 2293 states, 2051 states have (on average 2.1555338859093127) internal successors, (4421), 2292 states have internal predecessors, (4421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:33,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-06-16 15:43:33,576 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:43:33,577 INFO L472 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] [2021-06-16 15:43:33,577 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:43:33,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:43:33,582 INFO L82 PathProgramCache]: Analyzing trace with hash 581779579, now seen corresponding path program 1 times [2021-06-16 15:43:33,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:43:33,591 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578965127] [2021-06-16 15:43:33,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:43:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:43:33,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:33,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:43:33,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:33,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:43:33,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:43:33,835 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:43:33,835 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578965127] [2021-06-16 15:43:33,836 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578965127] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:43:33,836 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:43:33,836 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-16 15:43:33,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120265135] [2021-06-16 15:43:33,839 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-16 15:43:33,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:43:33,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-16 15:43:33,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 15:43:33,853 INFO L87 Difference]: Start difference. First operand has 2293 states, 2051 states have (on average 2.1555338859093127) internal successors, (4421), 2292 states have internal predecessors, (4421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:43:33,918 INFO L93 Difference]: Finished difference Result 2013 states and 3700 transitions. [2021-06-16 15:43:33,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 15:43:33,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-06-16 15:43:33,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:43:33,923 INFO L225 Difference]: With dead ends: 2013 [2021-06-16 15:43:33,923 INFO L226 Difference]: Without dead ends: 0 [2021-06-16 15:43:33,925 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 15:43:33,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-16 15:43:33,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-16 15:43:33,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:33,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-16 15:43:33,939 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2021-06-16 15:43:33,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:43:33,939 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-16 15:43:33,940 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:33,940 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-16 15:43:33,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-16 15:43:33,940 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-16 15:43:33,940 INFO L301 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork0 was SAFE (2/3) [2021-06-16 15:43:33,941 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-16 15:43:33,944 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 15:43:33,944 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 15:43:33,945 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 15:43:33,945 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 15:43:33,945 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 15:43:33,945 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 15:43:33,945 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 15:43:33,945 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-16 15:43:34,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 2293 states, 2051 states have (on average 2.1555338859093127) internal successors, (4421), 2292 states have internal predecessors, (4421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:34,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-06-16 15:43:34,322 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:43:34,323 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-16 15:43:34,323 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:43:34,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:43:34,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1072851851, now seen corresponding path program 1 times [2021-06-16 15:43:34,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:43:34,325 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072100841] [2021-06-16 15:43:34,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:43:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:43:34,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:34,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:43:34,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:34,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:43:34,458 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:43:34,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:43:34,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:34,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:43:34,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:34,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:43:34,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:34,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:43:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:43:34,496 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:43:34,496 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072100841] [2021-06-16 15:43:34,496 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072100841] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:43:34,496 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:43:34,496 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-16 15:43:34,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462837180] [2021-06-16 15:43:34,497 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-16 15:43:34,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:43:34,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-16 15:43:34,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-16 15:43:34,501 INFO L87 Difference]: Start difference. First operand has 2293 states, 2051 states have (on average 2.1555338859093127) internal successors, (4421), 2292 states have internal predecessors, (4421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:34,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:43:34,606 INFO L93 Difference]: Finished difference Result 2701 states and 5071 transitions. [2021-06-16 15:43:34,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 15:43:34,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-06-16 15:43:34,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:43:34,619 INFO L225 Difference]: With dead ends: 2701 [2021-06-16 15:43:34,619 INFO L226 Difference]: Without dead ends: 723 [2021-06-16 15:43:34,620 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 77.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-16 15:43:34,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2021-06-16 15:43:34,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2021-06-16 15:43:34,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 715 states have (on average 1.8713286713286714) internal successors, (1338), 722 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1338 transitions. [2021-06-16 15:43:34,671 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1338 transitions. Word has length 58 [2021-06-16 15:43:34,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:43:34,671 INFO L482 AbstractCegarLoop]: Abstraction has 723 states and 1338 transitions. [2021-06-16 15:43:34,671 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1338 transitions. [2021-06-16 15:43:34,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-16 15:43:34,675 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:43:34,675 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-16 15:43:34,675 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-16 15:43:34,675 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:43:34,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:43:34,675 INFO L82 PathProgramCache]: Analyzing trace with hash -398301352, now seen corresponding path program 1 times [2021-06-16 15:43:34,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:43:34,676 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962839921] [2021-06-16 15:43:34,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:43:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:43:34,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:34,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:43:34,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:34,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:43:34,827 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:43:34,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:43:34,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:34,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:43:34,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:34,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:43:34,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:34,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:43:34,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:43:34,861 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:43:34,861 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962839921] [2021-06-16 15:43:34,862 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962839921] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:43:34,862 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:43:34,862 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-16 15:43:34,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477605015] [2021-06-16 15:43:34,863 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-16 15:43:34,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:43:34,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-16 15:43:34,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-16 15:43:34,864 INFO L87 Difference]: Start difference. First operand 723 states and 1338 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:34,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:43:34,952 INFO L93 Difference]: Finished difference Result 803 states and 1502 transitions. [2021-06-16 15:43:34,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 15:43:34,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-06-16 15:43:34,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:43:34,956 INFO L225 Difference]: With dead ends: 803 [2021-06-16 15:43:34,956 INFO L226 Difference]: Without dead ends: 675 [2021-06-16 15:43:34,957 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 78.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-16 15:43:34,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2021-06-16 15:43:34,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675. [2021-06-16 15:43:34,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 667 states have (on average 1.808095952023988) internal successors, (1206), 674 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:34,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1206 transitions. [2021-06-16 15:43:34,967 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 1206 transitions. Word has length 62 [2021-06-16 15:43:34,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:43:34,968 INFO L482 AbstractCegarLoop]: Abstraction has 675 states and 1206 transitions. [2021-06-16 15:43:34,968 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:34,968 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1206 transitions. [2021-06-16 15:43:34,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-16 15:43:34,969 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:43:34,969 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-16 15:43:34,969 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-16 15:43:34,969 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:43:34,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:43:34,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1444688164, now seen corresponding path program 1 times [2021-06-16 15:43:34,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:43:34,970 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650820179] [2021-06-16 15:43:34,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:43:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:43:35,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:43:35,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:43:35,065 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:43:35,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:43:35,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:43:35,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:43:35,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:43:35,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:43:35,094 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:43:35,094 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650820179] [2021-06-16 15:43:35,094 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650820179] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:43:35,094 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:43:35,094 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-16 15:43:35,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956082719] [2021-06-16 15:43:35,095 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-16 15:43:35,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:43:35,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-16 15:43:35,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-16 15:43:35,095 INFO L87 Difference]: Start difference. First operand 675 states and 1206 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:35,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:43:35,200 INFO L93 Difference]: Finished difference Result 1013 states and 1917 transitions. [2021-06-16 15:43:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 15:43:35,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-16 15:43:35,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:43:35,204 INFO L225 Difference]: With dead ends: 1013 [2021-06-16 15:43:35,204 INFO L226 Difference]: Without dead ends: 419 [2021-06-16 15:43:35,206 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 88.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-16 15:43:35,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-06-16 15:43:35,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2021-06-16 15:43:35,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 413 states have (on average 1.9152542372881356) internal successors, (791), 418 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:35,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 791 transitions. [2021-06-16 15:43:35,213 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 791 transitions. Word has length 63 [2021-06-16 15:43:35,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:43:35,214 INFO L482 AbstractCegarLoop]: Abstraction has 419 states and 791 transitions. [2021-06-16 15:43:35,214 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:35,214 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 791 transitions. [2021-06-16 15:43:35,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-16 15:43:35,216 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:43:35,216 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-16 15:43:35,216 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-16 15:43:35,216 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:43:35,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:43:35,217 INFO L82 PathProgramCache]: Analyzing trace with hash -196093261, now seen corresponding path program 1 times [2021-06-16 15:43:35,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:43:35,217 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884078167] [2021-06-16 15:43:35,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:43:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:43:35,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:43:35,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:43:35,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:43:35,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-16 15:43:35,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-16 15:43:35,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-16 15:43:35,353 INFO L142 QuantifierPusher]: treesize reduction 11, result has 80.4 percent of original size [2021-06-16 15:43:35,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-06-16 15:43:35,373 INFO L142 QuantifierPusher]: treesize reduction 11, result has 80.4 percent of original size [2021-06-16 15:43:35,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-06-16 15:43:35,393 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:43:35,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:43:35,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:43:35,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:43:35,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:43:35,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:43:35,436 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:43:35,436 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884078167] [2021-06-16 15:43:35,436 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884078167] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:43:35,436 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:43:35,438 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-16 15:43:35,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891363399] [2021-06-16 15:43:35,440 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-16 15:43:35,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:43:35,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-16 15:43:35,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-06-16 15:43:35,442 INFO L87 Difference]: Start difference. First operand 419 states and 791 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:43:35,637 INFO L93 Difference]: Finished difference Result 485 states and 936 transitions. [2021-06-16 15:43:35,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-16 15:43:35,638 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-16 15:43:35,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:43:35,640 INFO L225 Difference]: With dead ends: 485 [2021-06-16 15:43:35,640 INFO L226 Difference]: Without dead ends: 413 [2021-06-16 15:43:35,640 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 193.2ms TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2021-06-16 15:43:35,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-06-16 15:43:35,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2021-06-16 15:43:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 407 states have (on average 1.8992628992628993) internal successors, (773), 412 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 773 transitions. [2021-06-16 15:43:35,647 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 773 transitions. Word has length 65 [2021-06-16 15:43:35,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:43:35,647 INFO L482 AbstractCegarLoop]: Abstraction has 413 states and 773 transitions. [2021-06-16 15:43:35,647 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:35,647 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 773 transitions. [2021-06-16 15:43:35,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-16 15:43:35,648 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:43:35,648 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-16 15:43:35,648 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-16 15:43:35,648 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:43:35,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:43:35,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1416299042, now seen corresponding path program 1 times [2021-06-16 15:43:35,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:43:35,649 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569219807] [2021-06-16 15:43:35,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:43:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:43:35,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:43:35,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:43:35,699 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-16 15:43:35,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-16 15:43:35,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:43:35,720 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-16 15:43:35,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:43:35,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:43:35,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:43:35,727 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:43:35,727 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569219807] [2021-06-16 15:43:35,727 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569219807] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:43:35,727 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:43:35,728 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-16 15:43:35,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901467326] [2021-06-16 15:43:35,728 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-16 15:43:35,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:43:35,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-16 15:43:35,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-16 15:43:35,728 INFO L87 Difference]: Start difference. First operand 413 states and 773 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:35,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:43:35,794 INFO L93 Difference]: Finished difference Result 419 states and 729 transitions. [2021-06-16 15:43:35,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 15:43:35,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-06-16 15:43:35,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:43:35,796 INFO L225 Difference]: With dead ends: 419 [2021-06-16 15:43:35,796 INFO L226 Difference]: Without dead ends: 275 [2021-06-16 15:43:35,798 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 64.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-16 15:43:35,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-06-16 15:43:35,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2021-06-16 15:43:35,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 269 states have (on average 1.7657992565055762) internal successors, (475), 274 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 475 transitions. [2021-06-16 15:43:35,802 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 475 transitions. Word has length 66 [2021-06-16 15:43:35,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:43:35,802 INFO L482 AbstractCegarLoop]: Abstraction has 275 states and 475 transitions. [2021-06-16 15:43:35,802 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 475 transitions. [2021-06-16 15:43:35,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-06-16 15:43:35,803 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:43:35,803 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-16 15:43:35,803 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-16 15:43:35,803 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:43:35,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:43:35,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1986628588, now seen corresponding path program 1 times [2021-06-16 15:43:35,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:43:35,805 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290144005] [2021-06-16 15:43:35,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:43:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:43:35,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:43:35,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:43:35,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:43:35,854 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-16 15:43:35,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-16 15:43:35,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:43:35,872 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-16 15:43:35,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:43:35,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:35,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:43:35,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:43:35,880 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:43:35,880 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290144005] [2021-06-16 15:43:35,880 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290144005] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:43:35,880 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:43:35,880 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-16 15:43:35,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506226255] [2021-06-16 15:43:35,881 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-16 15:43:35,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:43:35,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-16 15:43:35,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-16 15:43:35,881 INFO L87 Difference]: Start difference. First operand 275 states and 475 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:35,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:43:35,963 INFO L93 Difference]: Finished difference Result 197 states and 294 transitions. [2021-06-16 15:43:35,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-16 15:43:35,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-06-16 15:43:35,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:43:35,964 INFO L225 Difference]: With dead ends: 197 [2021-06-16 15:43:35,965 INFO L226 Difference]: Without dead ends: 122 [2021-06-16 15:43:35,965 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 74.2ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-16 15:43:35,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-06-16 15:43:35,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-06-16 15:43:35,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 119 states have (on average 1.361344537815126) internal successors, (162), 121 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 162 transitions. [2021-06-16 15:43:35,967 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 162 transitions. Word has length 67 [2021-06-16 15:43:35,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:43:35,967 INFO L482 AbstractCegarLoop]: Abstraction has 122 states and 162 transitions. [2021-06-16 15:43:35,967 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:35,967 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 162 transitions. [2021-06-16 15:43:35,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-16 15:43:35,967 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:43:35,967 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-16 15:43:35,968 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-16 15:43:35,968 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:43:35,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:43:35,968 INFO L82 PathProgramCache]: Analyzing trace with hash 371789035, now seen corresponding path program 1 times [2021-06-16 15:43:35,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:43:35,968 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733960776] [2021-06-16 15:43:35,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:43:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:43:36,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:36,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:43:36,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:36,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:43:36,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:36,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:43:36,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:36,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-16 15:43:36,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:36,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-16 15:43:36,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:36,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:43:36,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:36,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-16 15:43:36,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:36,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-16 15:43:36,106 INFO L142 QuantifierPusher]: treesize reduction 31, result has 75.2 percent of original size [2021-06-16 15:43:36,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-06-16 15:43:36,131 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:43:36,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:43:36,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:36,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:43:36,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:36,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:43:36,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:43:36,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:43:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:43:36,162 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:43:36,162 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733960776] [2021-06-16 15:43:36,162 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733960776] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:43:36,162 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:43:36,162 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-16 15:43:36,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890090744] [2021-06-16 15:43:36,162 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-16 15:43:36,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:43:36,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-16 15:43:36,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-06-16 15:43:36,163 INFO L87 Difference]: Start difference. First operand 122 states and 162 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:36,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:43:36,294 INFO L93 Difference]: Finished difference Result 160 states and 219 transitions. [2021-06-16 15:43:36,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-16 15:43:36,294 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-06-16 15:43:36,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:43:36,295 INFO L225 Difference]: With dead ends: 160 [2021-06-16 15:43:36,295 INFO L226 Difference]: Without dead ends: 121 [2021-06-16 15:43:36,295 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 146.3ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-06-16 15:43:36,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-06-16 15:43:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-06-16 15:43:36,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 118 states have (on average 1.3559322033898304) internal successors, (160), 120 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:36,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 160 transitions. [2021-06-16 15:43:36,298 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 160 transitions. Word has length 70 [2021-06-16 15:43:36,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:43:36,298 INFO L482 AbstractCegarLoop]: Abstraction has 121 states and 160 transitions. [2021-06-16 15:43:36,298 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:43:36,298 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 160 transitions. [2021-06-16 15:43:36,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-16 15:43:36,298 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:43:36,298 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-16 15:43:36,298 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-16 15:43:36,299 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:43:36,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:43:36,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1344342901, now seen corresponding path program 2 times [2021-06-16 15:43:36,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:43:36,299 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528211701] [2021-06-16 15:43:36,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:43:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-16 15:43:36,330 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-16 15:43:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-16 15:43:36,361 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-16 15:43:36,384 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-16 15:43:36,385 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-16 15:43:36,385 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-16 15:43:36,385 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3) [2021-06-16 15:43:36,386 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-16 15:43:36,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.06 03:43:36 BasicIcfg [2021-06-16 15:43:36,450 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-16 15:43:36,450 INFO L168 Benchmark]: Toolchain (without parser) took 5833.86 ms. Allocated memory was 183.5 MB in the beginning and 345.0 MB in the end (delta: 161.5 MB). Free memory was 146.4 MB in the beginning and 190.1 MB in the end (delta: -43.7 MB). Peak memory consumption was 118.9 MB. Max. memory is 8.0 GB. [2021-06-16 15:43:36,451 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 183.5 MB. Free memory was 164.4 MB in the beginning and 164.3 MB in the end (delta: 124.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-06-16 15:43:36,451 INFO L168 Benchmark]: CACSL2BoogieTranslator took 445.80 ms. Allocated memory is still 183.5 MB. Free memory was 146.2 MB in the beginning and 141.6 MB in the end (delta: 4.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-06-16 15:43:36,451 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.63 ms. Allocated memory is still 183.5 MB. Free memory was 141.6 MB in the beginning and 138.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-06-16 15:43:36,451 INFO L168 Benchmark]: Boogie Preprocessor took 49.66 ms. Allocated memory is still 183.5 MB. Free memory was 138.6 MB in the beginning and 137.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-06-16 15:43:36,451 INFO L168 Benchmark]: RCFGBuilder took 1433.14 ms. Allocated memory was 183.5 MB in the beginning and 247.5 MB in the end (delta: 64.0 MB). Free memory was 136.5 MB in the beginning and 131.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 70.3 MB. Max. memory is 8.0 GB. [2021-06-16 15:43:36,452 INFO L168 Benchmark]: TraceAbstraction took 3854.06 ms. Allocated memory was 247.5 MB in the beginning and 345.0 MB in the end (delta: 97.5 MB). Free memory was 130.6 MB in the beginning and 190.1 MB in the end (delta: -59.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 8.0 GB. [2021-06-16 15:43:36,460 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43 ms. Allocated memory is still 183.5 MB. Free memory was 164.4 MB in the beginning and 164.3 MB in the end (delta: 124.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 445.80 ms. Allocated memory is still 183.5 MB. Free memory was 146.2 MB in the beginning and 141.6 MB in the end (delta: 4.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 42.63 ms. Allocated memory is still 183.5 MB. Free memory was 141.6 MB in the beginning and 138.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 49.66 ms. Allocated memory is still 183.5 MB. Free memory was 138.6 MB in the beginning and 137.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1433.14 ms. Allocated memory was 183.5 MB in the beginning and 247.5 MB in the end (delta: 64.0 MB). Free memory was 136.5 MB in the beginning and 131.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 70.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 3854.06 ms. Allocated memory was 247.5 MB in the beginning and 345.0 MB in the end (delta: 97.5 MB). Free memory was 130.6 MB in the beginning and 190.1 MB in the end (delta: -59.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5569, positive: 4916, positive conditional: 4916, positive unconditional: 0, negative: 653, negative conditional: 653, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5219, positive: 4916, positive conditional: 0, positive unconditional: 4916, negative: 303, negative conditional: 0, negative unconditional: 303, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 634, positive: 605, positive conditional: 0, positive unconditional: 605, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 634, positive: 604, positive conditional: 0, positive unconditional: 604, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 30, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 272, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 271, negative conditional: 0, negative unconditional: 271, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5219, positive: 4311, positive conditional: 0, positive unconditional: 4311, negative: 274, negative conditional: 0, negative unconditional: 274, unknown: 634, unknown conditional: 0, unknown unconditional: 634] , Statistics on independence cache: Total cache size (in pairs): 634, Positive cache size: 605, Positive conditional cache size: 0, Positive unconditional cache size: 605, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Independence queries for same thread: 350 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5569, positive: 4916, positive conditional: 4916, positive unconditional: 0, negative: 653, negative conditional: 653, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5219, positive: 4916, positive conditional: 0, positive unconditional: 4916, negative: 303, negative conditional: 0, negative unconditional: 303, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 634, positive: 605, positive conditional: 0, positive unconditional: 605, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 634, positive: 604, positive conditional: 0, positive unconditional: 604, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 30, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 312, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 311, negative conditional: 0, negative unconditional: 311, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5219, positive: 4311, positive conditional: 0, positive unconditional: 4311, negative: 274, negative conditional: 0, negative unconditional: 274, unknown: 634, unknown conditional: 0, unknown unconditional: 634] , Statistics on independence cache: Total cache size (in pairs): 634, Positive cache size: 605, Positive conditional cache size: 0, Positive unconditional cache size: 605, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Independence queries for same thread: 350 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5569, positive: 4916, positive conditional: 4916, positive unconditional: 0, negative: 653, negative conditional: 653, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5219, positive: 4916, positive conditional: 0, positive unconditional: 4916, negative: 303, negative conditional: 0, negative unconditional: 303, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 634, positive: 605, positive conditional: 0, positive unconditional: 605, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 634, positive: 604, positive conditional: 0, positive unconditional: 604, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 30, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 265, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 263, negative conditional: 0, negative unconditional: 263, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5219, positive: 4311, positive conditional: 0, positive unconditional: 4311, negative: 274, negative conditional: 0, negative unconditional: 274, unknown: 634, unknown conditional: 0, unknown unconditional: 634] , Statistics on independence cache: Total cache size (in pairs): 634, Positive cache size: 605, Positive conditional cache size: 0, Positive unconditional cache size: 605, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Independence queries for same thread: 350 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L712] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L716] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L718] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L719] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L720] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L721] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L722] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0] [L723] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0] [L724] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L725] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L726] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L727] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L728] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L729] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L730] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L732] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L733] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L734] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L800] 0 pthread_t t1591; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L801] FCALL, FORK 0 pthread_create(&t1591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L802] 0 pthread_t t1592; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L803] FCALL, FORK 0 pthread_create(&t1592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 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) [L778] 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) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 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 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 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) [L809] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L809] 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) [L809] 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) [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 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 [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L813] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L820] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L821] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L821] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L822] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L822] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L823] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L823] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L824] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L824] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L825] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L826] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1 with 1 thread instances CFG has 5 procedures, 109 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 473.1ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 22.2ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 447.7ms, PartialOrderReductionTime: 440.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2293occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 109 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 794.4ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 5.4ms, AutomataDifference: 85.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 424.7ms, PartialOrderReductionTime: 423.3ms, HoareTripleCheckerStatistics: 79 SDtfs, 27 SDslu, 54 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2293occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 6.1ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 8.4ms SsaConstructionTime, 59.8ms SatisfiabilityAnalysisTime, 116.9ms InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 45 ConstructedInterpolants, 0 QuantifiedInterpolants, 87 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 109 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2440.5ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 16.4ms, AutomataDifference: 811.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 368.6ms, PartialOrderReductionTime: 363.2ms, HoareTripleCheckerStatistics: 662 SDtfs, 905 SDslu, 2149 SDs, 0 SdLazy, 290 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 234.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 722.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2293occurred in iteration=0, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 81.1ms AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 32.3ms SsaConstructionTime, 275.1ms SatisfiabilityAnalysisTime, 713.6ms InterpolantComputationTime, 521 NumberOfCodeBlocks, 521 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 444 ConstructedInterpolants, 0 QuantifiedInterpolants, 2098 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...