./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:36:15,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:36:15,584 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:36:15,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:36:15,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:36:15,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:36:15,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:36:15,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:36:15,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:36:15,628 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:36:15,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:36:15,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:36:15,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:36:15,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:36:15,630 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:36:15,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:36:15,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:36:15,634 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:36:15,634 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:36:15,634 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:36:15,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:36:15,635 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:36:15,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:36:15,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:36:15,636 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:36:15,636 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:36:15,637 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:36:15,637 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:36:15,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:36:15,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:36:15,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:36:15,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:36:15,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:36:15,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:36:15,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:36:15,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:36:15,641 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:36:15,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:36:15,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:36:15,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:36:15,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:36:15,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:36:15,642 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-clean/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2024-10-11 01:36:15,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:36:15,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:36:15,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:36:15,977 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:36:15,978 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:36:15,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2024-10-11 01:36:17,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:36:17,744 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:36:17,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2024-10-11 01:36:17,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c33c11195/b5638dbecffb48e28164b8d8dfe45878/FLAG818a3e045 [2024-10-11 01:36:18,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c33c11195/b5638dbecffb48e28164b8d8dfe45878 [2024-10-11 01:36:18,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:36:18,077 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:36:18,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:36:18,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:36:18,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:36:18,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:36:18" (1/1) ... [2024-10-11 01:36:18,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45117d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:18, skipping insertion in model container [2024-10-11 01:36:18,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:36:18" (1/1) ... [2024-10-11 01:36:18,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:36:18,489 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2024-10-11 01:36:18,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:36:18,555 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:36:18,603 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2024-10-11 01:36:18,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:36:18,663 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:36:18,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:18 WrapperNode [2024-10-11 01:36:18,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:36:18,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:36:18,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:36:18,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:36:18,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:18" (1/1) ... [2024-10-11 01:36:18,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:18" (1/1) ... [2024-10-11 01:36:18,716 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 118 [2024-10-11 01:36:18,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:36:18,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:36:18,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:36:18,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:36:18,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:18" (1/1) ... [2024-10-11 01:36:18,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:18" (1/1) ... [2024-10-11 01:36:18,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:18" (1/1) ... [2024-10-11 01:36:18,766 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2024-10-11 01:36:18,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:18" (1/1) ... [2024-10-11 01:36:18,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:18" (1/1) ... [2024-10-11 01:36:18,777 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:18" (1/1) ... [2024-10-11 01:36:18,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:18" (1/1) ... [2024-10-11 01:36:18,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:18" (1/1) ... [2024-10-11 01:36:18,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:18" (1/1) ... [2024-10-11 01:36:18,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:36:18,796 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:36:18,796 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:36:18,796 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:36:18,799 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:18" (1/1) ... [2024-10-11 01:36:18,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:36:18,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:36:18,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:36:18,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:36:18,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 01:36:18,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 01:36:18,904 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2024-10-11 01:36:18,904 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2024-10-11 01:36:18,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 01:36:18,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 01:36:18,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 01:36:18,905 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2024-10-11 01:36:18,905 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2024-10-11 01:36:18,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 01:36:18,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 01:36:18,905 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-10-11 01:36:18,905 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-10-11 01:36:18,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 01:36:18,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 01:36:18,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:36:18,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:36:18,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 01:36:18,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 01:36:18,906 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2024-10-11 01:36:18,906 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2024-10-11 01:36:18,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:36:18,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 01:36:18,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:36:18,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:36:19,065 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:36:19,067 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:36:19,430 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-10-11 01:36:19,430 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:36:19,492 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:36:19,493 INFO L314 CfgBuilder]: Removed 41 assume(true) statements. [2024-10-11 01:36:19,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:36:19 BoogieIcfgContainer [2024-10-11 01:36:19,494 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:36:19,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:36:19,497 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:36:19,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:36:19,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:36:18" (1/3) ... [2024-10-11 01:36:19,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b65697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:36:19, skipping insertion in model container [2024-10-11 01:36:19,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:18" (2/3) ... [2024-10-11 01:36:19,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b65697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:36:19, skipping insertion in model container [2024-10-11 01:36:19,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:36:19" (3/3) ... [2024-10-11 01:36:19,504 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2024-10-11 01:36:19,522 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:36:19,524 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:36:19,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:36:19,607 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@96375fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:36:19,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:36:19,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 01:36:19,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 01:36:19,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:19,621 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:36:19,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:19,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:19,626 INFO L85 PathProgramCache]: Analyzing trace with hash -754496073, now seen corresponding path program 1 times [2024-10-11 01:36:19,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:36:19,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278244065] [2024-10-11 01:36:19,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:19,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:36:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:36:19,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:36:19,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278244065] [2024-10-11 01:36:19,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278244065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:36:19,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:36:19,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:36:19,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529106951] [2024-10-11 01:36:19,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:36:19,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 01:36:19,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:36:19,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 01:36:19,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:36:19,822 INFO L87 Difference]: Start difference. First operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:36:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:36:19,897 INFO L93 Difference]: Finished difference Result 210 states and 377 transitions. [2024-10-11 01:36:19,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 01:36:19,899 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 01:36:19,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:36:19,907 INFO L225 Difference]: With dead ends: 210 [2024-10-11 01:36:19,908 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 01:36:19,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:36:19,921 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:36:19,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:36:19,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 01:36:19,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-11 01:36:19,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 89 states have internal predecessors, (94), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 01:36:19,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2024-10-11 01:36:19,973 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 8 [2024-10-11 01:36:19,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:36:19,975 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2024-10-11 01:36:19,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:36:19,975 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2024-10-11 01:36:19,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 01:36:19,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:19,978 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:36:19,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:36:19,979 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:19,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:19,979 INFO L85 PathProgramCache]: Analyzing trace with hash 437181209, now seen corresponding path program 1 times [2024-10-11 01:36:19,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:36:19,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176563158] [2024-10-11 01:36:19,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:19,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:36:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:20,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 01:36:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:20,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:36:20,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:36:20,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176563158] [2024-10-11 01:36:20,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176563158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:36:20,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:36:20,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:36:20,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401560548] [2024-10-11 01:36:20,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:36:20,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:36:20,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:36:20,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:36:20,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:36:20,347 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:36:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:36:20,768 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2024-10-11 01:36:20,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 01:36:20,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-11 01:36:20,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:36:20,771 INFO L225 Difference]: With dead ends: 101 [2024-10-11 01:36:20,771 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 01:36:20,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 01:36:20,775 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 233 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 01:36:20,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 87 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 01:36:20,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 01:36:20,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-11 01:36:20,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 88 states have internal predecessors, (93), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 01:36:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2024-10-11 01:36:20,796 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 17 [2024-10-11 01:36:20,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:36:20,797 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2024-10-11 01:36:20,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:36:20,798 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2024-10-11 01:36:20,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 01:36:20,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:20,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:36:20,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:36:20,799 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:20,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:20,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1443607003, now seen corresponding path program 1 times [2024-10-11 01:36:20,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:36:20,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759550788] [2024-10-11 01:36:20,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:20,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:36:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:21,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 01:36:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:21,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:36:21,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:36:21,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759550788] [2024-10-11 01:36:21,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759550788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:36:21,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:36:21,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 01:36:21,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639820348] [2024-10-11 01:36:21,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:36:21,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 01:36:21,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:36:21,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 01:36:21,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 01:36:21,308 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:36:22,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:36:22,231 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2024-10-11 01:36:22,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 01:36:22,232 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-11 01:36:22,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:36:22,235 INFO L225 Difference]: With dead ends: 187 [2024-10-11 01:36:22,236 INFO L226 Difference]: Without dead ends: 181 [2024-10-11 01:36:22,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2024-10-11 01:36:22,237 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 463 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 01:36:22,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 110 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 01:36:22,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-11 01:36:22,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 161. [2024-10-11 01:36:22,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 133 states have (on average 1.263157894736842) internal successors, (168), 147 states have internal predecessors, (168), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 01:36:22,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 198 transitions. [2024-10-11 01:36:22,280 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 198 transitions. Word has length 20 [2024-10-11 01:36:22,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:36:22,301 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 198 transitions. [2024-10-11 01:36:22,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:36:22,301 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 198 transitions. [2024-10-11 01:36:22,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 01:36:22,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:22,302 INFO L215 NwaCegarLoop]: 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] [2024-10-11 01:36:22,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 01:36:22,302 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:22,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:22,303 INFO L85 PathProgramCache]: Analyzing trace with hash 722118342, now seen corresponding path program 1 times [2024-10-11 01:36:22,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:36:22,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580210699] [2024-10-11 01:36:22,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:22,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:36:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:22,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 01:36:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:23,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:36:23,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:36:23,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580210699] [2024-10-11 01:36:23,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580210699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:36:23,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:36:23,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 01:36:23,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509382259] [2024-10-11 01:36:23,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:36:23,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 01:36:23,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:36:23,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 01:36:23,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 01:36:23,114 INFO L87 Difference]: Start difference. First operand 161 states and 198 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:36:24,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:36:24,029 INFO L93 Difference]: Finished difference Result 259 states and 314 transitions. [2024-10-11 01:36:24,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 01:36:24,030 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-11 01:36:24,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:36:24,032 INFO L225 Difference]: With dead ends: 259 [2024-10-11 01:36:24,032 INFO L226 Difference]: Without dead ends: 256 [2024-10-11 01:36:24,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-10-11 01:36:24,033 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 299 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 01:36:24,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 160 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 01:36:24,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-11 01:36:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 238. [2024-10-11 01:36:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2561576354679802) internal successors, (255), 218 states have internal predecessors, (255), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 01:36:24,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 294 transitions. [2024-10-11 01:36:24,067 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 294 transitions. Word has length 23 [2024-10-11 01:36:24,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:36:24,068 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 294 transitions. [2024-10-11 01:36:24,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:36:24,068 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 294 transitions. [2024-10-11 01:36:24,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 01:36:24,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:24,069 INFO L215 NwaCegarLoop]: 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] [2024-10-11 01:36:24,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 01:36:24,070 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:24,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:24,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1115915285, now seen corresponding path program 1 times [2024-10-11 01:36:24,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:36:24,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401863412] [2024-10-11 01:36:24,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:24,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:36:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:24,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 01:36:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:24,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:36:24,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:36:24,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401863412] [2024-10-11 01:36:24,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401863412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:36:24,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:36:24,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 01:36:24,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623270020] [2024-10-11 01:36:24,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:36:24,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 01:36:24,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:36:24,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 01:36:24,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-11 01:36:24,859 INFO L87 Difference]: Start difference. First operand 238 states and 294 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:36:25,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:36:25,884 INFO L93 Difference]: Finished difference Result 258 states and 312 transitions. [2024-10-11 01:36:25,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 01:36:25,886 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-10-11 01:36:25,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:36:25,887 INFO L225 Difference]: With dead ends: 258 [2024-10-11 01:36:25,887 INFO L226 Difference]: Without dead ends: 255 [2024-10-11 01:36:25,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-10-11 01:36:25,888 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 344 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 01:36:25,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 160 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 01:36:25,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-11 01:36:25,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 238. [2024-10-11 01:36:25,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.251231527093596) internal successors, (254), 218 states have internal predecessors, (254), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 01:36:25,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 293 transitions. [2024-10-11 01:36:25,935 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 293 transitions. Word has length 26 [2024-10-11 01:36:25,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:36:25,936 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 293 transitions. [2024-10-11 01:36:25,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:36:25,936 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 293 transitions. [2024-10-11 01:36:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 01:36:25,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:25,939 INFO L215 NwaCegarLoop]: 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] [2024-10-11 01:36:25,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 01:36:25,939 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:25,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:25,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1422251983, now seen corresponding path program 1 times [2024-10-11 01:36:25,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:36:25,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036347024] [2024-10-11 01:36:25,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:25,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:36:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:26,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 01:36:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:26,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:36:26,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:36:26,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036347024] [2024-10-11 01:36:26,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036347024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:36:26,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:36:26,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 01:36:26,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277776907] [2024-10-11 01:36:26,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:36:26,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 01:36:26,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:36:26,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 01:36:26,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-11 01:36:26,772 INFO L87 Difference]: Start difference. First operand 238 states and 293 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:36:27,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:36:27,787 INFO L93 Difference]: Finished difference Result 257 states and 310 transitions. [2024-10-11 01:36:27,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 01:36:27,788 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-10-11 01:36:27,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:36:27,790 INFO L225 Difference]: With dead ends: 257 [2024-10-11 01:36:27,790 INFO L226 Difference]: Without dead ends: 254 [2024-10-11 01:36:27,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-10-11 01:36:27,791 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 332 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 01:36:27,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 176 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 01:36:27,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-11 01:36:27,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 238. [2024-10-11 01:36:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2463054187192117) internal successors, (253), 218 states have internal predecessors, (253), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 01:36:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 292 transitions. [2024-10-11 01:36:27,819 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 292 transitions. Word has length 29 [2024-10-11 01:36:27,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:36:27,819 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 292 transitions. [2024-10-11 01:36:27,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:36:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 292 transitions. [2024-10-11 01:36:27,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 01:36:27,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:27,820 INFO L215 NwaCegarLoop]: 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] [2024-10-11 01:36:27,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 01:36:27,821 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:27,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:27,821 INFO L85 PathProgramCache]: Analyzing trace with hash -678942440, now seen corresponding path program 1 times [2024-10-11 01:36:27,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:36:27,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530754425] [2024-10-11 01:36:27,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:27,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:36:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:28,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 01:36:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:28,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:36:28,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:36:28,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530754425] [2024-10-11 01:36:28,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530754425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:36:28,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:36:28,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 01:36:28,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961580557] [2024-10-11 01:36:28,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:36:28,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 01:36:28,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:36:28,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 01:36:28,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-11 01:36:28,628 INFO L87 Difference]: Start difference. First operand 238 states and 292 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:36:29,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:36:29,659 INFO L93 Difference]: Finished difference Result 256 states and 308 transitions. [2024-10-11 01:36:29,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 01:36:29,660 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-10-11 01:36:29,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:36:29,662 INFO L225 Difference]: With dead ends: 256 [2024-10-11 01:36:29,663 INFO L226 Difference]: Without dead ends: 253 [2024-10-11 01:36:29,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-10-11 01:36:29,665 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 325 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 01:36:29,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 173 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 01:36:29,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-11 01:36:29,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 238. [2024-10-11 01:36:29,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2413793103448276) internal successors, (252), 218 states have internal predecessors, (252), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 01:36:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 291 transitions. [2024-10-11 01:36:29,709 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 291 transitions. Word has length 32 [2024-10-11 01:36:29,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:36:29,710 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 291 transitions. [2024-10-11 01:36:29,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:36:29,711 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 291 transitions. [2024-10-11 01:36:29,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 01:36:29,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:29,713 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:36:29,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 01:36:29,713 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:29,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:29,714 INFO L85 PathProgramCache]: Analyzing trace with hash -58033664, now seen corresponding path program 1 times [2024-10-11 01:36:29,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:36:29,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582549582] [2024-10-11 01:36:29,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:29,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:36:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:30,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 01:36:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:30,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 01:36:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:30,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 01:36:30,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:36:30,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582549582] [2024-10-11 01:36:30,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582549582] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:36:30,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14575524] [2024-10-11 01:36:30,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:30,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:36:30,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:36:30,773 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:36:30,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 01:36:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:30,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-11 01:36:30,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:36:31,035 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 01:36:31,036 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 16 [2024-10-11 01:36:31,095 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2024-10-11 01:36:31,107 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2024-10-11 01:36:31,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 167 [2024-10-11 01:36:31,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 178 [2024-10-11 01:36:31,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:36:31,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 85 [2024-10-11 01:36:31,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:36:31,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2024-10-11 01:36:31,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 [2024-10-11 01:36:31,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2024-10-11 01:36:31,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:36:31,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 61 [2024-10-11 01:36:31,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 65 [2024-10-11 01:36:31,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 62 treesize of output 67 [2024-10-11 01:36:31,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:36:31,892 INFO L378 Elim1Store]: Elim1 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 17 treesize of output 21 [2024-10-11 01:36:31,908 INFO L378 Elim1Store]: Elim1 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 25 treesize of output 19 [2024-10-11 01:36:32,010 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:36:32,011 INFO L378 Elim1Store]: Elim1 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 [2024-10-11 01:36:32,069 INFO L378 Elim1Store]: Elim1 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 28 treesize of output 19 [2024-10-11 01:36:32,129 INFO L378 Elim1Store]: Elim1 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 145 treesize of output 129 [2024-10-11 01:36:32,151 INFO L378 Elim1Store]: Elim1 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 127 treesize of output 111 [2024-10-11 01:36:33,070 INFO L349 Elim1Store]: treesize reduction 262, result has 15.8 percent of original size [2024-10-11 01:36:33,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 286 treesize of output 149 [2024-10-11 01:36:33,717 INFO L349 Elim1Store]: treesize reduction 196, result has 27.4 percent of original size [2024-10-11 01:36:33,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 291 treesize of output 407 [2024-10-11 01:36:33,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 01:36:34,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:36:34,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 562 treesize of output 572 [2024-10-11 01:36:34,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 01:36:37,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 01:36:41,985 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:36:41,993 INFO L349 Elim1Store]: treesize reduction 61, result has 1.6 percent of original size [2024-10-11 01:36:41,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 18 [2024-10-11 01:36:43,909 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:36:43,918 INFO L349 Elim1Store]: treesize reduction 61, result has 1.6 percent of original size [2024-10-11 01:36:43,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 18 [2024-10-11 01:36:45,493 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-10-11 01:36:45,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 01:36:45,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:36:45,695 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: unsuccessful DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:170) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:290) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-11 01:36:45,702 INFO L158 Benchmark]: Toolchain (without parser) took 27624.74ms. Allocated memory was 151.0MB in the beginning and 664.8MB in the end (delta: 513.8MB). Free memory was 114.5MB in the beginning and 608.6MB in the end (delta: -494.1MB). Peak memory consumption was 400.0MB. Max. memory is 16.1GB. [2024-10-11 01:36:45,702 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 01:36:45,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.11ms. Allocated memory is still 151.0MB. Free memory was 114.5MB in the beginning and 85.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 01:36:45,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.16ms. Allocated memory is still 151.0MB. Free memory was 85.1MB in the beginning and 82.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 01:36:45,703 INFO L158 Benchmark]: Boogie Preprocessor took 78.29ms. Allocated memory is still 151.0MB. Free memory was 82.4MB in the beginning and 78.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 01:36:45,703 INFO L158 Benchmark]: RCFGBuilder took 697.87ms. Allocated memory is still 151.0MB. Free memory was 78.2MB in the beginning and 90.9MB in the end (delta: -12.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 01:36:45,704 INFO L158 Benchmark]: TraceAbstraction took 26205.82ms. Allocated memory was 151.0MB in the beginning and 664.8MB in the end (delta: 513.8MB). Free memory was 90.0MB in the beginning and 608.6MB in the end (delta: -518.6MB). Peak memory consumption was 378.7MB. Max. memory is 16.1GB. [2024-10-11 01:36:45,705 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 586.11ms. Allocated memory is still 151.0MB. Free memory was 114.5MB in the beginning and 85.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.16ms. Allocated memory is still 151.0MB. Free memory was 85.1MB in the beginning and 82.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.29ms. Allocated memory is still 151.0MB. Free memory was 82.4MB in the beginning and 78.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 697.87ms. Allocated memory is still 151.0MB. Free memory was 78.2MB in the beginning and 90.9MB in the end (delta: -12.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 26205.82ms. Allocated memory was 151.0MB in the beginning and 664.8MB in the end (delta: 513.8MB). Free memory was 90.0MB in the beginning and 608.6MB in the end (delta: -518.6MB). Peak memory consumption was 378.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: unsuccessful DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: unsuccessful DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:170) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-11 01:36:45,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:36:47,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:36:47,951 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 01:36:47,957 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:36:47,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:36:47,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:36:47,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:36:47,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:36:48,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:36:48,000 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:36:48,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:36:48,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:36:48,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:36:48,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:36:48,002 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:36:48,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:36:48,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:36:48,003 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:36:48,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:36:48,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:36:48,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:36:48,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:36:48,008 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:36:48,008 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 01:36:48,008 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 01:36:48,009 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:36:48,009 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 01:36:48,009 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:36:48,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:36:48,010 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:36:48,010 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:36:48,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:36:48,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:36:48,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:36:48,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:36:48,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:36:48,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:36:48,016 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:36:48,016 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 01:36:48,016 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 01:36:48,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:36:48,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:36:48,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:36:48,017 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:36:48,018 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 01:36:48,018 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-clean/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2024-10-11 01:36:48,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:36:48,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:36:48,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:36:48,374 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:36:48,374 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:36:48,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2024-10-11 01:36:50,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:36:50,339 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:36:50,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2024-10-11 01:36:50,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/71ba7652e/5353c74205a147859a9d9860d51d798a/FLAGb1f0c8f5c [2024-10-11 01:36:50,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/71ba7652e/5353c74205a147859a9d9860d51d798a [2024-10-11 01:36:50,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:36:50,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:36:50,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:36:50,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:36:50,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:36:50,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:36:50" (1/1) ... [2024-10-11 01:36:50,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3601000d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:50, skipping insertion in model container [2024-10-11 01:36:50,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:36:50" (1/1) ... [2024-10-11 01:36:50,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:36:50,886 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2024-10-11 01:36:50,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:36:50,949 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 01:36:50,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:36:50,989 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2024-10-11 01:36:51,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:36:51,011 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:36:51,042 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2024-10-11 01:36:51,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:36:51,143 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:36:51,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:51 WrapperNode [2024-10-11 01:36:51,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:36:51,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:36:51,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:36:51,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:36:51,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:51" (1/1) ... [2024-10-11 01:36:51,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:51" (1/1) ... [2024-10-11 01:36:51,206 INFO L138 Inliner]: procedures = 235, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 115 [2024-10-11 01:36:51,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:36:51,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:36:51,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:36:51,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:36:51,218 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:51" (1/1) ... [2024-10-11 01:36:51,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:51" (1/1) ... [2024-10-11 01:36:51,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:51" (1/1) ... [2024-10-11 01:36:51,266 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [35, 2]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [10, 0]. [2024-10-11 01:36:51,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:51" (1/1) ... [2024-10-11 01:36:51,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:51" (1/1) ... [2024-10-11 01:36:51,288 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:51" (1/1) ... [2024-10-11 01:36:51,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:51" (1/1) ... [2024-10-11 01:36:51,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:51" (1/1) ... [2024-10-11 01:36:51,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:51" (1/1) ... [2024-10-11 01:36:51,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:36:51,312 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:36:51,312 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:36:51,312 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:36:51,317 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:51" (1/1) ... [2024-10-11 01:36:51,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:36:51,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:36:51,348 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:36:51,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:36:51,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 01:36:51,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 01:36:51,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 01:36:51,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 01:36:51,401 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2024-10-11 01:36:51,401 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2024-10-11 01:36:51,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 01:36:51,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 01:36:51,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 01:36:51,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 01:36:51,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 01:36:51,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 01:36:51,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 01:36:51,403 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2024-10-11 01:36:51,403 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2024-10-11 01:36:51,404 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-10-11 01:36:51,404 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-10-11 01:36:51,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:36:51,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:36:51,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 01:36:51,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 01:36:51,405 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2024-10-11 01:36:51,405 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2024-10-11 01:36:51,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:36:51,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:36:51,568 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:36:51,570 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:36:52,078 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-10-11 01:36:52,079 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:36:52,147 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:36:52,149 INFO L314 CfgBuilder]: Removed 41 assume(true) statements. [2024-10-11 01:36:52,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:36:52 BoogieIcfgContainer [2024-10-11 01:36:52,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:36:52,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:36:52,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:36:52,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:36:52,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:36:50" (1/3) ... [2024-10-11 01:36:52,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ca60f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:36:52, skipping insertion in model container [2024-10-11 01:36:52,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:51" (2/3) ... [2024-10-11 01:36:52,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ca60f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:36:52, skipping insertion in model container [2024-10-11 01:36:52,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:36:52" (3/3) ... [2024-10-11 01:36:52,160 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2024-10-11 01:36:52,176 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:36:52,177 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:36:52,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:36:52,256 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@58274867, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:36:52,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:36:52,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 01:36:52,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 01:36:52,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:52,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:36:52,268 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:52,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:52,272 INFO L85 PathProgramCache]: Analyzing trace with hash -754496073, now seen corresponding path program 1 times [2024-10-11 01:36:52,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 01:36:52,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143362222] [2024-10-11 01:36:52,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:52,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 01:36:52,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 01:36:52,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 01:36:52,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 01:36:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:52,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 01:36:52,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:36:52,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:36:52,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 01:36:52,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 01:36:52,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143362222] [2024-10-11 01:36:52,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143362222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:36:52,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:36:52,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:36:52,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660298326] [2024-10-11 01:36:52,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:36:52,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 01:36:52,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 01:36:52,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 01:36:52,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:36:52,451 INFO L87 Difference]: Start difference. First operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:36:52,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:36:52,593 INFO L93 Difference]: Finished difference Result 210 states and 377 transitions. [2024-10-11 01:36:52,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 01:36:52,596 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 01:36:52,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:36:52,605 INFO L225 Difference]: With dead ends: 210 [2024-10-11 01:36:52,605 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 01:36:52,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:36:52,616 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:36:52,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:36:52,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 01:36:52,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-11 01:36:52,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 89 states have internal predecessors, (94), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 01:36:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2024-10-11 01:36:52,655 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 8 [2024-10-11 01:36:52,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:36:52,656 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2024-10-11 01:36:52,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:36:52,656 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2024-10-11 01:36:52,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 01:36:52,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:52,657 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:36:52,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 01:36:52,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 01:36:52,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:52,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:52,861 INFO L85 PathProgramCache]: Analyzing trace with hash 437181209, now seen corresponding path program 1 times [2024-10-11 01:36:52,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 01:36:52,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727359862] [2024-10-11 01:36:52,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:52,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 01:36:52,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 01:36:52,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 01:36:52,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 01:36:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:53,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 01:36:53,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:36:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:36:53,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 01:36:53,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 01:36:53,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727359862] [2024-10-11 01:36:53,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727359862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:36:53,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:36:53,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:36:53,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111050340] [2024-10-11 01:36:53,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:36:53,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:36:53,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 01:36:53,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:36:53,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:36:53,107 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:36:53,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:36:53,425 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2024-10-11 01:36:53,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:36:53,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-11 01:36:53,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:36:53,428 INFO L225 Difference]: With dead ends: 101 [2024-10-11 01:36:53,429 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 01:36:53,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:36:53,430 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 166 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 01:36:53,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 208 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 01:36:53,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 01:36:53,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-11 01:36:53,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 88 states have internal predecessors, (93), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 01:36:53,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2024-10-11 01:36:53,449 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 17 [2024-10-11 01:36:53,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:36:53,451 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2024-10-11 01:36:53,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:36:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2024-10-11 01:36:53,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 01:36:53,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:53,452 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:36:53,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 01:36:53,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 01:36:53,657 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:53,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:53,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1443607003, now seen corresponding path program 1 times [2024-10-11 01:36:53,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 01:36:53,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127592313] [2024-10-11 01:36:53,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:53,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 01:36:53,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 01:36:53,662 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 01:36:53,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 01:36:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:53,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 01:36:53,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:36:53,898 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 01:36:53,899 INFO L378 Elim1Store]: Elim1 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 13 [2024-10-11 01:36:54,321 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-10-11 01:36:54,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 205 [2024-10-11 01:36:54,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 175 treesize of output 140 [2024-10-11 01:36:54,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-10-11 01:36:54,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-10-11 01:36:54,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-10-11 01:36:55,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:36:55,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 15 [2024-10-11 01:36:55,337 INFO L378 Elim1Store]: Elim1 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 5 treesize of output 3 [2024-10-11 01:36:56,068 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 01:36:56,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-11 01:36:56,167 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 8 [2024-10-11 01:36:56,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:36:56,187 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 01:36:56,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 01:36:56,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127592313] [2024-10-11 01:36:56,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127592313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:36:56,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:36:56,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 01:36:56,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914877799] [2024-10-11 01:36:56,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:36:56,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 01:36:56,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 01:36:56,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 01:36:56,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-11 01:36:56,190 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:36:56,511 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse11 (select |c_#memory_$Pointer$#0.base| |c_list_add_#in~head#1.base|))) (let ((.cse0 (= |c_list_add_#in~new#1.base| |c_list_add_#in~head#1.base|)) (.cse1 (= |c_list_add_#in~new#1.base| (select .cse11 |c_list_add_#in~head#1.offset|)))) (or (and (not .cse0) .cse1) (and (exists ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select (store (store |c_#memory_$Pointer$#0.base| |c_list_add_#in~new#1.base| v_DerPreprocessor_7) |c_list_add_#in~head#1.base| v_DerPreprocessor_8) |c_list_add_#in~new#1.base|) v_DerPreprocessor_7) (= |c_list_add_#in~new#1.base| (select v_DerPreprocessor_8 |c_list_add_#in~head#1.offset|)))) .cse1 (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select (store (store |c_#memory_$Pointer$#0.base| |c_list_add_#in~new#1.base| v_DerPreprocessor_5) |c_list_add_#in~head#1.base| v_DerPreprocessor_4) |c_list_add_#in~new#1.base|) v_DerPreprocessor_5) (= (select v_DerPreprocessor_4 |c_list_add_#in~head#1.offset|) |c_list_add_#in~new#1.base|)))) (and .cse0 (or (and (exists ((v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_4 (_ BitVec 32)) (v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select |c_#memory_$Pointer$#0.base| v_arrayElimCell_4))) (let ((.cse3 (store (store (store |c_#memory_$Pointer$#0.base| v_arrayElimCell_4 v_DerPreprocessor_9) |c_list_add_#in~new#1.base| v_DerPreprocessor_10) |c_list_add_#in~head#1.base| (store .cse4 |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))) (.cse2 (store (store (store |c_#memory_$Pointer$#0.base| v_arrayElimCell_4 v_DerPreprocessor_1) |c_list_add_#in~new#1.base| v_DerPreprocessor_2) |c_list_add_#in~head#1.base| v_DerPreprocessor_3))) (and (= (select .cse2 |c_list_add_#in~new#1.base|) v_DerPreprocessor_2) (= (select v_DerPreprocessor_3 |c_list_add_#in~head#1.offset|) |c_list_add_#in~new#1.base|) (= v_DerPreprocessor_10 (select .cse3 |c_list_add_#in~new#1.base|)) (not (= v_arrayElimCell_4 |c_list_add_#in~head#1.base|)) (= (select .cse3 v_arrayElimCell_4) .cse4) (= (select .cse2 v_arrayElimCell_4) .cse4))))) .cse1) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (exists ((v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select |c_#memory_$Pointer$#0.base| v_arrayElimCell_4))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$#0.base| v_arrayElimCell_4 v_DerPreprocessor_9) |c_list_add_#in~new#1.base| v_DerPreprocessor_10) |c_list_add_#in~head#1.base| (store .cse8 |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)))) (let ((.cse6 (select .cse9 |c_list_add_#in~new#1.base|))) (and (exists ((v_prenex_35 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$#0.base| v_arrayElimCell_4 v_prenex_34) |c_list_add_#in~new#1.base| v_prenex_35) |c_list_add_#in~head#1.base| v_prenex_36))) (let ((.cse5 (select .cse7 |c_list_add_#in~new#1.base|))) (and (= .cse5 .cse6) (= (select .cse7 v_arrayElimCell_4) .cse8) (= .cse5 (select |c_#memory_$Pointer$#0.base| |c_list_add_#in~new#1.base|)) (= .cse5 v_prenex_35))))) (= v_DerPreprocessor_10 .cse6) (= (select .cse9 v_arrayElimCell_4) .cse8)))))) (not (= v_arrayElimCell_4 |c_list_add_#in~head#1.base|)))))) (exists ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32)))) (and (exists ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (store (store |c_#memory_$Pointer$#0.base| |c_list_add_#in~new#1.base| v_DerPreprocessor_7) |c_list_add_#in~head#1.base| v_DerPreprocessor_8) |c_list_add_#in~new#1.base|))) (and (exists ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (store (store |c_#memory_$Pointer$#0.base| |c_list_add_#in~new#1.base| v_prenex_29) |c_list_add_#in~head#1.base| v_prenex_28) |c_list_add_#in~new#1.base|))) (and (= (store .cse10 |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|) .cse11) (= .cse12 .cse10) (= v_prenex_29 .cse10)))) (= .cse12 v_DerPreprocessor_7)))) (= |c_list_add_#in~new#1.base| (select v_DerPreprocessor_8 |c_list_add_#in~head#1.offset|))))))) (= (_ bv3 32) |c_~#gl_list~0.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (_ bv3 32))))) is different from true [2024-10-11 01:36:57,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:36:57,613 INFO L93 Difference]: Finished difference Result 198 states and 236 transitions. [2024-10-11 01:36:57,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 01:36:57,613 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-11 01:36:57,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:36:57,616 INFO L225 Difference]: With dead ends: 198 [2024-10-11 01:36:57,616 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 01:36:57,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=159, Unknown=1, NotChecked=26, Total=240 [2024-10-11 01:36:57,618 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 361 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:36:57,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 580 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 499 Invalid, 0 Unknown, 9 Unchecked, 1.2s Time] [2024-10-11 01:36:57,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 01:36:57,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 177. [2024-10-11 01:36:57,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 145 states have (on average 1.2551724137931035) internal successors, (182), 160 states have internal predecessors, (182), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 01:36:57,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 216 transitions. [2024-10-11 01:36:57,649 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 216 transitions. Word has length 20 [2024-10-11 01:36:57,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:36:57,649 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 216 transitions. [2024-10-11 01:36:57,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:36:57,650 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 216 transitions. [2024-10-11 01:36:57,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 01:36:57,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:57,650 INFO L215 NwaCegarLoop]: 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] [2024-10-11 01:36:57,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 01:36:57,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 01:36:57,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:57,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:57,856 INFO L85 PathProgramCache]: Analyzing trace with hash 722118342, now seen corresponding path program 1 times [2024-10-11 01:36:57,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 01:36:57,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735174502] [2024-10-11 01:36:57,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:57,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 01:36:57,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 01:36:57,859 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 01:36:57,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 01:36:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:58,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 01:36:58,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:36:58,094 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 01:36:58,095 INFO L378 Elim1Store]: Elim1 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 13 [2024-10-11 01:36:58,165 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2024-10-11 01:36:58,175 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2024-10-11 01:36:58,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2024-10-11 01:36:58,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2024-10-11 01:36:58,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:36:58,435 INFO L378 Elim1Store]: Elim1 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 21 treesize of output 14 [2024-10-11 01:36:58,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2024-10-11 01:36:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:36:58,656 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 01:36:58,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 01:36:58,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735174502] [2024-10-11 01:36:58,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735174502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:36:58,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:36:58,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 01:36:58,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59068691] [2024-10-11 01:36:58,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:36:58,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 01:36:58,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 01:36:58,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 01:36:58,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=89, Unknown=1, NotChecked=0, Total=110 [2024-10-11 01:36:58,658 INFO L87 Difference]: Start difference. First operand 177 states and 216 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:37:04,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:37:09,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:37:19,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:37:25,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:37:27,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:37:27,162 INFO L93 Difference]: Finished difference Result 197 states and 234 transitions. [2024-10-11 01:37:27,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 01:37:27,167 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-11 01:37:27,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:37:27,168 INFO L225 Difference]: With dead ends: 197 [2024-10-11 01:37:27,168 INFO L226 Difference]: Without dead ends: 194 [2024-10-11 01:37:27,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=56, Invalid=210, Unknown=6, NotChecked=0, Total=272 [2024-10-11 01:37:27,169 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 218 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 33 mSolverCounterUnsat, 115 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 115 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.5s IncrementalHoareTripleChecker+Time [2024-10-11 01:37:27,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 356 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 840 Invalid, 115 Unknown, 0 Unchecked, 26.5s Time] [2024-10-11 01:37:27,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-11 01:37:27,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 177. [2024-10-11 01:37:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 145 states have (on average 1.2482758620689656) internal successors, (181), 160 states have internal predecessors, (181), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 01:37:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 215 transitions. [2024-10-11 01:37:27,199 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 215 transitions. Word has length 23 [2024-10-11 01:37:27,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:37:27,199 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 215 transitions. [2024-10-11 01:37:27,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:37:27,200 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 215 transitions. [2024-10-11 01:37:27,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 01:37:27,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:37:27,201 INFO L215 NwaCegarLoop]: 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] [2024-10-11 01:37:27,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 01:37:27,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 01:37:27,401 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:37:27,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:37:27,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1115915285, now seen corresponding path program 1 times [2024-10-11 01:37:27,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 01:37:27,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158115915] [2024-10-11 01:37:27,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:37:27,403 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 01:37:27,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 01:37:27,406 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 01:37:27,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 01:37:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:37:27,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 01:37:27,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:37:27,806 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 01:37:27,807 INFO L378 Elim1Store]: Elim1 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 13 [2024-10-11 01:37:28,104 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2024-10-11 01:37:28,137 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2024-10-11 01:37:28,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2024-10-11 01:37:28,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:37:28,598 INFO L378 Elim1Store]: Elim1 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 36 treesize of output 19 [2024-10-11 01:37:28,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 11 [2024-10-11 01:37:28,793 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2024-10-11 01:37:29,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:37:29,768 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 01:37:29,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 01:37:29,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158115915] [2024-10-11 01:37:29,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158115915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:37:29,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:37:29,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 01:37:29,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805509582] [2024-10-11 01:37:29,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:37:29,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 01:37:29,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 01:37:29,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 01:37:29,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=88, Unknown=2, NotChecked=0, Total=110 [2024-10-11 01:37:29,771 INFO L87 Difference]: Start difference. First operand 177 states and 215 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)