./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 eaa60ed61738bb84f21e0e7461cdcc453d531566de1a87a0cbf8ab788e5233b0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:15:30,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:15:30,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:15:30,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:15:30,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:15:30,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:15:30,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:15:30,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:15:30,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:15:30,744 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:15:30,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:15:30,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:15:30,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:15:30,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:15:30,745 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:15:30,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:15:30,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:15:30,750 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:15:30,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:15:30,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:15:30,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:15:30,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:15:30,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:15:30,753 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:15:30,753 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:15:30,753 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:15:30,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:15:30,753 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:15:30,754 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:15:30,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:15:30,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:15:30,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:15:30,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:15:30,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:15:30,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:15:30,755 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:15:30,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:15:30,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:15:30,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:15:30,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:15:30,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:15:30,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:15:30,761 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/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/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 -> eaa60ed61738bb84f21e0e7461cdcc453d531566de1a87a0cbf8ab788e5233b0 [2024-11-10 09:15:30,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:15:30,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:15:30,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:15:30,968 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:15:30,969 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:15:30,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i [2024-11-10 09:15:32,391 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:15:32,584 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:15:32,584 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i [2024-11-10 09:15:32,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/718f93f8b/3d74d8e58ba44ca0b11cf1700bb6e210/FLAGea8b92bd6 [2024-11-10 09:15:32,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/718f93f8b/3d74d8e58ba44ca0b11cf1700bb6e210 [2024-11-10 09:15:32,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:15:32,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:15:32,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:15:32,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:15:32,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:15:32,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:15:32" (1/1) ... [2024-11-10 09:15:32,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c4bbd83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:32, skipping insertion in model container [2024-11-10 09:15:32,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:15:32" (1/1) ... [2024-11-10 09:15:32,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:15:32,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i[916,929] [2024-11-10 09:15:32,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:15:32,818 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:15:32,827 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i[916,929] [2024-11-10 09:15:32,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:15:32,871 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:15:32,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:32 WrapperNode [2024-11-10 09:15:32,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:15:32,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:15:32,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:15:32,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:15:32,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:32" (1/1) ... [2024-11-10 09:15:32,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:32" (1/1) ... [2024-11-10 09:15:32,947 INFO L138 Inliner]: procedures = 29, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2024-11-10 09:15:32,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:15:32,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:15:32,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:15:32,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:15:32,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:32" (1/1) ... [2024-11-10 09:15:32,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:32" (1/1) ... [2024-11-10 09:15:32,979 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:32" (1/1) ... [2024-11-10 09:15:33,024 INFO L175 MemorySlicer]: Split 131 memory accesses to 7 slices as follows [2, 36, 8, 19, 38, 17, 11]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 6, 1, 2, 4, 1, 1]. The 17 writes are split as follows [0, 7, 1, 2, 4, 2, 1]. [2024-11-10 09:15:33,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:32" (1/1) ... [2024-11-10 09:15:33,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:32" (1/1) ... [2024-11-10 09:15:33,072 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:32" (1/1) ... [2024-11-10 09:15:33,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:32" (1/1) ... [2024-11-10 09:15:33,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:32" (1/1) ... [2024-11-10 09:15:33,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:32" (1/1) ... [2024-11-10 09:15:33,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:15:33,103 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:15:33,106 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:15:33,106 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:15:33,107 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:32" (1/1) ... [2024-11-10 09:15:33,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:15:33,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:15:33,154 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:15:33,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:15:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:15:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-10 09:15:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-10 09:15:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-10 09:15:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-10 09:15:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-10 09:15:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-10 09:15:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-10 09:15:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 09:15:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 09:15:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 09:15:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 09:15:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 09:15:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 09:15:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-10 09:15:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-10 09:15:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-10 09:15:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-10 09:15:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-10 09:15:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-10 09:15:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-10 09:15:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-10 09:15:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 09:15:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 09:15:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 09:15:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 09:15:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 09:15:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 09:15:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-10 09:15:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-10 09:15:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-10 09:15:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-10 09:15:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-10 09:15:33,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-10 09:15:33,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-10 09:15:33,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-10 09:15:33,209 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:15:33,209 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:15:33,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:15:33,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 09:15:33,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 09:15:33,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 09:15:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 09:15:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 09:15:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-10 09:15:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:15:33,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:15:33,323 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:15:33,325 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:15:33,697 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L105: havoc property_#t~mem87#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite100#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite97#1;havoc property_#t~mem96#1;havoc property_#t~mem95#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~ite115#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite114#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite113#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short116#1;havoc property_#t~mem121#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem122#1;havoc property_#t~ite132#1;havoc property_#t~mem131#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~short126#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~short129#1;havoc property_#t~short130#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1; [2024-11-10 09:15:33,726 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-10 09:15:33,727 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:15:33,747 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:15:33,748 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:15:33,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:15:33 BoogieIcfgContainer [2024-11-10 09:15:33,748 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:15:33,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:15:33,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:15:33,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:15:33,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:15:32" (1/3) ... [2024-11-10 09:15:33,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1495355a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:15:33, skipping insertion in model container [2024-11-10 09:15:33,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:32" (2/3) ... [2024-11-10 09:15:33,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1495355a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:15:33, skipping insertion in model container [2024-11-10 09:15:33,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:15:33" (3/3) ... [2024-11-10 09:15:33,755 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-44.i [2024-11-10 09:15:33,768 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:15:33,769 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:15:33,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:15:33,836 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;@2239df5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:15:33,837 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:15:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 98 states have internal predecessors, (133), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:15:33,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-10 09:15:33,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:33,857 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:15:33,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:33,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:33,862 INFO L85 PathProgramCache]: Analyzing trace with hash -595531206, now seen corresponding path program 1 times [2024-11-10 09:15:33,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:15:33,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512167198] [2024-11-10 09:15:33,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:33,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:15:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:15:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:15:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:15:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:15:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:15:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:15:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:15:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:15:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:15:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:15:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:15:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:15:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:15:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:15:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:15:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:15:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:15:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:15:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:15:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 09:15:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 09:15:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,323 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 09:15:34,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:15:34,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512167198] [2024-11-10 09:15:34,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512167198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:15:34,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:15:34,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:15:34,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21486611] [2024-11-10 09:15:34,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:34,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:15:34,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:15:34,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:15:34,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:15:34,356 INFO L87 Difference]: Start difference. First operand has 121 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 98 states have internal predecessors, (133), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-10 09:15:34,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:34,382 INFO L93 Difference]: Finished difference Result 234 states and 364 transitions. [2024-11-10 09:15:34,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:15:34,385 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 161 [2024-11-10 09:15:34,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:34,392 INFO L225 Difference]: With dead ends: 234 [2024-11-10 09:15:34,393 INFO L226 Difference]: Without dead ends: 116 [2024-11-10 09:15:34,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-11-10 09:15:34,402 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:34,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:15:34,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-10 09:15:34,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-10 09:15:34,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:15:34,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 167 transitions. [2024-11-10 09:15:34,466 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 167 transitions. Word has length 161 [2024-11-10 09:15:34,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:34,466 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 167 transitions. [2024-11-10 09:15:34,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-10 09:15:34,467 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 167 transitions. [2024-11-10 09:15:34,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-10 09:15:34,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:34,476 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:15:34,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:15:34,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:34,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:34,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1136618349, now seen corresponding path program 1 times [2024-11-10 09:15:34,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:15:34,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887544358] [2024-11-10 09:15:34,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:34,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:15:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:15:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:15:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:15:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:15:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:15:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:15:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:15:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:15:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:15:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:15:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:15:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:15:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:15:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:15:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:15:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:15:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:15:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:15:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:15:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 09:15:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 09:15:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 09:15:34,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:15:34,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887544358] [2024-11-10 09:15:34,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887544358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:15:34,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:15:34,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:15:34,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124364966] [2024-11-10 09:15:34,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:34,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:15:34,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:15:34,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:15:34,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:15:34,779 INFO L87 Difference]: Start difference. First operand 116 states and 167 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:34,826 INFO L93 Difference]: Finished difference Result 232 states and 335 transitions. [2024-11-10 09:15:34,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:15:34,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 161 [2024-11-10 09:15:34,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:34,830 INFO L225 Difference]: With dead ends: 232 [2024-11-10 09:15:34,832 INFO L226 Difference]: Without dead ends: 119 [2024-11-10 09:15:34,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:15:34,833 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 1 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:34,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 483 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:15:34,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-10 09:15:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-10 09:15:34,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 95 states have internal predecessors, (127), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:15:34,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 169 transitions. [2024-11-10 09:15:34,853 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 169 transitions. Word has length 161 [2024-11-10 09:15:34,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:34,854 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 169 transitions. [2024-11-10 09:15:34,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:34,855 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 169 transitions. [2024-11-10 09:15:34,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-10 09:15:34,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:34,856 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:15:34,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:15:34,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:34,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:34,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1165247500, now seen corresponding path program 1 times [2024-11-10 09:15:34,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:15:34,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579901624] [2024-11-10 09:15:34,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:34,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:15:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:15:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:15:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:15:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:15:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:15:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:15:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:15:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:15:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:15:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:15:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:15:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:15:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:15:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:15:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:15:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:15:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:15:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:15:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:15:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 09:15:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 09:15:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,266 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 09:15:35,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:15:35,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579901624] [2024-11-10 09:15:35,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579901624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:15:35,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:15:35,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:15:35,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835487736] [2024-11-10 09:15:35,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:35,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:15:35,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:15:35,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:15:35,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:15:35,269 INFO L87 Difference]: Start difference. First operand 118 states and 169 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:35,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:35,428 INFO L93 Difference]: Finished difference Result 335 states and 481 transitions. [2024-11-10 09:15:35,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:15:35,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 161 [2024-11-10 09:15:35,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:35,432 INFO L225 Difference]: With dead ends: 335 [2024-11-10 09:15:35,434 INFO L226 Difference]: Without dead ends: 220 [2024-11-10 09:15:35,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:15:35,436 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 132 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:35,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 852 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:15:35,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-10 09:15:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2024-11-10 09:15:35,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 176 states have (on average 1.3465909090909092) internal successors, (237), 177 states have internal predecessors, (237), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 09:15:35,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 311 transitions. [2024-11-10 09:15:35,459 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 311 transitions. Word has length 161 [2024-11-10 09:15:35,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:35,460 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 311 transitions. [2024-11-10 09:15:35,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 311 transitions. [2024-11-10 09:15:35,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 09:15:35,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:35,465 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:15:35,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:15:35,466 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:35,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:35,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1037080718, now seen corresponding path program 1 times [2024-11-10 09:15:35,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:15:35,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236936126] [2024-11-10 09:15:35,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:35,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:15:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:15:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:15:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:15:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:15:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:15:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:15:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:15:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:15:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:15:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:15:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:15:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:15:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:15:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:15:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:15:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:15:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:15:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:15:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:15:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 09:15:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 09:15:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:35,882 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 09:15:35,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:15:35,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236936126] [2024-11-10 09:15:35,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236936126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:15:35,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:15:35,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:15:35,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432340451] [2024-11-10 09:15:35,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:35,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:15:35,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:15:35,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:15:35,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:15:35,886 INFO L87 Difference]: Start difference. First operand 216 states and 311 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:36,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:36,084 INFO L93 Difference]: Finished difference Result 469 states and 673 transitions. [2024-11-10 09:15:36,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:15:36,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 162 [2024-11-10 09:15:36,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:36,089 INFO L225 Difference]: With dead ends: 469 [2024-11-10 09:15:36,089 INFO L226 Difference]: Without dead ends: 256 [2024-11-10 09:15:36,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:15:36,091 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 116 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:36,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1113 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:15:36,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-10 09:15:36,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 252. [2024-11-10 09:15:36,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 201 states have (on average 1.328358208955224) internal successors, (267), 203 states have internal predecessors, (267), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-10 09:15:36,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 361 transitions. [2024-11-10 09:15:36,118 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 361 transitions. Word has length 162 [2024-11-10 09:15:36,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:36,121 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 361 transitions. [2024-11-10 09:15:36,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:36,121 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 361 transitions. [2024-11-10 09:15:36,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 09:15:36,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:36,124 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:15:36,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:15:36,124 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:36,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:36,125 INFO L85 PathProgramCache]: Analyzing trace with hash 948352245, now seen corresponding path program 1 times [2024-11-10 09:15:36,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:15:36,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421518488] [2024-11-10 09:15:36,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:36,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:15:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:15:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:15:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:15:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:15:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:15:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:15:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:15:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:15:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:15:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:15:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:15:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:15:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:15:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:15:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:15:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:15:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:15:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:15:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:15:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 09:15:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 09:15:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 09:15:36,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:15:36,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421518488] [2024-11-10 09:15:36,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421518488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:15:36,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:15:36,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:15:36,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144343795] [2024-11-10 09:15:36,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:36,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:15:36,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:15:36,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:15:36,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:15:36,293 INFO L87 Difference]: Start difference. First operand 252 states and 361 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:36,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:36,322 INFO L93 Difference]: Finished difference Result 475 states and 679 transitions. [2024-11-10 09:15:36,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:15:36,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-11-10 09:15:36,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:36,326 INFO L225 Difference]: With dead ends: 475 [2024-11-10 09:15:36,326 INFO L226 Difference]: Without dead ends: 258 [2024-11-10 09:15:36,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:15:36,327 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:36,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 639 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:15:36,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-10 09:15:36,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-11-10 09:15:36,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 207 states have (on average 1.318840579710145) internal successors, (273), 209 states have internal predecessors, (273), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-10 09:15:36,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 367 transitions. [2024-11-10 09:15:36,347 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 367 transitions. Word has length 163 [2024-11-10 09:15:36,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:36,347 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 367 transitions. [2024-11-10 09:15:36,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:36,347 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 367 transitions. [2024-11-10 09:15:36,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 09:15:36,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:36,349 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:15:36,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 09:15:36,349 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:36,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:36,349 INFO L85 PathProgramCache]: Analyzing trace with hash 835422351, now seen corresponding path program 1 times [2024-11-10 09:15:36,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:15:36,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824295898] [2024-11-10 09:15:36,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:36,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:15:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:15:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:15:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:15:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:15:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:15:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:15:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:15:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:15:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:15:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:15:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:15:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:15:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:15:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:15:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:15:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:15:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:15:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:15:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:15:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 09:15:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 09:15:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 09:15:36,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:15:36,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824295898] [2024-11-10 09:15:36,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824295898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:15:36,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:15:36,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:15:36,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900004607] [2024-11-10 09:15:36,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:36,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:15:36,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:15:36,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:15:36,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:15:36,689 INFO L87 Difference]: Start difference. First operand 258 states and 367 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:36,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:36,825 INFO L93 Difference]: Finished difference Result 487 states and 683 transitions. [2024-11-10 09:15:36,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:15:36,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 165 [2024-11-10 09:15:36,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:36,827 INFO L225 Difference]: With dead ends: 487 [2024-11-10 09:15:36,827 INFO L226 Difference]: Without dead ends: 264 [2024-11-10 09:15:36,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:15:36,828 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 110 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:36,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 660 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:15:36,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-10 09:15:36,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 224. [2024-11-10 09:15:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 182 states have (on average 1.3076923076923077) internal successors, (238), 183 states have internal predecessors, (238), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 09:15:36,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 312 transitions. [2024-11-10 09:15:36,837 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 312 transitions. Word has length 165 [2024-11-10 09:15:36,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:36,838 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 312 transitions. [2024-11-10 09:15:36,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:36,838 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 312 transitions. [2024-11-10 09:15:36,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 09:15:36,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:36,839 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:15:36,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 09:15:36,840 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:36,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:36,840 INFO L85 PathProgramCache]: Analyzing trace with hash -955148813, now seen corresponding path program 1 times [2024-11-10 09:15:36,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:15:36,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996350235] [2024-11-10 09:15:36,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:36,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:15:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:15:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:15:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:15:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:15:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:15:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:15:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:15:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:15:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:15:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:15:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:15:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:15:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:15:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:15:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:15:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:15:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:15:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:15:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:15:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 09:15:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 09:15:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 09:15:36,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:15:36,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996350235] [2024-11-10 09:15:36,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996350235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:15:36,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:15:36,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:15:36,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992051522] [2024-11-10 09:15:36,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:36,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:15:36,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:15:36,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:15:36,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:15:36,962 INFO L87 Difference]: Start difference. First operand 224 states and 312 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:36,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:36,973 INFO L93 Difference]: Finished difference Result 445 states and 621 transitions. [2024-11-10 09:15:36,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:15:36,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 165 [2024-11-10 09:15:36,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:36,975 INFO L225 Difference]: With dead ends: 445 [2024-11-10 09:15:36,975 INFO L226 Difference]: Without dead ends: 224 [2024-11-10 09:15:36,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:15:36,976 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:36,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 326 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:15:36,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-10 09:15:36,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-11-10 09:15:36,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 182 states have (on average 1.2967032967032968) internal successors, (236), 183 states have internal predecessors, (236), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 09:15:36,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 310 transitions. [2024-11-10 09:15:36,985 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 310 transitions. Word has length 165 [2024-11-10 09:15:36,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:36,985 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 310 transitions. [2024-11-10 09:15:36,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:36,986 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 310 transitions. [2024-11-10 09:15:36,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-10 09:15:36,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:36,987 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:15:36,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 09:15:36,987 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:36,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:36,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1124453393, now seen corresponding path program 1 times [2024-11-10 09:15:36,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:15:36,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713683587] [2024-11-10 09:15:36,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:36,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:15:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:15:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:15:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:15:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:15:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:15:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:15:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:15:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:15:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:15:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:15:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:15:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:15:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:15:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:15:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:15:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:15:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:15:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:15:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:15:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 09:15:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 09:15:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,332 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 09:15:37,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:15:37,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713683587] [2024-11-10 09:15:37,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713683587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:15:37,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:15:37,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:15:37,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900428301] [2024-11-10 09:15:37,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:37,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:15:37,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:15:37,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:15:37,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:15:37,334 INFO L87 Difference]: Start difference. First operand 224 states and 310 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:37,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:37,411 INFO L93 Difference]: Finished difference Result 666 states and 924 transitions. [2024-11-10 09:15:37,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:15:37,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 166 [2024-11-10 09:15:37,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:37,414 INFO L225 Difference]: With dead ends: 666 [2024-11-10 09:15:37,414 INFO L226 Difference]: Without dead ends: 445 [2024-11-10 09:15:37,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:15:37,415 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 99 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:37,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 427 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:15:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-10 09:15:37,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 430. [2024-11-10 09:15:37,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 347 states have (on average 1.2881844380403458) internal successors, (447), 349 states have internal predecessors, (447), 74 states have call successors, (74), 8 states have call predecessors, (74), 8 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-10 09:15:37,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 595 transitions. [2024-11-10 09:15:37,434 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 595 transitions. Word has length 166 [2024-11-10 09:15:37,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:37,434 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 595 transitions. [2024-11-10 09:15:37,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:37,435 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 595 transitions. [2024-11-10 09:15:37,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-10 09:15:37,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:37,436 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:15:37,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 09:15:37,436 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:37,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:37,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1402892317, now seen corresponding path program 1 times [2024-11-10 09:15:37,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:15:37,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002893181] [2024-11-10 09:15:37,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:37,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:15:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:15:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:15:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:15:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:15:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:15:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:15:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:15:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:15:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:15:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:15:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:15:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:15:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:15:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:15:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:15:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:15:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:15:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:15:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:15:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 09:15:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 09:15:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:37,571 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 09:15:37,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:15:37,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002893181] [2024-11-10 09:15:37,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002893181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:15:37,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:15:37,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:15:37,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067494510] [2024-11-10 09:15:37,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:37,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:15:37,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:15:37,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:15:37,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:15:37,573 INFO L87 Difference]: Start difference. First operand 430 states and 595 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:37,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:37,617 INFO L93 Difference]: Finished difference Result 859 states and 1189 transitions. [2024-11-10 09:15:37,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:15:37,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 167 [2024-11-10 09:15:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:37,620 INFO L225 Difference]: With dead ends: 859 [2024-11-10 09:15:37,620 INFO L226 Difference]: Without dead ends: 432 [2024-11-10 09:15:37,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:15:37,621 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 2 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:37,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 474 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:15:37,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-10 09:15:37,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 430. [2024-11-10 09:15:37,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 347 states have (on average 1.276657060518732) internal successors, (443), 349 states have internal predecessors, (443), 74 states have call successors, (74), 8 states have call predecessors, (74), 8 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-10 09:15:37,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 591 transitions. [2024-11-10 09:15:37,648 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 591 transitions. Word has length 167 [2024-11-10 09:15:37,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:37,649 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 591 transitions. [2024-11-10 09:15:37,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 591 transitions. [2024-11-10 09:15:37,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-10 09:15:37,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:37,651 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:15:37,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 09:15:37,651 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:37,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:37,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1364571828, now seen corresponding path program 1 times [2024-11-10 09:15:37,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:15:37,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736930779] [2024-11-10 09:15:37,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:37,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:15:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:38,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:15:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:38,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:15:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:38,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:15:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:38,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:15:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:38,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:15:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:38,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:15:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:38,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:15:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:38,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:15:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:38,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:15:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:38,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:15:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:38,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:15:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:38,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:15:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:38,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:15:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:38,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:15:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:38,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:15:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:38,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:15:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:38,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:15:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:38,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:15:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:38,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:15:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:38,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 09:15:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:38,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 09:15:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:38,192 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 09:15:38,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:15:38,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736930779] [2024-11-10 09:15:38,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736930779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:15:38,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:15:38,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:15:38,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697488950] [2024-11-10 09:15:38,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:38,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:15:38,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:15:38,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:15:38,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:15:38,194 INFO L87 Difference]: Start difference. First operand 430 states and 591 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-10 09:15:38,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:38,388 INFO L93 Difference]: Finished difference Result 1076 states and 1479 transitions. [2024-11-10 09:15:38,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 09:15:38,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-10 09:15:38,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:38,391 INFO L225 Difference]: With dead ends: 1076 [2024-11-10 09:15:38,391 INFO L226 Difference]: Without dead ends: 649 [2024-11-10 09:15:38,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:15:38,393 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 130 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:38,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1508 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:15:38,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-10 09:15:38,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 644. [2024-11-10 09:15:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 521 states have (on average 1.272552783109405) internal successors, (663), 525 states have internal predecessors, (663), 110 states have call successors, (110), 12 states have call predecessors, (110), 12 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-10 09:15:38,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 883 transitions. [2024-11-10 09:15:38,421 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 883 transitions. Word has length 168 [2024-11-10 09:15:38,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:38,422 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 883 transitions. [2024-11-10 09:15:38,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-10 09:15:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 883 transitions. [2024-11-10 09:15:38,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-10 09:15:38,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:38,423 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:15:38,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 09:15:38,424 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:38,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:38,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1395591635, now seen corresponding path program 1 times [2024-11-10 09:15:38,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:15:38,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884131273] [2024-11-10 09:15:38,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:38,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:15:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:39,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:15:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:39,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:15:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:39,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:15:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:39,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:15:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:39,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:15:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:39,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:15:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:39,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:15:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:39,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:15:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:39,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:15:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:39,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:15:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:39,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:15:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:39,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:15:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:39,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:15:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:39,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:15:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:39,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:15:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:39,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:15:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:39,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:15:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:39,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:15:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:39,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:15:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:39,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 09:15:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:39,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 09:15:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:39,290 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 09:15:39,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:15:39,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884131273] [2024-11-10 09:15:39,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884131273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:15:39,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:15:39,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:15:39,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326328215] [2024-11-10 09:15:39,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:39,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:15:39,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:15:39,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:15:39,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:15:39,292 INFO L87 Difference]: Start difference. First operand 644 states and 883 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:40,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:40,012 INFO L93 Difference]: Finished difference Result 1498 states and 2057 transitions. [2024-11-10 09:15:40,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:15:40,013 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-10 09:15:40,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:40,018 INFO L225 Difference]: With dead ends: 1498 [2024-11-10 09:15:40,018 INFO L226 Difference]: Without dead ends: 857 [2024-11-10 09:15:40,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:15:40,021 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 134 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:40,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1652 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:15:40,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-11-10 09:15:40,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 682. [2024-11-10 09:15:40,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 559 states have (on average 1.2826475849731664) internal successors, (717), 563 states have internal predecessors, (717), 110 states have call successors, (110), 12 states have call predecessors, (110), 12 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-10 09:15:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 937 transitions. [2024-11-10 09:15:40,061 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 937 transitions. Word has length 168 [2024-11-10 09:15:40,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:40,062 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 937 transitions. [2024-11-10 09:15:40,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 937 transitions. [2024-11-10 09:15:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-10 09:15:40,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:40,091 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:15:40,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 09:15:40,092 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:40,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:40,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1391823852, now seen corresponding path program 1 times [2024-11-10 09:15:40,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:15:40,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852531194] [2024-11-10 09:15:40,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:40,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:15:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:15:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:15:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:15:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:15:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:15:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:15:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:15:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:15:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:15:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:15:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:15:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:15:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:15:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:15:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:15:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:15:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:15:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:15:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:15:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 09:15:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 09:15:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,356 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 09:15:40,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:15:40,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852531194] [2024-11-10 09:15:40,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852531194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:15:40,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:15:40,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:15:40,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506041805] [2024-11-10 09:15:40,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:40,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:15:40,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:15:40,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:15:40,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:15:40,358 INFO L87 Difference]: Start difference. First operand 682 states and 937 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-10 09:15:40,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:40,560 INFO L93 Difference]: Finished difference Result 1906 states and 2607 transitions. [2024-11-10 09:15:40,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:15:40,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-10 09:15:40,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:40,566 INFO L225 Difference]: With dead ends: 1906 [2024-11-10 09:15:40,566 INFO L226 Difference]: Without dead ends: 1227 [2024-11-10 09:15:40,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:15:40,568 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 123 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:40,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 680 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:15:40,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2024-11-10 09:15:40,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1218. [2024-11-10 09:15:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 999 states have (on average 1.2742742742742743) internal successors, (1273), 1009 states have internal predecessors, (1273), 194 states have call successors, (194), 24 states have call predecessors, (194), 24 states have return successors, (194), 184 states have call predecessors, (194), 194 states have call successors, (194) [2024-11-10 09:15:40,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1661 transitions. [2024-11-10 09:15:40,640 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1661 transitions. Word has length 168 [2024-11-10 09:15:40,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:40,641 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1661 transitions. [2024-11-10 09:15:40,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-10 09:15:40,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1661 transitions. [2024-11-10 09:15:40,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-10 09:15:40,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:40,642 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:15:40,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 09:15:40,643 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:40,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:40,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2088693332, now seen corresponding path program 1 times [2024-11-10 09:15:40,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:15:40,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010114469] [2024-11-10 09:15:40,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:40,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:15:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:15:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:15:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:15:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:15:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:15:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:15:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:15:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:15:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:15:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:15:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:15:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:15:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:15:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:15:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:15:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:15:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:15:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:15:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:15:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 09:15:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 09:15:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:40,855 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 09:15:40,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:15:40,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010114469] [2024-11-10 09:15:40,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010114469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:15:40,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:15:40,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:15:40,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875901315] [2024-11-10 09:15:40,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:40,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:15:40,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:15:40,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:15:40,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:15:40,857 INFO L87 Difference]: Start difference. First operand 1218 states and 1661 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-10 09:15:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:41,085 INFO L93 Difference]: Finished difference Result 2466 states and 3345 transitions. [2024-11-10 09:15:41,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:15:41,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-10 09:15:41,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:41,091 INFO L225 Difference]: With dead ends: 2466 [2024-11-10 09:15:41,092 INFO L226 Difference]: Without dead ends: 1251 [2024-11-10 09:15:41,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:15:41,094 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 122 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:41,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1108 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:15:41,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2024-11-10 09:15:41,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 734. [2024-11-10 09:15:41,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 605 states have (on average 1.2677685950413222) internal successors, (767), 609 states have internal predecessors, (767), 110 states have call successors, (110), 18 states have call predecessors, (110), 18 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-10 09:15:41,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 987 transitions. [2024-11-10 09:15:41,144 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 987 transitions. Word has length 168 [2024-11-10 09:15:41,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:41,144 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 987 transitions. [2024-11-10 09:15:41,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-10 09:15:41,145 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 987 transitions. [2024-11-10 09:15:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-10 09:15:41,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:41,146 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:15:41,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 09:15:41,146 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:41,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:41,147 INFO L85 PathProgramCache]: Analyzing trace with hash -698722155, now seen corresponding path program 1 times [2024-11-10 09:15:41,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:15:41,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685823722] [2024-11-10 09:15:41,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:41,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:15:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:41,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:15:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:41,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:15:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:41,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:15:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:41,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:15:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:41,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:15:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:41,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:15:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:41,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:15:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:41,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:15:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:41,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:15:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:41,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:15:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:41,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:15:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:41,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:15:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:41,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:15:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:41,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:15:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:41,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:15:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:41,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:15:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:41,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:15:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:41,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:15:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:41,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:15:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:41,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 09:15:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:41,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 09:15:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:41,912 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 09:15:41,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:15:41,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685823722] [2024-11-10 09:15:41,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685823722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:15:41,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:15:41,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 09:15:41,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710913217] [2024-11-10 09:15:41,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:41,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:15:41,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:15:41,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:15:41,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:15:41,914 INFO L87 Difference]: Start difference. First operand 734 states and 987 transitions. Second operand has 10 states, 8 states have (on average 8.25) internal successors, (66), 10 states have internal predecessors, (66), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-10 09:15:42,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:42,769 INFO L93 Difference]: Finished difference Result 1624 states and 2187 transitions. [2024-11-10 09:15:42,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 09:15:42,770 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.25) internal successors, (66), 10 states have internal predecessors, (66), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) Word has length 168 [2024-11-10 09:15:42,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:42,774 INFO L225 Difference]: With dead ends: 1624 [2024-11-10 09:15:42,774 INFO L226 Difference]: Without dead ends: 893 [2024-11-10 09:15:42,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:15:42,777 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 129 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:42,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1872 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 09:15:42,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2024-11-10 09:15:42,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 724. [2024-11-10 09:15:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 595 states have (on average 1.265546218487395) internal successors, (753), 599 states have internal predecessors, (753), 110 states have call successors, (110), 18 states have call predecessors, (110), 18 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-10 09:15:42,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 973 transitions. [2024-11-10 09:15:42,819 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 973 transitions. Word has length 168 [2024-11-10 09:15:42,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:42,820 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 973 transitions. [2024-11-10 09:15:42,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.25) internal successors, (66), 10 states have internal predecessors, (66), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-10 09:15:42,821 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 973 transitions. [2024-11-10 09:15:42,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 09:15:42,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:42,822 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:15:42,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 09:15:42,823 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:42,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:42,823 INFO L85 PathProgramCache]: Analyzing trace with hash -112970842, now seen corresponding path program 1 times [2024-11-10 09:15:42,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:15:42,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139141222] [2024-11-10 09:15:42,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:42,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:15:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:43,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:15:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:43,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:15:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:43,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:15:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:43,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:15:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:43,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:15:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:43,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:15:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:43,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:15:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:43,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:15:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:43,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:15:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:43,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:15:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:43,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:15:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:43,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:15:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:43,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:15:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:43,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:15:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:43,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:15:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:43,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:15:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:43,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:15:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:43,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:15:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:43,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:15:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:43,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 09:15:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:43,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 09:15:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 09:15:43,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:15:43,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139141222] [2024-11-10 09:15:43,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139141222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:15:43,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:15:43,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:15:43,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902799911] [2024-11-10 09:15:43,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:43,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:15:43,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:15:43,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:15:43,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:15:43,277 INFO L87 Difference]: Start difference. First operand 724 states and 973 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:43,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:43,502 INFO L93 Difference]: Finished difference Result 1469 states and 1981 transitions. [2024-11-10 09:15:43,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:15:43,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 169 [2024-11-10 09:15:43,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:43,506 INFO L225 Difference]: With dead ends: 1469 [2024-11-10 09:15:43,506 INFO L226 Difference]: Without dead ends: 748 [2024-11-10 09:15:43,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:15:43,508 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 92 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:43,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 461 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:15:43,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2024-11-10 09:15:43,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 715. [2024-11-10 09:15:43,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 586 states have (on average 1.264505119453925) internal successors, (741), 590 states have internal predecessors, (741), 110 states have call successors, (110), 18 states have call predecessors, (110), 18 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-10 09:15:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 961 transitions. [2024-11-10 09:15:43,561 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 961 transitions. Word has length 169 [2024-11-10 09:15:43,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:43,561 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 961 transitions. [2024-11-10 09:15:43,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 961 transitions. [2024-11-10 09:15:43,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 09:15:43,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:43,563 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:15:43,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 09:15:43,564 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:43,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:43,564 INFO L85 PathProgramCache]: Analyzing trace with hash -238314573, now seen corresponding path program 1 times [2024-11-10 09:15:43,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:15:43,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702023195] [2024-11-10 09:15:43,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:43,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:15:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:15:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:15:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:15:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:15:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:15:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:15:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:15:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:15:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:15:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:15:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:15:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:15:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:15:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:15:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:15:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:15:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:15:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:15:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:15:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 09:15:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 09:15:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 09:15:44,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:15:44,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702023195] [2024-11-10 09:15:44,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702023195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:15:44,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:15:44,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:15:44,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506435596] [2024-11-10 09:15:44,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:44,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:15:44,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:15:44,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:15:44,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:15:44,298 INFO L87 Difference]: Start difference. First operand 715 states and 961 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-10 09:15:44,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:44,498 INFO L93 Difference]: Finished difference Result 1683 states and 2239 transitions. [2024-11-10 09:15:44,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 09:15:44,498 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 169 [2024-11-10 09:15:44,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:44,502 INFO L225 Difference]: With dead ends: 1683 [2024-11-10 09:15:44,502 INFO L226 Difference]: Without dead ends: 971 [2024-11-10 09:15:44,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:15:44,504 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 44 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:44,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1321 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:15:44,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2024-11-10 09:15:44,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 806. [2024-11-10 09:15:44,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 677 states have (on average 1.2451994091580503) internal successors, (843), 681 states have internal predecessors, (843), 110 states have call successors, (110), 18 states have call predecessors, (110), 18 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-10 09:15:44,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1063 transitions. [2024-11-10 09:15:44,539 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1063 transitions. Word has length 169 [2024-11-10 09:15:44,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:44,540 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1063 transitions. [2024-11-10 09:15:44,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-10 09:15:44,540 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1063 transitions. [2024-11-10 09:15:44,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 09:15:44,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:44,541 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:15:44,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 09:15:44,541 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:44,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:44,542 INFO L85 PathProgramCache]: Analyzing trace with hash -647138798, now seen corresponding path program 1 times [2024-11-10 09:15:44,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:15:44,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315662649] [2024-11-10 09:15:44,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:44,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:15:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:15:44,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [466855775] [2024-11-10 09:15:44,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:44,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:15:44,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:15:44,648 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:15:44,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 09:15:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:44,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-10 09:15:44,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:15:45,230 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-10 09:15:45,333 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-10 09:15:45,397 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-10 09:15:45,458 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-10 09:15:45,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-10 09:15:46,034 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 90 treesize of output 54 [2024-11-10 09:15:46,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:15:46,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 24 [2024-11-10 09:15:46,054 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 49 treesize of output 33 [2024-11-10 09:15:46,100 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 323 proven. 237 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-10 09:15:46,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:15:47,550 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 09:15:47,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:15:47,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315662649] [2024-11-10 09:15:47,551 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 09:15:47,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466855775] [2024-11-10 09:15:47,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466855775] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:15:47,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:15:47,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16] total 21 [2024-11-10 09:15:47,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018762643] [2024-11-10 09:15:47,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:47,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:15:47,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:15:47,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:15:47,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-11-10 09:15:47,553 INFO L87 Difference]: Start difference. First operand 806 states and 1063 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:48,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:48,648 INFO L93 Difference]: Finished difference Result 1974 states and 2623 transitions. [2024-11-10 09:15:48,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:15:48,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 169 [2024-11-10 09:15:48,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:48,653 INFO L225 Difference]: With dead ends: 1974 [2024-11-10 09:15:48,653 INFO L226 Difference]: Without dead ends: 1171 [2024-11-10 09:15:48,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2024-11-10 09:15:48,656 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 235 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:48,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 739 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:15:48,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2024-11-10 09:15:48,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 820. [2024-11-10 09:15:48,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 691 states have (on average 1.2373371924746743) internal successors, (855), 695 states have internal predecessors, (855), 110 states have call successors, (110), 18 states have call predecessors, (110), 18 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-10 09:15:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1075 transitions. [2024-11-10 09:15:48,703 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1075 transitions. Word has length 169 [2024-11-10 09:15:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:48,703 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1075 transitions. [2024-11-10 09:15:48,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:48,704 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1075 transitions. [2024-11-10 09:15:48,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-10 09:15:48,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:48,705 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:15:48,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 09:15:48,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 09:15:48,906 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:48,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:48,907 INFO L85 PathProgramCache]: Analyzing trace with hash -77955158, now seen corresponding path program 1 times [2024-11-10 09:15:48,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:15:48,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145434344] [2024-11-10 09:15:48,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:48,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:15:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:49,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:15:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:49,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:15:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:49,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:15:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:49,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:15:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:49,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:15:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:49,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:15:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:49,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:15:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:49,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:15:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:49,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:15:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:49,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:15:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:49,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:15:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:49,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:15:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:49,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:15:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:49,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:15:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:49,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:15:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:49,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:15:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:49,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:15:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:49,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:15:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:49,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:15:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:49,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 09:15:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:49,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 09:15:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 09:15:49,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:15:49,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145434344] [2024-11-10 09:15:49,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145434344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:15:49,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:15:49,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:15:49,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141401537] [2024-11-10 09:15:49,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:49,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:15:49,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:15:49,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:15:49,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:15:49,117 INFO L87 Difference]: Start difference. First operand 820 states and 1075 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:49,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:49,342 INFO L93 Difference]: Finished difference Result 1680 states and 2215 transitions. [2024-11-10 09:15:49,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:15:49,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 171 [2024-11-10 09:15:49,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:49,347 INFO L225 Difference]: With dead ends: 1680 [2024-11-10 09:15:49,347 INFO L226 Difference]: Without dead ends: 1227 [2024-11-10 09:15:49,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:15:49,350 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 155 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:49,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 649 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:15:49,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2024-11-10 09:15:49,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1189. [2024-11-10 09:15:49,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 996 states have (on average 1.2349397590361446) internal successors, (1230), 1002 states have internal predecessors, (1230), 165 states have call successors, (165), 27 states have call predecessors, (165), 27 states have return successors, (165), 159 states have call predecessors, (165), 165 states have call successors, (165) [2024-11-10 09:15:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1560 transitions. [2024-11-10 09:15:49,417 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1560 transitions. Word has length 171 [2024-11-10 09:15:49,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:49,418 INFO L471 AbstractCegarLoop]: Abstraction has 1189 states and 1560 transitions. [2024-11-10 09:15:49,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:15:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1560 transitions. [2024-11-10 09:15:49,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-10 09:15:49,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:49,419 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:15:49,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 09:15:49,420 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:49,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:49,420 INFO L85 PathProgramCache]: Analyzing trace with hash 666334568, now seen corresponding path program 1 times [2024-11-10 09:15:49,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:15:49,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900492900] [2024-11-10 09:15:49,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:49,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:15:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:15:49,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1244526231] [2024-11-10 09:15:49,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:49,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:15:49,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:15:49,483 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:15:49,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 09:15:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:15:49,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:15:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:15:49,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:15:49,982 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:15:49,983 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:15:50,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 09:15:50,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:15:50,188 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:15:50,306 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:15:50,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:15:50 BoogieIcfgContainer [2024-11-10 09:15:50,309 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:15:50,309 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:15:50,309 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:15:50,309 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:15:50,310 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:15:33" (3/4) ... [2024-11-10 09:15:50,312 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:15:50,313 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:15:50,313 INFO L158 Benchmark]: Toolchain (without parser) took 17702.64ms. Allocated memory was 209.7MB in the beginning and 694.2MB in the end (delta: 484.4MB). Free memory was 140.6MB in the beginning and 482.8MB in the end (delta: -342.2MB). Peak memory consumption was 143.8MB. Max. memory is 16.1GB. [2024-11-10 09:15:50,313 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:15:50,313 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.70ms. Allocated memory is still 209.7MB. Free memory was 140.4MB in the beginning and 123.4MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 09:15:50,314 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.58ms. Allocated memory is still 209.7MB. Free memory was 123.4MB in the beginning and 179.0MB in the end (delta: -55.5MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2024-11-10 09:15:50,314 INFO L158 Benchmark]: Boogie Preprocessor took 154.05ms. Allocated memory is still 209.7MB. Free memory was 179.0MB in the beginning and 174.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:15:50,314 INFO L158 Benchmark]: IcfgBuilder took 645.55ms. Allocated memory is still 209.7MB. Free memory was 174.7MB in the beginning and 136.1MB in the end (delta: 38.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-10 09:15:50,314 INFO L158 Benchmark]: TraceAbstraction took 16559.16ms. Allocated memory was 209.7MB in the beginning and 694.2MB in the end (delta: 484.4MB). Free memory was 135.2MB in the beginning and 482.8MB in the end (delta: -347.6MB). Peak memory consumption was 139.7MB. Max. memory is 16.1GB. [2024-11-10 09:15:50,314 INFO L158 Benchmark]: Witness Printer took 3.65ms. Allocated memory is still 694.2MB. Free memory is still 482.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:15:50,315 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.14ms. Allocated memory is still 104.9MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.70ms. Allocated memory is still 209.7MB. Free memory was 140.4MB in the beginning and 123.4MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.58ms. Allocated memory is still 209.7MB. Free memory was 123.4MB in the beginning and 179.0MB in the end (delta: -55.5MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 154.05ms. Allocated memory is still 209.7MB. Free memory was 179.0MB in the beginning and 174.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 645.55ms. Allocated memory is still 209.7MB. Free memory was 174.7MB in the beginning and 136.1MB in the end (delta: 38.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16559.16ms. Allocated memory was 209.7MB in the beginning and 694.2MB in the end (delta: 484.4MB). Free memory was 135.2MB in the beginning and 482.8MB in the end (delta: -347.6MB). Peak memory consumption was 139.7MB. Max. memory is 16.1GB. * Witness Printer took 3.65ms. Allocated memory is still 694.2MB. Free memory is still 482.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someUnaryFLOAToperation at line 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 0}, {0, 0, 0} }; [L25-L27] double double_Array_0[1] = { 10.5 }; [L25-L27] double double_Array_0[1] = { 10.5 }; [L28-L30] float float_Array_0[2] = { 50.75, 32.6 }; [L28-L30] float float_Array_0[2] = { 50.75, 32.6 }; [L28-L30] float float_Array_0[2] = { 50.75, 32.6 }; [L31-L33] signed char signed_char_Array_0[2][2] = { {50, -64}, {-1, -25} }; [L31-L33] signed char signed_char_Array_0[2][2] = { {50, -64}, {-1, -25} }; [L31-L33] signed char signed_char_Array_0[2][2] = { {50, -64}, {-1, -25} }; [L31-L33] signed char signed_char_Array_0[2][2] = { {50, -64}, {-1, -25} }; [L31-L33] signed char signed_char_Array_0[2][2] = { {50, -64}, {-1, -25} }; [L34-L36] signed long int signed_long_int_Array_0[1] = { 32 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { 32 }; [L37-L39] unsigned char unsigned_char_Array_0[1] = { 1 }; [L37-L39] unsigned char unsigned_char_Array_0[1] = { 1 }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] FCALL updateLastVariables() [L113] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L71] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L72] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L74] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L75] BOOL_unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L78] BOOL_unsigned_char_Array_0[1][2] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L81] double_Array_0[0] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[0] [L82] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L82] EXPR double_Array_0[0] [L82] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L83] float_Array_0[1] = __VERIFIER_nondet_float() [L84] EXPR float_Array_0[1] [L84] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L84] EXPR float_Array_0[1] [L84] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L85] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L87] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L89] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[1][0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L91] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L92] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L92] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L92] RET assume_abort_if_not(signed_char_Array_0[0][1] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L93] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L93] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L93] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L94] signed_char_Array_0[1][1] = __VERIFIER_nondet_char() [L95] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L95] CALL assume_abort_if_not(signed_char_Array_0[1][1] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L95] RET assume_abort_if_not(signed_char_Array_0[1][1] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L96] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L96] CALL assume_abort_if_not(signed_char_Array_0[1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L96] RET assume_abort_if_not(signed_char_Array_0[1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L97] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L98] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L98] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L98] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L99] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L99] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L99] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L100] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L100] CALL assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L100] RET assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L113] RET updateVariables() [L114] CALL step() [L43] EXPR signed_char_Array_0[0][1] [L43] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L43] EXPR ((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]) [L43] EXPR signed_char_Array_0[0][1] [L43] EXPR ((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L43] EXPR unsigned_char_Array_0[0] [L43] signed long int stepLocal_1 = ((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]; [L44] EXPR signed_char_Array_0[1][0] [L44] EXPR signed_char_Array_0[0][0] [L44] signed long int stepLocal_0 = signed_char_Array_0[1][0] - signed_char_Array_0[0][0]; [L45] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L45] COND FALSE !(signed_char_Array_0[0][1] > stepLocal_0) [L50] EXPR signed_char_Array_0[1][1] [L50] signed_long_int_Array_0[0] = signed_char_Array_0[1][1] [L52] EXPR float_Array_0[1] [L52] float_Array_0[0] = float_Array_0[1] [L53] EXPR double_Array_0[0] [L53] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L53] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) [L53] EXPR float_Array_0[0] [L53] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_1=-106, unsigned_char_Array_0={9:0}] [L53] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L53] COND TRUE (double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0] [L54] EXPR signed_char_Array_0[0][0] [L54] EXPR signed_long_int_Array_0[0] [L54] EXPR (signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_1=-106, unsigned_char_Array_0={9:0}] [L54] EXPR (signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2] [L54] EXPR BOOL_unsigned_char_Array_0[1][2] [L54] EXPR (signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_1=-106, unsigned_char_Array_0={9:0}] [L54] EXPR ((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_1=-106, unsigned_char_Array_0={9:0}] [L54] EXPR ((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2]) [L54] EXPR BOOL_unsigned_char_Array_0[1][1] [L54] EXPR BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_1=-106, unsigned_char_Array_0={9:0}] [L54] EXPR BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2] [L54] EXPR BOOL_unsigned_char_Array_0[0][2] [L54] EXPR BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_1=-106, unsigned_char_Array_0={9:0}] [L54] EXPR ((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_1=-106, unsigned_char_Array_0={9:0}] [L54] BOOL_unsigned_char_Array_0[0][1] = (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])) [L56] EXPR signed_long_int_Array_0[0] [L56] signed long int stepLocal_3 = signed_long_int_Array_0[0]; [L57] EXPR signed_long_int_Array_0[0] [L57] EXPR signed_long_int_Array_0[0] [L57] EXPR signed_char_Array_0[0][0] [L57] signed long int stepLocal_2 = signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]); [L58] BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L58] COND FALSE !(BOOL_unsigned_char_Array_0[0][1]) [L114] RET step() [L115] CALL, EXPR property() [L105] EXPR signed_char_Array_0[0][1] [L105] EXPR signed_char_Array_0[1][0] [L105] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1])) [L105] EXPR signed_long_int_Array_0[0] [L105] EXPR signed_char_Array_0[1][1] [L105] EXPR (signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1) [L105] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1 [L105] EXPR BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1)) && (((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1)) && (((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1) [L105] EXPR double_Array_0[0] [L105] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) [L105] EXPR float_Array_0[0] [L105] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1 [L105] EXPR ((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1)) && (((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1)) && (((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1)) && (((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1])) [L105] EXPR float_Array_0[0] [L105] EXPR float_Array_0[1] [L105] EXPR ((((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1)) && (((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105-L106] return ((((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1)) && (((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1])) ; [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.4s, OverallIterations: 19, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1630 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1624 mSDsluCounter, 15131 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11483 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2518 IncrementalHoareTripleChecker+Invalid, 2582 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 3648 mSDtfsCounter, 2518 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1211 GetRequests, 1106 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1218occurred in iteration=12, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 3504 NumberOfCodeBlocks, 3504 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3139 ConstructedInterpolants, 0 QuantifiedInterpolants, 11441 SizeOfPredicates, 13 NumberOfNonLiveVariables, 564 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 19 InterpolantComputations, 18 PerfectInterpolantSequences, 15723/15960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 09:15:50,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 eaa60ed61738bb84f21e0e7461cdcc453d531566de1a87a0cbf8ab788e5233b0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:15:52,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:15:52,486 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:15:52,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:15:52,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:15:52,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:15:52,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:15:52,530 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:15:52,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:15:52,530 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:15:52,530 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:15:52,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:15:52,531 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:15:52,531 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:15:52,531 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:15:52,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:15:52,532 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:15:52,534 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:15:52,534 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:15:52,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:15:52,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:15:52,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:15:52,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:15:52,538 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:15:52,538 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:15:52,539 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:15:52,539 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:15:52,539 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:15:52,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:15:52,539 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:15:52,539 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:15:52,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:15:52,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:15:52,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:15:52,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:15:52,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:15:52,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:15:52,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:15:52,541 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:15:52,541 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:15:52,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:15:52,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:15:52,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:15:52,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:15:52,546 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/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/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 -> eaa60ed61738bb84f21e0e7461cdcc453d531566de1a87a0cbf8ab788e5233b0 [2024-11-10 09:15:52,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:15:52,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:15:52,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:15:52,944 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:15:52,944 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:15:52,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i [2024-11-10 09:15:54,359 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:15:54,530 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:15:54,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i [2024-11-10 09:15:54,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f81323a0/014f6c24a0534d00bf0978aba5c6bba5/FLAGde96ac9c2 [2024-11-10 09:15:54,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f81323a0/014f6c24a0534d00bf0978aba5c6bba5 [2024-11-10 09:15:54,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:15:54,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:15:54,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:15:54,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:15:54,557 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:15:54,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:15:54" (1/1) ... [2024-11-10 09:15:54,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d855cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:54, skipping insertion in model container [2024-11-10 09:15:54,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:15:54" (1/1) ... [2024-11-10 09:15:54,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:15:54,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i[916,929] [2024-11-10 09:15:54,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:15:54,805 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:15:54,816 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i[916,929] [2024-11-10 09:15:54,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:15:54,904 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:15:54,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:54 WrapperNode [2024-11-10 09:15:54,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:15:54,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:15:54,905 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:15:54,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:15:54,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:54" (1/1) ... [2024-11-10 09:15:54,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:54" (1/1) ... [2024-11-10 09:15:54,948 INFO L138 Inliner]: procedures = 36, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 488 [2024-11-10 09:15:54,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:15:54,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:15:54,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:15:54,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:15:54,957 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:54" (1/1) ... [2024-11-10 09:15:54,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:54" (1/1) ... [2024-11-10 09:15:54,964 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:54" (1/1) ... [2024-11-10 09:15:54,980 INFO L175 MemorySlicer]: Split 131 memory accesses to 7 slices as follows [2, 36, 8, 19, 38, 17, 11]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 6, 1, 2, 4, 1, 1]. The 17 writes are split as follows [0, 7, 1, 2, 4, 2, 1]. [2024-11-10 09:15:54,980 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:54" (1/1) ... [2024-11-10 09:15:54,980 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:54" (1/1) ... [2024-11-10 09:15:54,997 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:54" (1/1) ... [2024-11-10 09:15:54,998 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:54" (1/1) ... [2024-11-10 09:15:55,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:54" (1/1) ... [2024-11-10 09:15:55,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:54" (1/1) ... [2024-11-10 09:15:55,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:15:55,010 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:15:55,010 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:15:55,010 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:15:55,010 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:54" (1/1) ... [2024-11-10 09:15:55,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:15:55,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:15:55,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:15:55,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:15:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:15:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-10 09:15:55,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-10 09:15:55,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-10 09:15:55,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-10 09:15:55,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-10 09:15:55,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-10 09:15:55,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-10 09:15:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-10 09:15:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-10 09:15:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-10 09:15:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-10 09:15:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-10 09:15:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-10 09:15:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-10 09:15:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 09:15:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 09:15:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-10 09:15:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-10 09:15:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-10 09:15:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-10 09:15:55,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-10 09:15:55,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:15:55,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 09:15:55,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 09:15:55,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-10 09:15:55,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-10 09:15:55,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-10 09:15:55,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-10 09:15:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-10 09:15:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-10 09:15:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-10 09:15:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-10 09:15:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-10 09:15:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-10 09:15:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-10 09:15:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-10 09:15:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-10 09:15:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-10 09:15:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-10 09:15:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-10 09:15:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-10 09:15:55,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-10 09:15:55,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-10 09:15:55,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-10 09:15:55,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-10 09:15:55,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-10 09:15:55,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-10 09:15:55,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-10 09:15:55,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-10 09:15:55,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 09:15:55,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 09:15:55,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-10 09:15:55,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-10 09:15:55,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-10 09:15:55,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-10 09:15:55,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-10 09:15:55,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-10 09:15:55,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-10 09:15:55,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-10 09:15:55,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-10 09:15:55,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-10 09:15:55,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-10 09:15:55,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-10 09:15:55,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-10 09:15:55,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-10 09:15:55,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-10 09:15:55,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-10 09:15:55,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-10 09:15:55,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-10 09:15:55,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-10 09:15:55,119 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:15:55,119 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:15:55,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:15:55,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:15:55,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-10 09:15:55,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-10 09:15:55,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-10 09:15:55,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-10 09:15:55,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-10 09:15:55,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-10 09:15:55,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-10 09:15:55,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 09:15:55,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 09:15:55,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-10 09:15:55,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-10 09:15:55,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-10 09:15:55,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-10 09:15:55,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-10 09:15:55,268 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:15:55,270 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:15:58,515 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L105: havoc property_#t~mem87#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite100#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite97#1;havoc property_#t~mem96#1;havoc property_#t~mem95#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~ite115#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite114#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite113#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short116#1;havoc property_#t~mem121#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem122#1;havoc property_#t~ite132#1;havoc property_#t~mem131#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~short126#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~short129#1;havoc property_#t~short130#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1; [2024-11-10 09:15:58,543 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-11-10 09:15:58,543 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:15:58,554 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:15:58,555 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:15:58,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:15:58 BoogieIcfgContainer [2024-11-10 09:15:58,555 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:15:58,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:15:58,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:15:58,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:15:58,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:15:54" (1/3) ... [2024-11-10 09:15:58,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e7cf87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:15:58, skipping insertion in model container [2024-11-10 09:15:58,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:15:54" (2/3) ... [2024-11-10 09:15:58,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e7cf87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:15:58, skipping insertion in model container [2024-11-10 09:15:58,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:15:58" (3/3) ... [2024-11-10 09:15:58,563 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-44.i [2024-11-10 09:15:58,576 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:15:58,577 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:15:58,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:15:58,633 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;@32f618da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:15:58,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:15:58,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 98 states have internal predecessors, (133), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:15:58,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-10 09:15:58,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:58,649 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:15:58,649 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:58,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:58,654 INFO L85 PathProgramCache]: Analyzing trace with hash -595531206, now seen corresponding path program 1 times [2024-11-10 09:15:58,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:15:58,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582906023] [2024-11-10 09:15:58,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:58,666 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-11-10 09:15:58,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:15:58,671 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-11-10 09:15:58,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-10 09:15:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:59,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:15:59,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:15:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-10 09:15:59,137 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:15:59,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:15:59,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582906023] [2024-11-10 09:15:59,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582906023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:15:59,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:15:59,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:15:59,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644707152] [2024-11-10 09:15:59,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:59,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:15:59,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:15:59,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:15:59,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:15:59,174 INFO L87 Difference]: Start difference. First operand has 121 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 98 states have internal predecessors, (133), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-10 09:15:59,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:59,208 INFO L93 Difference]: Finished difference Result 234 states and 364 transitions. [2024-11-10 09:15:59,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:15:59,211 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 161 [2024-11-10 09:15:59,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:59,219 INFO L225 Difference]: With dead ends: 234 [2024-11-10 09:15:59,219 INFO L226 Difference]: Without dead ends: 116 [2024-11-10 09:15:59,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 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-11-10 09:15:59,227 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:59,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:15:59,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-10 09:15:59,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-10 09:15:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:15:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 167 transitions. [2024-11-10 09:15:59,267 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 167 transitions. Word has length 161 [2024-11-10 09:15:59,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:59,268 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 167 transitions. [2024-11-10 09:15:59,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-10 09:15:59,268 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 167 transitions. [2024-11-10 09:15:59,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-10 09:15:59,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:59,275 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:15:59,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-11-10 09:15:59,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-11-10 09:15:59,480 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:59,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:59,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1136618349, now seen corresponding path program 1 times [2024-11-10 09:15:59,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:15:59,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479370280] [2024-11-10 09:15:59,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:59,481 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-11-10 09:15:59,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:15:59,483 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-11-10 09:15:59,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-10 09:15:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:59,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 09:15:59,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:15:59,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-10 09:16:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 09:16:00,074 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:16:00,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:16:00,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479370280] [2024-11-10 09:16:00,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479370280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:16:00,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:16:00,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:16:00,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138762349] [2024-11-10 09:16:00,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:16:00,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:16:00,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:16:00,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:16:00,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:16:00,079 INFO L87 Difference]: Start difference. First operand 116 states and 167 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:16:02,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:16:02,305 INFO L93 Difference]: Finished difference Result 329 states and 475 transitions. [2024-11-10 09:16:02,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:16:02,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 161 [2024-11-10 09:16:02,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:16:02,309 INFO L225 Difference]: With dead ends: 329 [2024-11-10 09:16:02,309 INFO L226 Difference]: Without dead ends: 216 [2024-11-10 09:16:02,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:16:02,311 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 132 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:16:02,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 852 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-10 09:16:02,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-10 09:16:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 212. [2024-11-10 09:16:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 172 states have (on average 1.3546511627906976) internal successors, (233), 173 states have internal predecessors, (233), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 09:16:02,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 307 transitions. [2024-11-10 09:16:02,331 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 307 transitions. Word has length 161 [2024-11-10 09:16:02,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:16:02,332 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 307 transitions. [2024-11-10 09:16:02,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:16:02,332 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 307 transitions. [2024-11-10 09:16:02,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 09:16:02,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:16:02,334 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:16:02,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-11-10 09:16:02,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-11-10 09:16:02,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:16:02,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:16:02,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1008451567, now seen corresponding path program 1 times [2024-11-10 09:16:02,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:16:02,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617626160] [2024-11-10 09:16:02,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:16:02,537 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-11-10 09:16:02,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:16:02,540 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-11-10 09:16:02,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-10 09:16:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:16:02,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 09:16:02,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:16:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 09:16:02,887 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:16:02,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:16:02,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617626160] [2024-11-10 09:16:02,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617626160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:16:02,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:16:02,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:16:02,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574134942] [2024-11-10 09:16:02,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:16:02,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:16:02,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:16:02,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:16:02,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:16:02,890 INFO L87 Difference]: Start difference. First operand 212 states and 307 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:16:02,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:16:02,934 INFO L93 Difference]: Finished difference Result 431 states and 625 transitions. [2024-11-10 09:16:02,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:16:02,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 162 [2024-11-10 09:16:02,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:16:02,938 INFO L225 Difference]: With dead ends: 431 [2024-11-10 09:16:02,938 INFO L226 Difference]: Without dead ends: 222 [2024-11-10 09:16:02,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:16:02,939 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 1 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:16:02,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 635 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:16:02,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-10 09:16:02,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2024-11-10 09:16:02,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 180 states have (on average 1.3388888888888888) internal successors, (241), 181 states have internal predecessors, (241), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 09:16:02,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 315 transitions. [2024-11-10 09:16:02,953 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 315 transitions. Word has length 162 [2024-11-10 09:16:02,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:16:02,954 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 315 transitions. [2024-11-10 09:16:02,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 09:16:02,954 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 315 transitions. [2024-11-10 09:16:02,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 09:16:02,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:16:02,966 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:16:02,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-11-10 09:16:03,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-11-10 09:16:03,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:16:03,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:16:03,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1037080718, now seen corresponding path program 1 times [2024-11-10 09:16:03,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:16:03,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129178730] [2024-11-10 09:16:03,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:16:03,169 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-11-10 09:16:03,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:16:03,173 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-11-10 09:16:03,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-10 09:16:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:16:03,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 09:16:03,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:16:03,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:16:03,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2024-11-10 09:16:03,676 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-10 09:16:03,677 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:16:03,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:16:03,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129178730] [2024-11-10 09:16:03,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129178730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:16:03,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:16:03,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:16:03,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373486687] [2024-11-10 09:16:03,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:16:03,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:16:03,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:16:03,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:16:03,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:16:03,679 INFO L87 Difference]: Start difference. First operand 220 states and 315 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-10 09:16:07,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:16:07,110 INFO L93 Difference]: Finished difference Result 439 states and 629 transitions. [2024-11-10 09:16:07,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:16:07,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 162 [2024-11-10 09:16:07,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:16:07,124 INFO L225 Difference]: With dead ends: 439 [2024-11-10 09:16:07,124 INFO L226 Difference]: Without dead ends: 222 [2024-11-10 09:16:07,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:16:07,128 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 133 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:16:07,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 540 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-10 09:16:07,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-10 09:16:07,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2024-11-10 09:16:07,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 180 states have (on average 1.3277777777777777) internal successors, (239), 181 states have internal predecessors, (239), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 09:16:07,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 313 transitions. [2024-11-10 09:16:07,147 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 313 transitions. Word has length 162 [2024-11-10 09:16:07,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:16:07,147 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 313 transitions. [2024-11-10 09:16:07,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-10 09:16:07,148 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 313 transitions. [2024-11-10 09:16:07,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 09:16:07,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:16:07,149 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 09:16:07,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-10 09:16:07,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-11-10 09:16:07,351 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:16:07,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:16:07,352 INFO L85 PathProgramCache]: Analyzing trace with hash -634813872, now seen corresponding path program 1 times [2024-11-10 09:16:07,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:16:07,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194223325] [2024-11-10 09:16:07,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:16:07,353 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-11-10 09:16:07,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:16:07,355 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-11-10 09:16:07,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-10 09:16:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:16:07,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 09:16:07,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:16:11,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:16:11,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 54 [2024-11-10 09:16:12,012 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 121 treesize of output 61 [2024-11-10 09:16:12,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:16:12,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 59 [2024-11-10 09:16:19,186 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 428 proven. 36 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-10 09:16:19,186 INFO L311 TraceCheckSpWp]: Computing backward predicates...