/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.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 14:32:44,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 14:32:44,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 14:32:44,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 14:32:44,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 14:32:44,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 14:32:44,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 14:32:44,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 14:32:44,908 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 14:32:44,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 14:32:44,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 14:32:44,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 14:32:44,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 14:32:44,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 14:32:44,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 14:32:44,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 14:32:44,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 14:32:44,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 14:32:44,914 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 14:32:44,915 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 14:32:44,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 14:32:44,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 14:32:44,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 14:32:44,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 14:32:44,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 14:32:44,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 14:32:44,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 14:32:44,920 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 14:32:44,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 14:32:44,921 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 14:32:44,922 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 14:32:44,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 14:32:44,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 14:32:44,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 14:32:44,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 14:32:44,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 14:32:44,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 14:32:44,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 14:32:44,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 14:32:44,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 14:32:44,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 14:32:44,927 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.epf [2022-03-01 14:32:44,940 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 14:32:44,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 14:32:44,940 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 14:32:44,941 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 14:32:44,941 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 14:32:44,941 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 14:32:44,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 14:32:44,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 14:32:44,942 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 14:32:44,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 14:32:44,942 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 14:32:44,942 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 14:32:44,942 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 14:32:44,942 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 14:32:44,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 14:32:44,943 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 14:32:44,943 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 14:32:44,943 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 14:32:44,943 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 14:32:44,943 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 14:32:44,943 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 14:32:44,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 14:32:44,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 14:32:44,944 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 14:32:44,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 14:32:44,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 14:32:44,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 14:32:44,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 14:32:44,944 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 14:32:44,944 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 14:32:44,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 14:32:44,945 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 14:32:44,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 14:32:44,945 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 [2022-03-01 14:32:45,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 14:32:45,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 14:32:45,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 14:32:45,143 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-01 14:32:45,143 INFO L275 PluginConnector]: CDTParser initialized [2022-03-01 14:32:45,144 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-1.i [2022-03-01 14:32:45,198 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189451221/7d2d4da2e1744a2a856713bbea14378c/FLAGab0a347aa [2022-03-01 14:32:45,584 INFO L306 CDTParser]: Found 1 translation units. [2022-03-01 14:32:45,584 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i [2022-03-01 14:32:45,605 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189451221/7d2d4da2e1744a2a856713bbea14378c/FLAGab0a347aa [2022-03-01 14:32:45,931 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189451221/7d2d4da2e1744a2a856713bbea14378c [2022-03-01 14:32:45,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 14:32:45,934 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-01 14:32:45,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-01 14:32:45,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-01 14:32:45,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-01 14:32:45,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 02:32:45" (1/1) ... [2022-03-01 14:32:45,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b9b59de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:32:45, skipping insertion in model container [2022-03-01 14:32:45,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 02:32:45" (1/1) ... [2022-03-01 14:32:45,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-01 14:32:45,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-01 14:32:46,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i[41520,41533] [2022-03-01 14:32:46,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 14:32:46,285 INFO L203 MainTranslator]: Completed pre-run [2022-03-01 14:32:46,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i[41520,41533] [2022-03-01 14:32:46,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 14:32:46,371 INFO L208 MainTranslator]: Completed translation [2022-03-01 14:32:46,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:32:46 WrapperNode [2022-03-01 14:32:46,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-01 14:32:46,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 14:32:46,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 14:32:46,373 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 14:32:46,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:32:46" (1/1) ... [2022-03-01 14:32:46,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:32:46" (1/1) ... [2022-03-01 14:32:46,405 INFO L137 Inliner]: procedures = 277, calls = 45, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 154 [2022-03-01 14:32:46,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 14:32:46,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 14:32:46,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 14:32:46,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 14:32:46,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:32:46" (1/1) ... [2022-03-01 14:32:46,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:32:46" (1/1) ... [2022-03-01 14:32:46,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:32:46" (1/1) ... [2022-03-01 14:32:46,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:32:46" (1/1) ... [2022-03-01 14:32:46,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:32:46" (1/1) ... [2022-03-01 14:32:46,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:32:46" (1/1) ... [2022-03-01 14:32:46,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:32:46" (1/1) ... [2022-03-01 14:32:46,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 14:32:46,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 14:32:46,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 14:32:46,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 14:32:46,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:32:46" (1/1) ... [2022-03-01 14:32:46,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 14:32:46,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 14:32:46,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-01 14:32:46,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-01 14:32:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-03-01 14:32:46,485 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-03-01 14:32:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-03-01 14:32:46,485 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-03-01 14:32:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-01 14:32:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-01 14:32:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-01 14:32:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-01 14:32:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-01 14:32:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-01 14:32:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-01 14:32:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 14:32:46,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 14:32:46,486 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-01 14:32:46,563 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 14:32:46,580 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 14:32:46,832 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 14:32:46,838 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 14:32:46,838 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-01 14:32:46,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 02:32:46 BoogieIcfgContainer [2022-03-01 14:32:46,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 14:32:46,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 14:32:46,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 14:32:46,847 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 14:32:46,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.03 02:32:45" (1/3) ... [2022-03-01 14:32:46,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4665d0cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 02:32:46, skipping insertion in model container [2022-03-01 14:32:46,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:32:46" (2/3) ... [2022-03-01 14:32:46,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4665d0cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 02:32:46, skipping insertion in model container [2022-03-01 14:32:46,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 02:32:46" (3/3) ... [2022-03-01 14:32:46,850 INFO L111 eAbstractionObserver]: Analyzing ICFG stack-1.i [2022-03-01 14:32:46,855 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 14:32:46,856 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 14:32:46,856 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-01 14:32:46,856 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 14:32:46,915 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,916 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,916 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,916 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,916 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,916 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,916 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,916 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,916 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,917 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,918 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,918 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,918 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,918 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,919 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,919 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,919 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,920 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,920 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,920 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,920 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,920 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,921 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,921 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,923 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,923 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,923 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,923 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,924 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,924 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,924 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,924 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,925 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,925 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,927 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,927 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,927 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,927 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,927 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,927 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,927 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,928 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,928 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,928 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,928 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,929 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,930 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,930 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,930 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,931 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,931 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,931 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,931 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,931 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,932 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,932 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,932 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,932 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,932 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,932 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,932 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,933 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,933 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,933 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,933 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,933 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,933 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,934 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,934 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,934 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,934 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,934 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,934 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,934 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,934 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,935 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,935 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,935 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,935 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,935 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,935 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,935 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,935 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,936 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,936 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,937 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,938 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,941 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,942 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,942 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,943 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,944 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,945 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,945 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,945 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,945 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,945 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,946 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,946 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,946 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,946 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,946 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,946 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,946 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,946 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,947 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,947 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,947 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,947 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,949 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,949 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,949 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,949 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,949 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,949 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,949 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,950 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,950 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,950 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,950 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,950 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,950 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,950 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,950 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,950 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,950 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,951 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,951 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,951 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,951 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,951 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,954 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,954 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,954 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,954 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,954 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,954 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,954 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,955 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,955 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,955 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,955 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,955 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,956 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,956 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,956 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,956 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,956 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,956 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,956 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,957 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,957 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,958 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,958 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,958 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,959 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,959 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,959 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,959 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,959 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,959 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,959 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,959 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,961 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,961 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,961 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,961 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,961 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,961 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,961 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,962 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,962 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,962 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,962 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,962 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,962 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,962 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,962 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,962 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,963 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,963 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,963 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,963 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,963 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,963 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,963 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,963 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,963 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,964 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,964 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,964 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,964 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,964 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,966 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,967 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,967 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,967 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,967 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,967 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,967 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,967 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,968 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,970 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,971 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,971 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,971 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,971 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,972 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,972 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,972 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,972 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,972 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,972 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,973 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,974 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,974 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,974 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,974 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,974 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,979 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,979 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,979 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,979 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,980 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,980 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,980 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,980 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,980 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,980 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,980 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,983 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,983 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,983 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,983 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,983 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,983 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,983 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,984 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,984 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,984 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,984 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,984 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,984 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,984 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,984 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,984 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,984 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,984 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,984 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,984 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,985 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,985 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,985 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,986 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,987 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,987 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,987 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,987 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,987 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,987 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,987 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,987 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,987 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,987 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,987 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,987 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,987 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,988 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,988 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,988 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,988 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:32:46,990 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-01 14:32:47,033 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 14:32:47,037 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-01 14:32:47,037 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-03-01 14:32:47,053 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173 places, 176 transitions, 368 flow [2022-03-01 14:32:47,418 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 11855 states, 11852 states have (on average 2.8596861289233884) internal successors, (33893), 11854 states have internal predecessors, (33893), 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) [2022-03-01 14:32:47,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 11855 states, 11852 states have (on average 2.8596861289233884) internal successors, (33893), 11854 states have internal predecessors, (33893), 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) [2022-03-01 14:32:47,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-03-01 14:32:47,483 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:32:47,483 INFO L514 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] [2022-03-01 14:32:47,484 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-01 14:32:47,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:32:47,490 INFO L85 PathProgramCache]: Analyzing trace with hash -211887483, now seen corresponding path program 1 times [2022-03-01 14:32:47,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:32:47,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964177705] [2022-03-01 14:32:47,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:32:47,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:32:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:32:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:32:47,810 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:32:47,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964177705] [2022-03-01 14:32:47,811 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964177705] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:32:47,811 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:32:47,811 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 14:32:47,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539718255] [2022-03-01 14:32:47,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:32:47,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 14:32:47,817 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:32:47,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 14:32:47,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 14:32:47,867 INFO L87 Difference]: Start difference. First operand has 11855 states, 11852 states have (on average 2.8596861289233884) internal successors, (33893), 11854 states have internal predecessors, (33893), 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, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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) [2022-03-01 14:32:48,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:32:48,072 INFO L93 Difference]: Finished difference Result 15687 states and 43137 transitions. [2022-03-01 14:32:48,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 14:32:48,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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 [2022-03-01 14:32:48,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:32:48,171 INFO L225 Difference]: With dead ends: 15687 [2022-03-01 14:32:48,171 INFO L226 Difference]: Without dead ends: 15411 [2022-03-01 14:32:48,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 14:32:48,176 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 80 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 14:32:48,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 276 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 14:32:48,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15411 states. [2022-03-01 14:32:48,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15411 to 14887. [2022-03-01 14:32:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14887 states, 14883 states have (on average 2.7668480817039574) internal successors, (41179), 14886 states have internal predecessors, (41179), 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) [2022-03-01 14:32:48,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14887 states to 14887 states and 41179 transitions. [2022-03-01 14:32:48,798 INFO L78 Accepts]: Start accepts. Automaton has 14887 states and 41179 transitions. Word has length 65 [2022-03-01 14:32:48,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:32:48,799 INFO L470 AbstractCegarLoop]: Abstraction has 14887 states and 41179 transitions. [2022-03-01 14:32:48,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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) [2022-03-01 14:32:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 14887 states and 41179 transitions. [2022-03-01 14:32:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-03-01 14:32:48,808 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:32:48,809 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:32:48,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 14:32:48,809 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-01 14:32:48,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:32:48,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2060462298, now seen corresponding path program 1 times [2022-03-01 14:32:48,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:32:48,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122976660] [2022-03-01 14:32:48,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:32:48,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:32:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:32:48,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:32:48,946 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:32:48,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122976660] [2022-03-01 14:32:48,946 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122976660] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:32:48,947 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:32:48,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-01 14:32:48,947 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697759031] [2022-03-01 14:32:48,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:32:48,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-01 14:32:48,951 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:32:48,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-01 14:32:48,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-01 14:32:48,952 INFO L87 Difference]: Start difference. First operand 14887 states and 41179 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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) [2022-03-01 14:32:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:32:49,233 INFO L93 Difference]: Finished difference Result 22347 states and 61714 transitions. [2022-03-01 14:32:49,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-01 14:32:49,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2022-03-01 14:32:49,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:32:49,317 INFO L225 Difference]: With dead ends: 22347 [2022-03-01 14:32:49,317 INFO L226 Difference]: Without dead ends: 22347 [2022-03-01 14:32:49,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-01 14:32:49,319 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 146 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 14:32:49,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 642 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 14:32:49,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22347 states. [2022-03-01 14:32:49,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22347 to 16015. [2022-03-01 14:32:49,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16015 states, 16011 states have (on average 2.7665355068390483) internal successors, (44295), 16014 states have internal predecessors, (44295), 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) [2022-03-01 14:32:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16015 states to 16015 states and 44295 transitions. [2022-03-01 14:32:49,915 INFO L78 Accepts]: Start accepts. Automaton has 16015 states and 44295 transitions. Word has length 81 [2022-03-01 14:32:49,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:32:49,917 INFO L470 AbstractCegarLoop]: Abstraction has 16015 states and 44295 transitions. [2022-03-01 14:32:49,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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) [2022-03-01 14:32:49,918 INFO L276 IsEmpty]: Start isEmpty. Operand 16015 states and 44295 transitions. [2022-03-01 14:32:49,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-01 14:32:49,928 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:32:49,928 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:32:49,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 14:32:49,929 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-01 14:32:49,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:32:49,929 INFO L85 PathProgramCache]: Analyzing trace with hash 235148469, now seen corresponding path program 1 times [2022-03-01 14:32:49,929 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:32:49,929 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417788662] [2022-03-01 14:32:49,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:32:49,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:32:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:32:49,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:32:49,999 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:32:49,999 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417788662] [2022-03-01 14:32:49,999 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417788662] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:32:49,999 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:32:49,999 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 14:32:50,000 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843017420] [2022-03-01 14:32:50,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:32:50,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 14:32:50,000 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:32:50,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 14:32:50,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 14:32:50,001 INFO L87 Difference]: Start difference. First operand 16015 states and 44295 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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) [2022-03-01 14:32:50,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:32:50,226 INFO L93 Difference]: Finished difference Result 24457 states and 67330 transitions. [2022-03-01 14:32:50,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 14:32:50,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 99 [2022-03-01 14:32:50,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:32:50,295 INFO L225 Difference]: With dead ends: 24457 [2022-03-01 14:32:50,295 INFO L226 Difference]: Without dead ends: 24457 [2022-03-01 14:32:50,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 14:32:50,297 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 103 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 14:32:50,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 377 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 14:32:50,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24457 states. [2022-03-01 14:32:50,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24457 to 22373. [2022-03-01 14:32:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22373 states, 22369 states have (on average 2.7695471411328176) internal successors, (61952), 22372 states have internal predecessors, (61952), 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) [2022-03-01 14:32:50,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22373 states to 22373 states and 61952 transitions. [2022-03-01 14:32:50,836 INFO L78 Accepts]: Start accepts. Automaton has 22373 states and 61952 transitions. Word has length 99 [2022-03-01 14:32:50,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:32:50,836 INFO L470 AbstractCegarLoop]: Abstraction has 22373 states and 61952 transitions. [2022-03-01 14:32:50,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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) [2022-03-01 14:32:50,836 INFO L276 IsEmpty]: Start isEmpty. Operand 22373 states and 61952 transitions. [2022-03-01 14:32:50,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-03-01 14:32:50,847 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:32:50,848 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:32:50,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-01 14:32:50,848 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-01 14:32:50,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:32:50,848 INFO L85 PathProgramCache]: Analyzing trace with hash 172146190, now seen corresponding path program 1 times [2022-03-01 14:32:50,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:32:50,849 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806966928] [2022-03-01 14:32:50,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:32:50,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:32:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:32:50,918 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:32:50,918 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:32:50,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806966928] [2022-03-01 14:32:50,918 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806966928] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 14:32:50,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810079509] [2022-03-01 14:32:50,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:32:50,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 14:32:50,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 14:32:50,920 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 14:32:50,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-01 14:32:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:32:51,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-01 14:32:51,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 14:32:51,386 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:32:51,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 14:32:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:32:51,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810079509] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 14:32:51,584 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 14:32:51,584 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-01 14:32:51,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248700863] [2022-03-01 14:32:51,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 14:32:51,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 14:32:51,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:32:51,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 14:32:51,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-01 14:32:51,587 INFO L87 Difference]: Start difference. First operand 22373 states and 61952 transitions. Second operand has 10 states, 10 states have (on average 26.2) internal successors, (262), 10 states have internal predecessors, (262), 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) [2022-03-01 14:32:51,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:32:51,990 INFO L93 Difference]: Finished difference Result 43271 states and 119230 transitions. [2022-03-01 14:32:51,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 14:32:51,990 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 26.2) internal successors, (262), 10 states have internal predecessors, (262), 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 110 [2022-03-01 14:32:51,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:32:52,168 INFO L225 Difference]: With dead ends: 43271 [2022-03-01 14:32:52,168 INFO L226 Difference]: Without dead ends: 43119 [2022-03-01 14:32:52,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2022-03-01 14:32:52,169 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 979 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:32:52,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [979 Valid, 1276 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:32:52,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43119 states. [2022-03-01 14:32:52,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43119 to 35319. [2022-03-01 14:32:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35319 states, 35315 states have (on average 2.7909103780263345) internal successors, (98561), 35318 states have internal predecessors, (98561), 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) [2022-03-01 14:32:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35319 states to 35319 states and 98561 transitions. [2022-03-01 14:32:53,085 INFO L78 Accepts]: Start accepts. Automaton has 35319 states and 98561 transitions. Word has length 110 [2022-03-01 14:32:53,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:32:53,086 INFO L470 AbstractCegarLoop]: Abstraction has 35319 states and 98561 transitions. [2022-03-01 14:32:53,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.2) internal successors, (262), 10 states have internal predecessors, (262), 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) [2022-03-01 14:32:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 35319 states and 98561 transitions. [2022-03-01 14:32:53,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-03-01 14:32:53,101 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:32:53,102 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:32:53,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-01 14:32:53,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 14:32:53,320 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-01 14:32:53,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:32:53,320 INFO L85 PathProgramCache]: Analyzing trace with hash -154454040, now seen corresponding path program 1 times [2022-03-01 14:32:53,320 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:32:53,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885521514] [2022-03-01 14:32:53,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:32:53,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:32:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:32:53,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:32:53,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:32:53,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885521514] [2022-03-01 14:32:53,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885521514] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:32:53,363 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:32:53,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 14:32:53,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364457313] [2022-03-01 14:32:53,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:32:53,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 14:32:53,363 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:32:53,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 14:32:53,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 14:32:53,364 INFO L87 Difference]: Start difference. First operand 35319 states and 98561 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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) [2022-03-01 14:32:53,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:32:53,611 INFO L93 Difference]: Finished difference Result 11357 states and 29882 transitions. [2022-03-01 14:32:53,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 14:32:53,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 113 [2022-03-01 14:32:53,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:32:53,644 INFO L225 Difference]: With dead ends: 11357 [2022-03-01 14:32:53,644 INFO L226 Difference]: Without dead ends: 11319 [2022-03-01 14:32:53,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 14:32:53,645 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 78 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 14:32:53,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 238 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 14:32:53,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11319 states. [2022-03-01 14:32:53,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11319 to 9775. [2022-03-01 14:32:53,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9775 states, 9771 states have (on average 2.607102650701054) internal successors, (25474), 9774 states have internal predecessors, (25474), 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) [2022-03-01 14:32:53,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9775 states to 9775 states and 25474 transitions. [2022-03-01 14:32:53,836 INFO L78 Accepts]: Start accepts. Automaton has 9775 states and 25474 transitions. Word has length 113 [2022-03-01 14:32:53,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:32:53,837 INFO L470 AbstractCegarLoop]: Abstraction has 9775 states and 25474 transitions. [2022-03-01 14:32:53,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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) [2022-03-01 14:32:53,837 INFO L276 IsEmpty]: Start isEmpty. Operand 9775 states and 25474 transitions. [2022-03-01 14:32:53,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-03-01 14:32:53,846 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:32:53,846 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:32:53,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-01 14:32:53,846 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-01 14:32:53,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:32:53,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1480826348, now seen corresponding path program 1 times [2022-03-01 14:32:53,847 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:32:53,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560044089] [2022-03-01 14:32:53,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:32:53,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:32:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:32:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:32:54,577 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:32:54,577 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560044089] [2022-03-01 14:32:54,577 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560044089] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:32:54,577 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:32:54,577 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-03-01 14:32:54,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927143512] [2022-03-01 14:32:54,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:32:54,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-01 14:32:54,578 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:32:54,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-01 14:32:54,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2022-03-01 14:32:54,578 INFO L87 Difference]: Start difference. First operand 9775 states and 25474 transitions. Second operand has 24 states, 24 states have (on average 5.083333333333333) internal successors, (122), 24 states have internal predecessors, (122), 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) [2022-03-01 14:32:56,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:32:56,884 INFO L93 Difference]: Finished difference Result 24261 states and 63753 transitions. [2022-03-01 14:32:56,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-01 14:32:56,884 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.083333333333333) internal successors, (122), 24 states have internal predecessors, (122), 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 122 [2022-03-01 14:32:56,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:32:56,921 INFO L225 Difference]: With dead ends: 24261 [2022-03-01 14:32:56,922 INFO L226 Difference]: Without dead ends: 23418 [2022-03-01 14:32:56,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=557, Invalid=2865, Unknown=0, NotChecked=0, Total=3422 [2022-03-01 14:32:56,923 INFO L933 BasicCegarLoop]: 590 mSDtfsCounter, 1242 mSDsluCounter, 7540 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 7914 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 14:32:56,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1242 Valid, 7914 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-01 14:32:56,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23418 states. [2022-03-01 14:32:57,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23418 to 12562. [2022-03-01 14:32:57,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12562 states, 12558 states have (on average 2.6335403726708075) internal successors, (33072), 12561 states have internal predecessors, (33072), 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) [2022-03-01 14:32:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12562 states to 12562 states and 33072 transitions. [2022-03-01 14:32:57,199 INFO L78 Accepts]: Start accepts. Automaton has 12562 states and 33072 transitions. Word has length 122 [2022-03-01 14:32:57,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:32:57,199 INFO L470 AbstractCegarLoop]: Abstraction has 12562 states and 33072 transitions. [2022-03-01 14:32:57,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.083333333333333) internal successors, (122), 24 states have internal predecessors, (122), 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) [2022-03-01 14:32:57,200 INFO L276 IsEmpty]: Start isEmpty. Operand 12562 states and 33072 transitions. [2022-03-01 14:32:57,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-03-01 14:32:57,210 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:32:57,210 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:32:57,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-01 14:32:57,210 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-01 14:32:57,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:32:57,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1207381166, now seen corresponding path program 2 times [2022-03-01 14:32:57,211 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:32:57,211 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318570211] [2022-03-01 14:32:57,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:32:57,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:32:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:32:57,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:32:57,938 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:32:57,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318570211] [2022-03-01 14:32:57,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318570211] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:32:57,939 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:32:57,939 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 14:32:57,939 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258032981] [2022-03-01 14:32:57,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:32:57,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 14:32:57,939 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:32:57,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 14:32:57,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2022-03-01 14:32:57,940 INFO L87 Difference]: Start difference. First operand 12562 states and 33072 transitions. Second operand has 29 states, 29 states have (on average 4.206896551724138) internal successors, (122), 29 states have internal predecessors, (122), 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) [2022-03-01 14:33:00,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:33:00,005 INFO L93 Difference]: Finished difference Result 27373 states and 72376 transitions. [2022-03-01 14:33:00,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-01 14:33:00,005 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.206896551724138) internal successors, (122), 29 states have internal predecessors, (122), 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 122 [2022-03-01 14:33:00,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:33:00,058 INFO L225 Difference]: With dead ends: 27373 [2022-03-01 14:33:00,058 INFO L226 Difference]: Without dead ends: 26740 [2022-03-01 14:33:00,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=423, Invalid=2547, Unknown=0, NotChecked=0, Total=2970 [2022-03-01 14:33:00,059 INFO L933 BasicCegarLoop]: 431 mSDtfsCounter, 1071 mSDsluCounter, 7590 mSDsCounter, 0 mSdLazyCounter, 2256 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 7769 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 14:33:00,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1071 Valid, 7769 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2256 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-01 14:33:00,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26740 states. [2022-03-01 14:33:00,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26740 to 13596. [2022-03-01 14:33:00,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13596 states, 13592 states have (on average 2.635741612713361) internal successors, (35825), 13595 states have internal predecessors, (35825), 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) [2022-03-01 14:33:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13596 states to 13596 states and 35825 transitions. [2022-03-01 14:33:00,391 INFO L78 Accepts]: Start accepts. Automaton has 13596 states and 35825 transitions. Word has length 122 [2022-03-01 14:33:00,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:33:00,391 INFO L470 AbstractCegarLoop]: Abstraction has 13596 states and 35825 transitions. [2022-03-01 14:33:00,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.206896551724138) internal successors, (122), 29 states have internal predecessors, (122), 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) [2022-03-01 14:33:00,392 INFO L276 IsEmpty]: Start isEmpty. Operand 13596 states and 35825 transitions. [2022-03-01 14:33:00,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-03-01 14:33:00,403 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:33:00,403 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:33:00,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-01 14:33:00,404 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-01 14:33:00,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:33:00,404 INFO L85 PathProgramCache]: Analyzing trace with hash -959008282, now seen corresponding path program 3 times [2022-03-01 14:33:00,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:33:00,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062886185] [2022-03-01 14:33:00,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:33:00,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:33:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:33:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:33:01,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:33:01,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062886185] [2022-03-01 14:33:01,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062886185] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:33:01,261 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:33:01,261 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-03-01 14:33:01,261 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258899331] [2022-03-01 14:33:01,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:33:01,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-01 14:33:01,261 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:33:01,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-01 14:33:01,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2022-03-01 14:33:01,262 INFO L87 Difference]: Start difference. First operand 13596 states and 35825 transitions. Second operand has 30 states, 30 states have (on average 4.066666666666666) internal successors, (122), 30 states have internal predecessors, (122), 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) [2022-03-01 14:33:04,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:33:04,374 INFO L93 Difference]: Finished difference Result 29271 states and 77079 transitions. [2022-03-01 14:33:04,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-01 14:33:04,374 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.066666666666666) internal successors, (122), 30 states have internal predecessors, (122), 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 122 [2022-03-01 14:33:04,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:33:04,432 INFO L225 Difference]: With dead ends: 29271 [2022-03-01 14:33:04,432 INFO L226 Difference]: Without dead ends: 28458 [2022-03-01 14:33:04,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=684, Invalid=3872, Unknown=0, NotChecked=0, Total=4556 [2022-03-01 14:33:04,434 INFO L933 BasicCegarLoop]: 584 mSDtfsCounter, 1580 mSDsluCounter, 9348 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 9646 SdHoareTripleChecker+Invalid, 2520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-01 14:33:04,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1580 Valid, 9646 Invalid, 2520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2485 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-01 14:33:04,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28458 states. [2022-03-01 14:33:04,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28458 to 12315. [2022-03-01 14:33:04,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12315 states, 12311 states have (on average 2.630899195841118) internal successors, (32389), 12314 states have internal predecessors, (32389), 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) [2022-03-01 14:33:04,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12315 states to 12315 states and 32389 transitions. [2022-03-01 14:33:04,721 INFO L78 Accepts]: Start accepts. Automaton has 12315 states and 32389 transitions. Word has length 122 [2022-03-01 14:33:04,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:33:04,722 INFO L470 AbstractCegarLoop]: Abstraction has 12315 states and 32389 transitions. [2022-03-01 14:33:04,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.066666666666666) internal successors, (122), 30 states have internal predecessors, (122), 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) [2022-03-01 14:33:04,722 INFO L276 IsEmpty]: Start isEmpty. Operand 12315 states and 32389 transitions. [2022-03-01 14:33:04,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-03-01 14:33:04,735 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:33:04,736 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:33:04,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-01 14:33:04,736 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-01 14:33:04,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:33:04,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1813794985, now seen corresponding path program 1 times [2022-03-01 14:33:04,736 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:33:04,736 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426231803] [2022-03-01 14:33:04,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:33:04,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:33:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:33:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:33:05,365 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:33:05,365 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426231803] [2022-03-01 14:33:05,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426231803] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 14:33:05,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164247974] [2022-03-01 14:33:05,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:33:05,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 14:33:05,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 14:33:05,367 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 14:33:05,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-01 14:33:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:33:05,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-01 14:33:05,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 14:33:06,779 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-01 14:33:07,712 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2022-03-01 14:33:07,918 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:33:07,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 14:33:08,454 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-03-01 14:33:09,045 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-01 14:33:09,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164247974] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 14:33:09,046 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 14:33:09,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [26, 26] total 68 [2022-03-01 14:33:09,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178949448] [2022-03-01 14:33:09,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:33:09,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-01 14:33:09,046 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:33:09,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-01 14:33:09,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=4315, Unknown=0, NotChecked=0, Total=4556 [2022-03-01 14:33:09,048 INFO L87 Difference]: Start difference. First operand 12315 states and 32389 transitions. Second operand has 22 states, 22 states have (on average 7.181818181818182) internal successors, (158), 22 states have internal predecessors, (158), 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) [2022-03-01 14:33:13,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:33:13,480 INFO L93 Difference]: Finished difference Result 32068 states and 84922 transitions. [2022-03-01 14:33:13,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-01 14:33:13,480 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.181818181818182) internal successors, (158), 22 states have internal predecessors, (158), 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 164 [2022-03-01 14:33:13,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:33:13,581 INFO L225 Difference]: With dead ends: 32068 [2022-03-01 14:33:13,582 INFO L226 Difference]: Without dead ends: 32068 [2022-03-01 14:33:13,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4654 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1532, Invalid=14980, Unknown=0, NotChecked=0, Total=16512 [2022-03-01 14:33:13,587 INFO L933 BasicCegarLoop]: 666 mSDtfsCounter, 2051 mSDsluCounter, 8776 mSDsCounter, 0 mSdLazyCounter, 2336 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2051 SdHoareTripleChecker+Valid, 9207 SdHoareTripleChecker+Invalid, 2380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-01 14:33:13,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2051 Valid, 9207 Invalid, 2380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2336 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-01 14:33:13,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32068 states. [2022-03-01 14:33:13,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32068 to 15273. [2022-03-01 14:33:13,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15273 states, 15269 states have (on average 2.6509922064313316) internal successors, (40478), 15272 states have internal predecessors, (40478), 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) [2022-03-01 14:33:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15273 states to 15273 states and 40478 transitions. [2022-03-01 14:33:13,942 INFO L78 Accepts]: Start accepts. Automaton has 15273 states and 40478 transitions. Word has length 164 [2022-03-01 14:33:13,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:33:13,943 INFO L470 AbstractCegarLoop]: Abstraction has 15273 states and 40478 transitions. [2022-03-01 14:33:13,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.181818181818182) internal successors, (158), 22 states have internal predecessors, (158), 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) [2022-03-01 14:33:13,943 INFO L276 IsEmpty]: Start isEmpty. Operand 15273 states and 40478 transitions. [2022-03-01 14:33:13,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-03-01 14:33:13,958 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:33:13,958 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:33:13,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-01 14:33:14,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-03-01 14:33:14,169 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-01 14:33:14,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:33:14,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1474217689, now seen corresponding path program 2 times [2022-03-01 14:33:14,170 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:33:14,170 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134650178] [2022-03-01 14:33:14,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:33:14,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:33:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:33:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:33:15,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:33:15,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134650178] [2022-03-01 14:33:15,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134650178] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 14:33:15,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021565123] [2022-03-01 14:33:15,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 14:33:15,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 14:33:15,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 14:33:15,077 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 14:33:15,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-01 14:33:15,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 14:33:15,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 14:33:15,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-01 14:33:15,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 14:33:15,278 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-01 14:33:15,279 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-01 14:33:15,291 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 14:33:15,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 14:33:16,140 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-01 14:33:16,205 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2022-03-01 14:33:16,991 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-03-01 14:33:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-01 14:33:17,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 14:33:17,730 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_244 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_244) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-03-01 14:33:17,755 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 14:33:17,755 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-03-01 14:33:17,761 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 14:33:17,761 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 52 [2022-03-01 14:33:17,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-03-01 14:33:18,674 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-01 14:33:18,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-03-01 14:33:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-01 14:33:18,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021565123] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 14:33:18,686 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 14:33:18,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 76 [2022-03-01 14:33:18,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680835320] [2022-03-01 14:33:18,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 14:33:18,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-03-01 14:33:18,687 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:33:18,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-03-01 14:33:18,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=5275, Unknown=1, NotChecked=146, Total=5700 [2022-03-01 14:33:18,688 INFO L87 Difference]: Start difference. First operand 15273 states and 40478 transitions. Second operand has 76 states, 76 states have (on average 5.947368421052632) internal successors, (452), 76 states have internal predecessors, (452), 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) [2022-03-01 14:33:57,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:33:57,251 INFO L93 Difference]: Finished difference Result 46677 states and 123366 transitions. [2022-03-01 14:33:57,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2022-03-01 14:33:57,252 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 5.947368421052632) internal successors, (452), 76 states have internal predecessors, (452), 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 164 [2022-03-01 14:33:57,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:33:57,337 INFO L225 Difference]: With dead ends: 46677 [2022-03-01 14:33:57,337 INFO L226 Difference]: Without dead ends: 46677 [2022-03-01 14:33:57,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 316 SyntacticMatches, 4 SemanticMatches, 247 ConstructedPredicates, 1 IntricatePredicates, 6 DeprecatedPredicates, 19018 ImplicationChecksByTransitivity, 35.2s TimeCoverageRelationStatistics Valid=8126, Invalid=53121, Unknown=13, NotChecked=492, Total=61752 [2022-03-01 14:33:57,344 INFO L933 BasicCegarLoop]: 997 mSDtfsCounter, 13780 mSDsluCounter, 25628 mSDsCounter, 0 mSdLazyCounter, 7146 mSolverCounterSat, 543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13780 SdHoareTripleChecker+Valid, 25896 SdHoareTripleChecker+Invalid, 9005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 543 IncrementalHoareTripleChecker+Valid, 7146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1316 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-03-01 14:33:57,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13780 Valid, 25896 Invalid, 9005 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [543 Valid, 7146 Invalid, 0 Unknown, 1316 Unchecked, 4.7s Time] [2022-03-01 14:33:57,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46677 states. [2022-03-01 14:33:57,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46677 to 16534. [2022-03-01 14:33:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16534 states, 16530 states have (on average 2.6630973986690867) internal successors, (44021), 16533 states have internal predecessors, (44021), 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) [2022-03-01 14:33:57,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16534 states to 16534 states and 44021 transitions. [2022-03-01 14:33:57,790 INFO L78 Accepts]: Start accepts. Automaton has 16534 states and 44021 transitions. Word has length 164 [2022-03-01 14:33:57,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:33:57,791 INFO L470 AbstractCegarLoop]: Abstraction has 16534 states and 44021 transitions. [2022-03-01 14:33:57,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 5.947368421052632) internal successors, (452), 76 states have internal predecessors, (452), 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) [2022-03-01 14:33:57,791 INFO L276 IsEmpty]: Start isEmpty. Operand 16534 states and 44021 transitions. [2022-03-01 14:33:57,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-03-01 14:33:57,809 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:33:57,810 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:33:57,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-01 14:33:58,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 14:33:58,026 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-01 14:33:58,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:33:58,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1324549368, now seen corresponding path program 2 times [2022-03-01 14:33:58,027 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:33:58,027 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115052236] [2022-03-01 14:33:58,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:33:58,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:33:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:33:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:33:58,101 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:33:58,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115052236] [2022-03-01 14:33:58,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115052236] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 14:33:58,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168614027] [2022-03-01 14:33:58,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 14:33:58,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 14:33:58,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 14:33:58,102 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 14:33:58,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-01 14:33:58,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 14:33:58,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 14:33:58,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-01 14:33:58,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 14:33:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:33:58,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 14:33:58,738 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:33:58,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168614027] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 14:33:58,739 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 14:33:58,739 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-01 14:33:58,739 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761217135] [2022-03-01 14:33:58,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 14:33:58,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-01 14:33:58,740 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:33:58,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-01 14:33:58,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-03-01 14:33:58,741 INFO L87 Difference]: Start difference. First operand 16534 states and 44021 transitions. Second operand has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 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) [2022-03-01 14:33:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:33:59,049 INFO L93 Difference]: Finished difference Result 26311 states and 69356 transitions. [2022-03-01 14:33:59,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 14:33:59,049 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 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 194 [2022-03-01 14:33:59,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:33:59,101 INFO L225 Difference]: With dead ends: 26311 [2022-03-01 14:33:59,101 INFO L226 Difference]: Without dead ends: 26311 [2022-03-01 14:33:59,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 383 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=176, Invalid=330, Unknown=0, NotChecked=0, Total=506 [2022-03-01 14:33:59,101 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 789 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:33:59,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [789 Valid, 1083 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:33:59,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26311 states. [2022-03-01 14:33:59,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26311 to 21574. [2022-03-01 14:33:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21574 states, 21570 states have (on average 2.6575336114974504) internal successors, (57323), 21573 states have internal predecessors, (57323), 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) [2022-03-01 14:33:59,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21574 states to 21574 states and 57323 transitions. [2022-03-01 14:33:59,450 INFO L78 Accepts]: Start accepts. Automaton has 21574 states and 57323 transitions. Word has length 194 [2022-03-01 14:33:59,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:33:59,450 INFO L470 AbstractCegarLoop]: Abstraction has 21574 states and 57323 transitions. [2022-03-01 14:33:59,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 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) [2022-03-01 14:33:59,450 INFO L276 IsEmpty]: Start isEmpty. Operand 21574 states and 57323 transitions. [2022-03-01 14:33:59,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-03-01 14:33:59,472 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:33:59,472 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:33:59,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-01 14:33:59,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 14:33:59,687 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-01 14:33:59,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:33:59,688 INFO L85 PathProgramCache]: Analyzing trace with hash 893496526, now seen corresponding path program 1 times [2022-03-01 14:33:59,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:33:59,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739239985] [2022-03-01 14:33:59,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:33:59,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:33:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:34:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:34:00,447 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:34:00,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739239985] [2022-03-01 14:34:00,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739239985] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 14:34:00,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192539443] [2022-03-01 14:34:00,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:34:00,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 14:34:00,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 14:34:00,448 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 14:34:00,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-01 14:34:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:34:00,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 86 conjunts are in the unsatisfiable core [2022-03-01 14:34:00,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 14:34:01,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-01 14:34:02,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 14:34:02,345 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2022-03-01 14:34:03,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2022-03-01 14:34:04,067 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 5 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:34:04,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 14:34:31,619 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 14:34:31,620 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-03-01 14:34:31,626 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 14:34:31,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2022-03-01 14:34:31,638 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2022-03-01 14:34:31,660 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 14:34:31,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2022-03-01 14:34:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:34:32,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192539443] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 14:34:32,588 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 14:34:32,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34, 33] total 92 [2022-03-01 14:34:32,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19877013] [2022-03-01 14:34:32,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 14:34:32,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-03-01 14:34:32,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:34:32,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-03-01 14:34:32,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=717, Invalid=7632, Unknown=23, NotChecked=0, Total=8372 [2022-03-01 14:34:32,591 INFO L87 Difference]: Start difference. First operand 21574 states and 57323 transitions. Second operand has 92 states, 92 states have (on average 6.195652173913044) internal successors, (570), 92 states have internal predecessors, (570), 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) [2022-03-01 14:35:09,093 WARN L228 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 14:39:17,331 WARN L228 SmtUtils]: Spent 13.54s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 14:41:19,865 WARN L228 SmtUtils]: Spent 27.95s on a formula simplification that was a NOOP. DAG size: 98 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 14:42:33,120 WARN L228 SmtUtils]: Spent 11.88s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 14:43:00,480 WARN L228 SmtUtils]: Spent 11.40s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 14:43:31,736 WARN L228 SmtUtils]: Spent 7.51s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 14:43:55,977 WARN L228 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 14:44:10,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:44:10,901 INFO L93 Difference]: Finished difference Result 82222 states and 216050 transitions. [2022-03-01 14:44:10,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2022-03-01 14:44:10,901 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 6.195652173913044) internal successors, (570), 92 states have internal predecessors, (570), 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 199 [2022-03-01 14:44:10,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:44:11,073 INFO L225 Difference]: With dead ends: 82222 [2022-03-01 14:44:11,073 INFO L226 Difference]: Without dead ends: 81128 [2022-03-01 14:44:11,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 355 SyntacticMatches, 15 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31295 ImplicationChecksByTransitivity, 601.7s TimeCoverageRelationStatistics Valid=6429, Invalid=74227, Unknown=284, NotChecked=0, Total=80940 [2022-03-01 14:44:11,079 INFO L933 BasicCegarLoop]: 1084 mSDtfsCounter, 6080 mSDsluCounter, 40842 mSDsCounter, 0 mSdLazyCounter, 8270 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6080 SdHoareTripleChecker+Valid, 40822 SdHoareTripleChecker+Invalid, 11665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 8270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3310 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-03-01 14:44:11,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6080 Valid, 40822 Invalid, 11665 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [85 Valid, 8270 Invalid, 0 Unknown, 3310 Unchecked, 3.9s Time] [2022-03-01 14:44:11,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81128 states. [2022-03-01 14:44:12,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81128 to 43660. [2022-03-01 14:44:12,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43660 states, 43656 states have (on average 2.704370533260033) internal successors, (118062), 43659 states have internal predecessors, (118062), 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) [2022-03-01 14:44:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43660 states to 43660 states and 118062 transitions. [2022-03-01 14:44:12,268 INFO L78 Accepts]: Start accepts. Automaton has 43660 states and 118062 transitions. Word has length 199 [2022-03-01 14:44:12,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:44:12,268 INFO L470 AbstractCegarLoop]: Abstraction has 43660 states and 118062 transitions. [2022-03-01 14:44:12,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 6.195652173913044) internal successors, (570), 92 states have internal predecessors, (570), 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) [2022-03-01 14:44:12,269 INFO L276 IsEmpty]: Start isEmpty. Operand 43660 states and 118062 transitions. [2022-03-01 14:44:12,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-03-01 14:44:12,312 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:44:12,313 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:44:12,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-01 14:44:12,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-01 14:44:12,513 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-01 14:44:12,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:44:12,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1411660060, now seen corresponding path program 2 times [2022-03-01 14:44:12,514 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:44:12,514 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054526965] [2022-03-01 14:44:12,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:44:12,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:44:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:44:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 14:44:13,226 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:44:13,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054526965] [2022-03-01 14:44:13,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054526965] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 14:44:13,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856852230] [2022-03-01 14:44:13,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 14:44:13,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 14:44:13,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 14:44:13,228 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 14:44:13,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-01 14:44:13,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 14:44:13,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 14:44:13,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-01 14:44:13,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 14:44:13,903 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-01 14:44:14,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 14:44:14,700 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 43 [2022-03-01 14:44:15,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-03-01 14:44:16,067 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 61 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 14:44:16,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 14:44:19,301 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int)) (or (forall ((v_ArrVal_420 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_47|)))) is different from false [2022-03-01 14:44:35,997 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) is different from false [2022-03-01 14:44:46,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-03-01 14:44:47,043 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 57 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-03-01 14:44:47,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856852230] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 14:44:47,043 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 14:44:47,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 29] total 85 [2022-03-01 14:44:47,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583302059] [2022-03-01 14:44:47,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 14:44:47,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-03-01 14:44:47,044 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:44:47,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-03-01 14:44:47,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=6507, Unknown=11, NotChecked=326, Total=7140 [2022-03-01 14:44:47,045 INFO L87 Difference]: Start difference. First operand 43660 states and 118062 transitions. Second operand has 85 states, 85 states have (on average 6.670588235294118) internal successors, (567), 85 states have internal predecessors, (567), 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) [2022-03-01 14:44:53,945 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse5 (not .cse3)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse1))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (<= 4 .cse1) (<= 0 .cse2) .cse3 (<= .cse4 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse5) (and .cse3 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 0 .cse4) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse3 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse5)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= .cse2 4) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-01 14:44:54,786 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~top~0 4))) (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse1))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (<= 4 .cse1) (<= 0 .cse2) (<= c_~top~0 1) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= .cse2 4) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-01 14:44:57,337 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 4 (* c_~top~0 4)) (<= 0 .cse0) (not (= (mod (+ (* 4294967295 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967294) 4294967296) 0)) (<= .cse1 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((~top~0 Int)) (let ((.cse2 (* ~top~0 4))) (= (+ .cse2 |c_~#arr~0.offset|) (+ .cse2 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|)))) (<= c_~top~0 1) (= |c_~#arr~0.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 0 .cse1) (<= .cse0 4) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296))))) is different from false [2022-03-01 14:44:58,598 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 4 (* c_~top~0 4)) (<= 0 .cse0) (forall ((~top~0 Int)) (let ((.cse1 (* ~top~0 4))) (= (+ .cse1 |c_~#arr~0.offset|) (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|)))) (<= c_~top~0 1) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= .cse0 4) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296))))) is different from false [2022-03-01 14:45:01,271 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (<= 4 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (<= .cse1 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int)) (or (forall ((v_ArrVal_420 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_47|)))) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 0 .cse1) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)))) is different from false [2022-03-01 14:45:05,015 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= 4 .cse0) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse0) (+ |c_~#arr~0.offset| (* c_~top~0 4))) (<= .cse1 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (= |c_~#arr~0.offset| 0) (<= 1 c_~top~0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int)) (or (forall ((v_ArrVal_420 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_47|)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (forall ((~top~0 Int)) (let ((.cse2 (* ~top~0 4))) (= (+ .cse2 |c_~#arr~0.offset|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2)))) (<= 0 .cse1) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))))) is different from false [2022-03-01 14:45:15,308 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse5 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse3 (select .cse5 0)) (.cse4 (not .cse2)) (.cse0 (select .cse5 (+ |c_~#arr~0.offset| (- 4) .cse6))) (.cse1 (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (<= .cse3 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse4) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse4)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-01 14:45:16,684 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)))) is different from false [2022-03-01 14:45:19,817 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse2 (not .cse1)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) .cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-01 14:45:20,743 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse0 (select .cse2 0))) (and (<= .cse0 4) (not (= (mod (+ (* 4294967295 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967294) 4294967296) 0)) (forall ((~top~0 Int)) (let ((.cse1 (* ~top~0 4))) (= (+ .cse1 |c_~#arr~0.offset|) (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|)))) (not (= 4294967294 (mod (select .cse2 (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (<= c_~top~0 2) (<= 0 .cse0) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 2 c_~top~0) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))))) is different from false [2022-03-01 14:45:44,146 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~top~0 Int)) (let ((.cse0 (* ~top~0 4))) (= (+ .cse0 |c_~#arr~0.offset|) (+ .cse0 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|)))) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) is different from false [2022-03-01 14:45:47,034 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int)) (or (forall ((v_ArrVal_420 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_47|)))) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)))) is different from false Received shutdown request... [2022-03-01 14:47:02,085 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-01 14:47:02,085 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-01 14:47:02,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2022-03-01 14:47:02,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 801 GetRequests, 477 SyntacticMatches, 19 SemanticMatches, 304 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 29665 ImplicationChecksByTransitivity, 132.4s TimeCoverageRelationStatistics Valid=6078, Invalid=78828, Unknown=122, NotChecked=8302, Total=93330 [2022-03-01 14:47:02,719 INFO L933 BasicCegarLoop]: 1164 mSDtfsCounter, 8691 mSDsluCounter, 49523 mSDsCounter, 0 mSdLazyCounter, 10829 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8691 SdHoareTripleChecker+Valid, 49657 SdHoareTripleChecker+Invalid, 19272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 10829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8266 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-03-01 14:47:02,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8691 Valid, 49657 Invalid, 19272 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [177 Valid, 10829 Invalid, 0 Unknown, 8266 Unchecked, 5.7s Time] [2022-03-01 14:47:02,720 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-03-01 14:47:02,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-01 14:47:02,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 14:47:02,921 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (43660states) and FLOYD_HOARE automaton (currently 238 states, 85 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 306 known predicates. [2022-03-01 14:47:02,923 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 6 remaining) [2022-03-01 14:47:02,923 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 6 remaining) [2022-03-01 14:47:02,923 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-03-01 14:47:02,923 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-03-01 14:47:02,923 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-03-01 14:47:02,925 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1] [2022-03-01 14:47:02,927 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-01 14:47:02,927 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-01 14:47:02,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.03 02:47:02 BasicIcfg [2022-03-01 14:47:02,929 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-01 14:47:02,929 INFO L158 Benchmark]: Toolchain (without parser) took 856994.99ms. Allocated memory was 211.8MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 160.1MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-03-01 14:47:02,929 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 211.8MB. Free memory was 178.1MB in the beginning and 177.9MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-01 14:47:02,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.33ms. Allocated memory is still 211.8MB. Free memory was 160.0MB in the beginning and 169.1MB in the end (delta: -9.2MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-03-01 14:47:02,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.42ms. Allocated memory is still 211.8MB. Free memory was 169.1MB in the beginning and 166.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-01 14:47:02,930 INFO L158 Benchmark]: Boogie Preprocessor took 18.91ms. Allocated memory is still 211.8MB. Free memory was 166.5MB in the beginning and 164.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-01 14:47:02,930 INFO L158 Benchmark]: RCFGBuilder took 415.20ms. Allocated memory is still 211.8MB. Free memory was 164.9MB in the beginning and 149.2MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-01 14:47:02,930 INFO L158 Benchmark]: TraceAbstraction took 856087.36ms. Allocated memory was 211.8MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 148.7MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-03-01 14:47:02,931 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.11ms. Allocated memory is still 211.8MB. Free memory was 178.1MB in the beginning and 177.9MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 437.33ms. Allocated memory is still 211.8MB. Free memory was 160.0MB in the beginning and 169.1MB in the end (delta: -9.2MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.42ms. Allocated memory is still 211.8MB. Free memory was 169.1MB in the beginning and 166.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.91ms. Allocated memory is still 211.8MB. Free memory was 166.5MB in the beginning and 164.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 415.20ms. Allocated memory is still 211.8MB. Free memory was 164.9MB in the beginning and 149.2MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 856087.36ms. Allocated memory was 211.8MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 148.7MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (43660states) and FLOYD_HOARE automaton (currently 238 states, 85 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 306 known predicates. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (43660states) and FLOYD_HOARE automaton (currently 238 states, 85 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 306 known predicates. - TimeoutResultAtElement [Line: 1023]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (43660states) and FLOYD_HOARE automaton (currently 238 states, 85 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 306 known predicates. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (43660states) and FLOYD_HOARE automaton (currently 238 states, 85 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 306 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 276 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 855.9s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.3s, AutomataDifference: 767.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36670 SdHoareTripleChecker+Valid, 18.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36670 mSDsluCounter, 154803 SdHoareTripleChecker+Invalid, 15.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 12892 IncrementalHoareTripleChecker+Unchecked, 151930 mSDsCounter, 982 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35624 IncrementalHoareTripleChecker+Invalid, 49498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 982 mSolverCounterUnsat, 6778 mSDtfsCounter, 35624 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3329 GetRequests, 2107 SyntacticMatches, 40 SemanticMatches, 1181 ConstructedPredicates, 15 IntricatePredicates, 6 DeprecatedPredicates, 87162 ImplicationChecksByTransitivity, 779.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43660occurred in iteration=12, InterpolantAutomatonStates: 632, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 147570 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 79.4s InterpolantComputationTime, 2784 NumberOfCodeBlocks, 2738 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3789 ConstructedInterpolants, 101 QuantifiedInterpolants, 51982 SizeOfPredicates, 155 NumberOfNonLiveVariables, 2135 ConjunctsInSsa, 297 ConjunctsInUnsatCore, 25 InterpolantComputations, 8 PerfectInterpolantSequences, 156/1290 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 could not prove your program: Timeout Completed graceful shutdown